./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/weaver/popl20-three-array-min.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/popl20-three-array-min.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 632917bb2a5e88c193ba7761220e89039206b92cb89d98172ae8e9ad69d27ca8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 19:46:55,705 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 19:46:55,748 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-17 19:46:55,753 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 19:46:55,753 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 19:46:55,777 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 19:46:55,778 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 19:46:55,778 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 19:46:55,778 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 19:46:55,778 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 19:46:55,778 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 19:46:55,778 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 19:46:55,778 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 19:46:55,778 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 19:46:55,779 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 19:46:55,779 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 19:46:55,779 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 19:46:55,779 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 19:46:55,779 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 19:46:55,779 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 19:46:55,779 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 19:46:55,779 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 19:46:55,779 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 19:46:55,779 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 19:46:55,779 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-17 19:46:55,779 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 19:46:55,779 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 19:46:55,779 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 19:46:55,779 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 19:46:55,781 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 19:46:55,782 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 19:46:55,782 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 19:46:55,782 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 19:46:55,782 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 19:46:55,782 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 19:46:55,782 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 19:46:55,782 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 19:46:55,782 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 19:46:55,782 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 19:46:55,782 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 19:46:55,782 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 19:46:55,782 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 19:46:55,782 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 19:46:55,782 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 19:46:55,782 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 19:46:55,782 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/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 -> 632917bb2a5e88c193ba7761220e89039206b92cb89d98172ae8e9ad69d27ca8 [2025-03-17 19:46:56,005 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 19:46:56,012 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 19:46:56,015 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 19:46:56,017 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 19:46:56,017 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 19:46:56,018 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-three-array-min.wvr.c [2025-03-17 19:46:57,160 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/def098728/3324fb05581242babae33c464befc4dc/FLAG484a4a7f7 [2025-03-17 19:46:57,393 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 19:46:57,393 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-three-array-min.wvr.c [2025-03-17 19:46:57,402 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/def098728/3324fb05581242babae33c464befc4dc/FLAG484a4a7f7 [2025-03-17 19:46:57,722 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/def098728/3324fb05581242babae33c464befc4dc [2025-03-17 19:46:57,724 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 19:46:57,726 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 19:46:57,727 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 19:46:57,727 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 19:46:57,729 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 19:46:57,730 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 07:46:57" (1/1) ... [2025-03-17 19:46:57,731 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ace293c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:46:57, skipping insertion in model container [2025-03-17 19:46:57,731 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 07:46:57" (1/1) ... [2025-03-17 19:46:57,743 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 19:46:57,873 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 19:46:57,882 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 19:46:57,908 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 19:46:57,924 INFO L204 MainTranslator]: Completed translation [2025-03-17 19:46:57,925 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:46:57 WrapperNode [2025-03-17 19:46:57,925 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 19:46:57,926 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 19:46:57,926 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 19:46:57,926 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 19:46:57,930 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:46:57" (1/1) ... [2025-03-17 19:46:57,938 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:46:57" (1/1) ... [2025-03-17 19:46:57,962 INFO L138 Inliner]: procedures = 25, calls = 43, calls flagged for inlining = 15, calls inlined = 23, statements flattened = 264 [2025-03-17 19:46:57,962 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 19:46:57,962 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 19:46:57,962 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 19:46:57,963 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 19:46:57,968 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:46:57" (1/1) ... [2025-03-17 19:46:57,969 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:46:57" (1/1) ... [2025-03-17 19:46:57,971 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:46:57" (1/1) ... [2025-03-17 19:46:57,987 INFO L175 MemorySlicer]: Split 18 memory accesses to 2 slices as follows [2, 16]. 89 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 4 writes are split as follows [0, 4]. [2025-03-17 19:46:57,987 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:46:57" (1/1) ... [2025-03-17 19:46:57,987 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:46:57" (1/1) ... [2025-03-17 19:46:57,993 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:46:57" (1/1) ... [2025-03-17 19:46:57,994 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:46:57" (1/1) ... [2025-03-17 19:46:58,000 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:46:57" (1/1) ... [2025-03-17 19:46:58,001 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:46:57" (1/1) ... [2025-03-17 19:46:58,003 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 19:46:58,003 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 19:46:58,003 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 19:46:58,003 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 19:46:58,004 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:46:57" (1/1) ... [2025-03-17 19:46:58,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 19:46:58,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:46:58,029 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 19:46:58,031 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 19:46:58,047 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 19:46:58,048 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-17 19:46:58,048 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-17 19:46:58,048 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-17 19:46:58,048 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-17 19:46:58,048 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-17 19:46:58,048 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-17 19:46:58,048 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 19:46:58,048 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 19:46:58,048 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 19:46:58,048 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 19:46:58,048 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-17 19:46:58,048 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-17 19:46:58,048 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-17 19:46:58,048 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 19:46:58,048 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 19:46:58,048 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 19:46:58,048 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 19:46:58,049 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-17 19:46:58,132 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 19:46:58,133 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 19:46:58,508 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-17 19:46:58,508 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 19:46:58,767 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 19:46:58,767 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 19:46:58,767 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 07:46:58 BoogieIcfgContainer [2025-03-17 19:46:58,767 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 19:46:58,790 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 19:46:58,790 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 19:46:58,793 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 19:46:58,793 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 07:46:57" (1/3) ... [2025-03-17 19:46:58,794 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f1647b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 07:46:58, skipping insertion in model container [2025-03-17 19:46:58,794 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:46:57" (2/3) ... [2025-03-17 19:46:58,794 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f1647b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 07:46:58, skipping insertion in model container [2025-03-17 19:46:58,794 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 07:46:58" (3/3) ... [2025-03-17 19:46:58,795 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-three-array-min.wvr.c [2025-03-17 19:46:58,809 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 19:46:58,810 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-three-array-min.wvr.c that has 4 procedures, 95 locations, 1 initial locations, 6 loop locations, and 32 error locations. [2025-03-17 19:46:58,810 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-17 19:46:58,883 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-17 19:46:58,912 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 104 places, 105 transitions, 231 flow [2025-03-17 19:46:58,947 INFO L124 PetriNetUnfolderBase]: 11/102 cut-off events. [2025-03-17 19:46:58,949 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-17 19:46:58,951 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115 conditions, 102 events. 11/102 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 255 event pairs, 0 based on Foata normal form. 0/59 useless extension candidates. Maximal degree in co-relation 69. Up to 2 conditions per place. [2025-03-17 19:46:58,951 INFO L82 GeneralOperation]: Start removeDead. Operand has 104 places, 105 transitions, 231 flow [2025-03-17 19:46:58,953 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 100 places, 101 transitions, 220 flow [2025-03-17 19:46:58,960 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 19:46:58,972 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;@e3477b3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 19:46:58,972 INFO L334 AbstractCegarLoop]: Starting to check reachability of 49 error locations. [2025-03-17 19:46:58,974 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 19:46:58,974 INFO L124 PetriNetUnfolderBase]: 1/5 cut-off events. [2025-03-17 19:46:58,974 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 19:46:58,974 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:46:58,975 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-17 19:46:58,975 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2025-03-17 19:46:58,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:46:58,979 INFO L85 PathProgramCache]: Analyzing trace with hash 902280, now seen corresponding path program 1 times [2025-03-17 19:46:58,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:46:58,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537749620] [2025-03-17 19:46:58,986 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:46:58,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:46:59,039 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 19:46:59,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 19:46:59,060 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:46:59,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:46:59,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:46:59,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:46:59,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537749620] [2025-03-17 19:46:59,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537749620] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:46:59,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:46:59,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 19:46:59,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111864983] [2025-03-17 19:46:59,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:46:59,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 19:46:59,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:46:59,220 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 19:46:59,221 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 19:46:59,241 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 48 out of 105 [2025-03-17 19:46:59,245 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 101 transitions, 220 flow. Second operand has 4 states, 4 states have (on average 48.75) internal successors, (195), 4 states have internal predecessors, (195), 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-03-17 19:46:59,245 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:46:59,245 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 48 of 105 [2025-03-17 19:46:59,245 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:46:59,662 INFO L124 PetriNetUnfolderBase]: 1374/2572 cut-off events. [2025-03-17 19:46:59,662 INFO L125 PetriNetUnfolderBase]: For 145/145 co-relation queries the response was YES. [2025-03-17 19:46:59,669 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4588 conditions, 2572 events. 1374/2572 cut-off events. For 145/145 co-relation queries the response was YES. Maximal size of possible extension queue 189. Compared 16789 event pairs, 1018 based on Foata normal form. 3/1910 useless extension candidates. Maximal degree in co-relation 4066. Up to 1857 conditions per place. [2025-03-17 19:46:59,681 INFO L140 encePairwiseOnDemand]: 87/105 looper letters, 53 selfloop transitions, 10 changer transitions 0/108 dead transitions. [2025-03-17 19:46:59,681 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 108 transitions, 360 flow [2025-03-17 19:46:59,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 19:46:59,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 19:46:59,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 263 transitions. [2025-03-17 19:46:59,694 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6261904761904762 [2025-03-17 19:46:59,695 INFO L175 Difference]: Start difference. First operand has 100 places, 101 transitions, 220 flow. Second operand 4 states and 263 transitions. [2025-03-17 19:46:59,695 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 108 transitions, 360 flow [2025-03-17 19:46:59,703 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 108 transitions, 348 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-17 19:46:59,706 INFO L231 Difference]: Finished difference. Result has 98 places, 108 transitions, 292 flow [2025-03-17 19:46:59,708 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=204, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=292, PETRI_PLACES=98, PETRI_TRANSITIONS=108} [2025-03-17 19:46:59,710 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, -2 predicate places. [2025-03-17 19:46:59,710 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 108 transitions, 292 flow [2025-03-17 19:46:59,711 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 48.75) internal successors, (195), 4 states have internal predecessors, (195), 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-03-17 19:46:59,711 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:46:59,711 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-03-17 19:46:59,711 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 19:46:59,711 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2025-03-17 19:46:59,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:46:59,711 INFO L85 PathProgramCache]: Analyzing trace with hash 1110797054, now seen corresponding path program 1 times [2025-03-17 19:46:59,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:46:59,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256320880] [2025-03-17 19:46:59,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:46:59,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:46:59,723 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 19:46:59,733 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 19:46:59,734 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:46:59,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:46:59,815 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:46:59,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:46:59,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256320880] [2025-03-17 19:46:59,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256320880] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:46:59,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1881240454] [2025-03-17 19:46:59,815 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:46:59,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:46:59,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:46:59,817 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:46:59,819 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 19:46:59,867 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 19:46:59,876 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 19:46:59,876 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:46:59,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:46:59,877 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 19:46:59,879 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:46:59,907 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:46:59,907 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 19:46:59,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1881240454] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:46:59,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 19:46:59,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-03-17 19:46:59,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294195489] [2025-03-17 19:46:59,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:46:59,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 19:46:59,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:46:59,909 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 19:46:59,909 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-17 19:46:59,926 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 48 out of 105 [2025-03-17 19:46:59,926 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 108 transitions, 292 flow. Second operand has 6 states, 6 states have (on average 48.833333333333336) internal successors, (293), 6 states have internal predecessors, (293), 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-03-17 19:46:59,927 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:46:59,927 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 48 of 105 [2025-03-17 19:46:59,927 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:47:00,233 INFO L124 PetriNetUnfolderBase]: 1374/2569 cut-off events. [2025-03-17 19:47:00,233 INFO L125 PetriNetUnfolderBase]: For 55/55 co-relation queries the response was YES. [2025-03-17 19:47:00,236 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4512 conditions, 2569 events. 1374/2569 cut-off events. For 55/55 co-relation queries the response was YES. Maximal size of possible extension queue 189. Compared 16786 event pairs, 1018 based on Foata normal form. 3/1912 useless extension candidates. Maximal degree in co-relation 4439. Up to 1842 conditions per place. [2025-03-17 19:47:00,244 INFO L140 encePairwiseOnDemand]: 92/105 looper letters, 43 selfloop transitions, 17 changer transitions 0/105 dead transitions. [2025-03-17 19:47:00,244 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 105 transitions, 400 flow [2025-03-17 19:47:00,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 19:47:00,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 19:47:00,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 351 transitions. [2025-03-17 19:47:00,246 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5571428571428572 [2025-03-17 19:47:00,246 INFO L175 Difference]: Start difference. First operand has 98 places, 108 transitions, 292 flow. Second operand 6 states and 351 transitions. [2025-03-17 19:47:00,246 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 105 transitions, 400 flow [2025-03-17 19:47:00,247 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 105 transitions, 400 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 19:47:00,248 INFO L231 Difference]: Finished difference. Result has 100 places, 105 transitions, 314 flow [2025-03-17 19:47:00,248 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=280, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=314, PETRI_PLACES=100, PETRI_TRANSITIONS=105} [2025-03-17 19:47:00,249 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 0 predicate places. [2025-03-17 19:47:00,249 INFO L471 AbstractCegarLoop]: Abstraction has has 100 places, 105 transitions, 314 flow [2025-03-17 19:47:00,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 48.833333333333336) internal successors, (293), 6 states have internal predecessors, (293), 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-03-17 19:47:00,249 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:47:00,249 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-17 19:47:00,255 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-17 19:47:00,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:47:00,454 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2025-03-17 19:47:00,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:47:00,454 INFO L85 PathProgramCache]: Analyzing trace with hash 1111911297, now seen corresponding path program 1 times [2025-03-17 19:47:00,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:47:00,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640036912] [2025-03-17 19:47:00,455 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:47:00,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:47:00,465 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 19:47:00,484 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 19:47:00,485 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:47:00,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:47:00,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:47:00,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:47:00,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640036912] [2025-03-17 19:47:00,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640036912] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:47:00,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:47:00,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 19:47:00,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679570649] [2025-03-17 19:47:00,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:47:00,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 19:47:00,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:47:00,555 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 19:47:00,555 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 19:47:00,587 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 105 [2025-03-17 19:47:00,588 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 105 transitions, 314 flow. Second operand has 4 states, 4 states have (on average 43.5) internal successors, (174), 4 states have internal predecessors, (174), 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-03-17 19:47:00,588 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:47:00,588 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 105 [2025-03-17 19:47:00,588 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:47:00,871 INFO L124 PetriNetUnfolderBase]: 1375/2586 cut-off events. [2025-03-17 19:47:00,872 INFO L125 PetriNetUnfolderBase]: For 75/75 co-relation queries the response was YES. [2025-03-17 19:47:00,875 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4561 conditions, 2586 events. 1375/2586 cut-off events. For 75/75 co-relation queries the response was YES. Maximal size of possible extension queue 189. Compared 16841 event pairs, 1018 based on Foata normal form. 4/1929 useless extension candidates. Maximal degree in co-relation 4475. Up to 1857 conditions per place. [2025-03-17 19:47:00,884 INFO L140 encePairwiseOnDemand]: 90/105 looper letters, 64 selfloop transitions, 10 changer transitions 0/110 dead transitions. [2025-03-17 19:47:00,884 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 110 transitions, 472 flow [2025-03-17 19:47:00,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 19:47:00,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 19:47:00,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 239 transitions. [2025-03-17 19:47:00,885 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.569047619047619 [2025-03-17 19:47:00,886 INFO L175 Difference]: Start difference. First operand has 100 places, 105 transitions, 314 flow. Second operand 4 states and 239 transitions. [2025-03-17 19:47:00,886 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 110 transitions, 472 flow [2025-03-17 19:47:00,887 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 110 transitions, 434 flow, removed 4 selfloop flow, removed 5 redundant places. [2025-03-17 19:47:00,888 INFO L231 Difference]: Finished difference. Result has 99 places, 108 transitions, 340 flow [2025-03-17 19:47:00,888 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=272, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=340, PETRI_PLACES=99, PETRI_TRANSITIONS=108} [2025-03-17 19:47:00,890 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, -1 predicate places. [2025-03-17 19:47:00,890 INFO L471 AbstractCegarLoop]: Abstraction has has 99 places, 108 transitions, 340 flow [2025-03-17 19:47:00,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 43.5) internal successors, (174), 4 states have internal predecessors, (174), 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-03-17 19:47:00,891 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:47:00,891 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1] [2025-03-17 19:47:00,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 19:47:00,891 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2025-03-17 19:47:00,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:47:00,892 INFO L85 PathProgramCache]: Analyzing trace with hash 74971085, now seen corresponding path program 1 times [2025-03-17 19:47:00,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:47:00,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934773119] [2025-03-17 19:47:00,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:47:00,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:47:00,901 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 19:47:00,908 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 19:47:00,908 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:47:00,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:47:00,983 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:47:00,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:47:00,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934773119] [2025-03-17 19:47:00,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934773119] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:47:00,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [557043625] [2025-03-17 19:47:00,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:47:00,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:47:00,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:47:00,986 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:47:00,988 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 19:47:01,033 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 19:47:01,041 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 19:47:01,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:47:01,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:47:01,042 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 19:47:01,043 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:47:01,060 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:47:01,060 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:47:01,088 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:47:01,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [557043625] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:47:01,088 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:47:01,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2025-03-17 19:47:01,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882321908] [2025-03-17 19:47:01,089 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:47:01,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 19:47:01,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:47:01,089 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 19:47:01,089 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-17 19:47:01,114 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 48 out of 105 [2025-03-17 19:47:01,115 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 108 transitions, 340 flow. Second operand has 12 states, 12 states have (on average 49.083333333333336) internal successors, (589), 12 states have internal predecessors, (589), 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-03-17 19:47:01,115 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:47:01,115 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 48 of 105 [2025-03-17 19:47:01,116 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:47:01,450 INFO L124 PetriNetUnfolderBase]: 1384/2622 cut-off events. [2025-03-17 19:47:01,451 INFO L125 PetriNetUnfolderBase]: For 122/122 co-relation queries the response was YES. [2025-03-17 19:47:01,454 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4669 conditions, 2622 events. 1384/2622 cut-off events. For 122/122 co-relation queries the response was YES. Maximal size of possible extension queue 189. Compared 17093 event pairs, 1018 based on Foata normal form. 9/1969 useless extension candidates. Maximal degree in co-relation 4486. Up to 1862 conditions per place. [2025-03-17 19:47:01,463 INFO L140 encePairwiseOnDemand]: 92/105 looper letters, 53 selfloop transitions, 37 changer transitions 0/135 dead transitions. [2025-03-17 19:47:01,463 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 135 transitions, 661 flow [2025-03-17 19:47:01,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 19:47:01,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-17 19:47:01,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 576 transitions. [2025-03-17 19:47:01,467 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5485714285714286 [2025-03-17 19:47:01,467 INFO L175 Difference]: Start difference. First operand has 99 places, 108 transitions, 340 flow. Second operand 10 states and 576 transitions. [2025-03-17 19:47:01,467 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 135 transitions, 661 flow [2025-03-17 19:47:01,469 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 135 transitions, 661 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 19:47:01,472 INFO L231 Difference]: Finished difference. Result has 111 places, 135 transitions, 605 flow [2025-03-17 19:47:01,472 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=340, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=605, PETRI_PLACES=111, PETRI_TRANSITIONS=135} [2025-03-17 19:47:01,472 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 11 predicate places. [2025-03-17 19:47:01,472 INFO L471 AbstractCegarLoop]: Abstraction has has 111 places, 135 transitions, 605 flow [2025-03-17 19:47:01,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 49.083333333333336) internal successors, (589), 12 states have internal predecessors, (589), 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-03-17 19:47:01,473 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:47:01,473 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:47:01,480 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-17 19:47:01,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2025-03-17 19:47:01,673 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2025-03-17 19:47:01,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:47:01,674 INFO L85 PathProgramCache]: Analyzing trace with hash 109512614, now seen corresponding path program 1 times [2025-03-17 19:47:01,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:47:01,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473777806] [2025-03-17 19:47:01,675 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:47:01,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:47:01,683 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 19:47:01,690 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 19:47:01,691 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:47:01,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:47:01,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:47:01,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:47:01,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473777806] [2025-03-17 19:47:01,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473777806] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:47:01,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:47:01,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 19:47:01,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743736128] [2025-03-17 19:47:01,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:47:01,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 19:47:01,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:47:01,727 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 19:47:01,727 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 19:47:01,727 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 105 [2025-03-17 19:47:01,727 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 135 transitions, 605 flow. Second operand has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 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-03-17 19:47:01,728 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:47:01,728 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 105 [2025-03-17 19:47:01,728 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:47:01,941 INFO L124 PetriNetUnfolderBase]: 1383/2621 cut-off events. [2025-03-17 19:47:01,942 INFO L125 PetriNetUnfolderBase]: For 177/177 co-relation queries the response was YES. [2025-03-17 19:47:01,945 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4729 conditions, 2621 events. 1383/2621 cut-off events. For 177/177 co-relation queries the response was YES. Maximal size of possible extension queue 189. Compared 17011 event pairs, 1018 based on Foata normal form. 1/1966 useless extension candidates. Maximal degree in co-relation 4626. Up to 1888 conditions per place. [2025-03-17 19:47:01,952 INFO L140 encePairwiseOnDemand]: 102/105 looper letters, 84 selfloop transitions, 2 changer transitions 0/134 dead transitions. [2025-03-17 19:47:01,952 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 134 transitions, 773 flow [2025-03-17 19:47:01,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 19:47:01,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 19:47:01,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 213 transitions. [2025-03-17 19:47:01,955 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6761904761904762 [2025-03-17 19:47:01,955 INFO L175 Difference]: Start difference. First operand has 111 places, 135 transitions, 605 flow. Second operand 3 states and 213 transitions. [2025-03-17 19:47:01,955 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 134 transitions, 773 flow [2025-03-17 19:47:01,957 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 134 transitions, 736 flow, removed 9 selfloop flow, removed 2 redundant places. [2025-03-17 19:47:01,958 INFO L231 Difference]: Finished difference. Result has 111 places, 134 transitions, 568 flow [2025-03-17 19:47:01,958 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=564, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=568, PETRI_PLACES=111, PETRI_TRANSITIONS=134} [2025-03-17 19:47:01,962 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 11 predicate places. [2025-03-17 19:47:01,962 INFO L471 AbstractCegarLoop]: Abstraction has has 111 places, 134 transitions, 568 flow [2025-03-17 19:47:01,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 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-03-17 19:47:01,963 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:47:01,963 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:47:01,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 19:47:01,963 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2025-03-17 19:47:01,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:47:01,963 INFO L85 PathProgramCache]: Analyzing trace with hash 116032284, now seen corresponding path program 1 times [2025-03-17 19:47:01,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:47:01,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220616089] [2025-03-17 19:47:01,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:47:01,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:47:01,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-17 19:47:01,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-17 19:47:01,982 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:47:01,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:47:02,041 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 19:47:02,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:47:02,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220616089] [2025-03-17 19:47:02,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220616089] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:47:02,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:47:02,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 19:47:02,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739127575] [2025-03-17 19:47:02,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:47:02,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 19:47:02,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:47:02,042 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 19:47:02,042 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 19:47:02,046 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 105 [2025-03-17 19:47:02,046 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 134 transitions, 568 flow. Second operand has 4 states, 4 states have (on average 55.5) internal successors, (222), 4 states have internal predecessors, (222), 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-03-17 19:47:02,046 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:47:02,046 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 105 [2025-03-17 19:47:02,046 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:47:02,287 INFO L124 PetriNetUnfolderBase]: 1381/2619 cut-off events. [2025-03-17 19:47:02,288 INFO L125 PetriNetUnfolderBase]: For 136/136 co-relation queries the response was YES. [2025-03-17 19:47:02,291 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4703 conditions, 2619 events. 1381/2619 cut-off events. For 136/136 co-relation queries the response was YES. Maximal size of possible extension queue 189. Compared 16910 event pairs, 1018 based on Foata normal form. 2/1965 useless extension candidates. Maximal degree in co-relation 4677. Up to 1875 conditions per place. [2025-03-17 19:47:02,301 INFO L140 encePairwiseOnDemand]: 98/105 looper letters, 72 selfloop transitions, 12 changer transitions 0/132 dead transitions. [2025-03-17 19:47:02,303 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 132 transitions, 723 flow [2025-03-17 19:47:02,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 19:47:02,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 19:47:02,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 272 transitions. [2025-03-17 19:47:02,304 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6476190476190476 [2025-03-17 19:47:02,304 INFO L175 Difference]: Start difference. First operand has 111 places, 134 transitions, 568 flow. Second operand 4 states and 272 transitions. [2025-03-17 19:47:02,305 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 132 transitions, 723 flow [2025-03-17 19:47:02,306 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 132 transitions, 709 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 19:47:02,308 INFO L231 Difference]: Finished difference. Result has 112 places, 132 transitions, 565 flow [2025-03-17 19:47:02,308 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=541, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=565, PETRI_PLACES=112, PETRI_TRANSITIONS=132} [2025-03-17 19:47:02,309 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 12 predicate places. [2025-03-17 19:47:02,310 INFO L471 AbstractCegarLoop]: Abstraction has has 112 places, 132 transitions, 565 flow [2025-03-17 19:47:02,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 55.5) internal successors, (222), 4 states have internal predecessors, (222), 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-03-17 19:47:02,310 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:47:02,310 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1] [2025-03-17 19:47:02,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 19:47:02,310 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2025-03-17 19:47:02,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:47:02,311 INFO L85 PathProgramCache]: Analyzing trace with hash 678577923, now seen corresponding path program 2 times [2025-03-17 19:47:02,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:47:02,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501180747] [2025-03-17 19:47:02,311 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:47:02,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:47:02,318 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-03-17 19:47:02,323 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 16 statements. [2025-03-17 19:47:02,323 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 19:47:02,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:47:02,355 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-17 19:47:02,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:47:02,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501180747] [2025-03-17 19:47:02,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501180747] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:47:02,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1721915159] [2025-03-17 19:47:02,356 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:47:02,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:47:02,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:47:02,358 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:47:02,359 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 19:47:02,415 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-03-17 19:47:02,422 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 16 statements. [2025-03-17 19:47:02,422 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 19:47:02,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:47:02,423 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 19:47:02,423 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:47:02,450 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-17 19:47:02,452 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:47:02,476 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-17 19:47:02,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1721915159] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:47:02,477 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:47:02,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 2 [2025-03-17 19:47:02,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75204097] [2025-03-17 19:47:02,477 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:47:02,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 19:47:02,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:47:02,477 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 19:47:02,477 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 19:47:02,490 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 48 out of 105 [2025-03-17 19:47:02,491 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 132 transitions, 565 flow. Second operand has 4 states, 4 states have (on average 49.25) internal successors, (197), 4 states have internal predecessors, (197), 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-03-17 19:47:02,491 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:47:02,491 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 48 of 105 [2025-03-17 19:47:02,491 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:47:02,718 INFO L124 PetriNetUnfolderBase]: 1381/2618 cut-off events. [2025-03-17 19:47:02,718 INFO L125 PetriNetUnfolderBase]: For 147/147 co-relation queries the response was YES. [2025-03-17 19:47:02,722 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4702 conditions, 2618 events. 1381/2618 cut-off events. For 147/147 co-relation queries the response was YES. Maximal size of possible extension queue 189. Compared 16914 event pairs, 1018 based on Foata normal form. 1/1965 useless extension candidates. Maximal degree in co-relation 4606. Up to 1879 conditions per place. [2025-03-17 19:47:02,728 INFO L140 encePairwiseOnDemand]: 100/105 looper letters, 71 selfloop transitions, 15 changer transitions 0/131 dead transitions. [2025-03-17 19:47:02,728 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 131 transitions, 727 flow [2025-03-17 19:47:02,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 19:47:02,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 19:47:02,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 243 transitions. [2025-03-17 19:47:02,729 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5785714285714286 [2025-03-17 19:47:02,729 INFO L175 Difference]: Start difference. First operand has 112 places, 132 transitions, 565 flow. Second operand 4 states and 243 transitions. [2025-03-17 19:47:02,730 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 131 transitions, 727 flow [2025-03-17 19:47:02,731 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 131 transitions, 703 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-17 19:47:02,732 INFO L231 Difference]: Finished difference. Result has 111 places, 131 transitions, 561 flow [2025-03-17 19:47:02,732 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=531, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=561, PETRI_PLACES=111, PETRI_TRANSITIONS=131} [2025-03-17 19:47:02,732 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 11 predicate places. [2025-03-17 19:47:02,732 INFO L471 AbstractCegarLoop]: Abstraction has has 111 places, 131 transitions, 561 flow [2025-03-17 19:47:02,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 49.25) internal successors, (197), 4 states have internal predecessors, (197), 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-03-17 19:47:02,732 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:47:02,733 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:47:02,739 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-17 19:47:02,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:47:02,933 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2025-03-17 19:47:02,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:47:02,933 INFO L85 PathProgramCache]: Analyzing trace with hash 1368256853, now seen corresponding path program 1 times [2025-03-17 19:47:02,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:47:02,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955064024] [2025-03-17 19:47:02,934 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:47:02,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:47:02,940 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-17 19:47:02,962 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-17 19:47:02,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:47:02,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:47:03,220 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 19:47:03,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:47:03,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955064024] [2025-03-17 19:47:03,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955064024] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:47:03,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1826245971] [2025-03-17 19:47:03,222 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:47:03,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:47:03,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:47:03,224 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:47:03,226 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-17 19:47:03,282 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-17 19:47:03,303 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-17 19:47:03,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:47:03,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:47:03,305 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-17 19:47:03,307 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:47:03,324 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-17 19:47:03,346 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-17 19:47:03,383 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 19:47:03,383 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-17 19:47:03,395 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-03-17 19:47:03,407 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-03-17 19:47:03,412 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 19:47:03,412 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:47:03,519 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 19:47:03,519 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2025-03-17 19:47:03,527 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 19:47:03,527 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 35 [2025-03-17 19:47:03,534 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2025-03-17 19:47:03,578 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 19:47:03,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1826245971] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:47:03,578 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:47:03,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2025-03-17 19:47:03,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297943036] [2025-03-17 19:47:03,578 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:47:03,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-17 19:47:03,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:47:03,579 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-17 19:47:03,579 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=145, Unknown=1, NotChecked=0, Total=182 [2025-03-17 19:47:03,713 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 105 [2025-03-17 19:47:03,713 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 131 transitions, 561 flow. Second operand has 14 states, 14 states have (on average 37.785714285714285) internal successors, (529), 14 states have internal predecessors, (529), 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-03-17 19:47:03,714 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:47:03,714 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 105 [2025-03-17 19:47:03,714 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:47:04,164 INFO L124 PetriNetUnfolderBase]: 1379/2621 cut-off events. [2025-03-17 19:47:04,165 INFO L125 PetriNetUnfolderBase]: For 135/135 co-relation queries the response was YES. [2025-03-17 19:47:04,169 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4735 conditions, 2621 events. 1379/2621 cut-off events. For 135/135 co-relation queries the response was YES. Maximal size of possible extension queue 189. Compared 16943 event pairs, 1018 based on Foata normal form. 0/1963 useless extension candidates. Maximal degree in co-relation 4644. Up to 1841 conditions per place. [2025-03-17 19:47:04,177 INFO L140 encePairwiseOnDemand]: 90/105 looper letters, 86 selfloop transitions, 24 changer transitions 0/139 dead transitions. [2025-03-17 19:47:04,177 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 139 transitions, 797 flow [2025-03-17 19:47:04,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 19:47:04,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-17 19:47:04,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 477 transitions. [2025-03-17 19:47:04,179 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.412987012987013 [2025-03-17 19:47:04,179 INFO L175 Difference]: Start difference. First operand has 111 places, 131 transitions, 561 flow. Second operand 11 states and 477 transitions. [2025-03-17 19:47:04,179 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 139 transitions, 797 flow [2025-03-17 19:47:04,181 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 139 transitions, 767 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-17 19:47:04,183 INFO L231 Difference]: Finished difference. Result has 117 places, 130 transitions, 577 flow [2025-03-17 19:47:04,183 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=529, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=577, PETRI_PLACES=117, PETRI_TRANSITIONS=130} [2025-03-17 19:47:04,183 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 17 predicate places. [2025-03-17 19:47:04,183 INFO L471 AbstractCegarLoop]: Abstraction has has 117 places, 130 transitions, 577 flow [2025-03-17 19:47:04,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 37.785714285714285) internal successors, (529), 14 states have internal predecessors, (529), 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-03-17 19:47:04,184 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:47:04,184 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:47:04,190 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-17 19:47:04,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:47:04,388 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2025-03-17 19:47:04,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:47:04,388 INFO L85 PathProgramCache]: Analyzing trace with hash -533770882, now seen corresponding path program 1 times [2025-03-17 19:47:04,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:47:04,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348443873] [2025-03-17 19:47:04,388 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:47:04,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:47:04,395 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-17 19:47:04,417 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-17 19:47:04,417 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:47:04,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:47:04,684 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 19:47:04,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:47:04,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348443873] [2025-03-17 19:47:04,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348443873] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:47:04,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [575988608] [2025-03-17 19:47:04,684 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:47:04,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:47:04,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:47:04,686 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:47:04,688 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-17 19:47:04,740 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-17 19:47:04,756 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-17 19:47:04,756 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:47:04,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:47:04,758 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-17 19:47:04,759 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:47:04,766 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-17 19:47:04,782 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-17 19:47:04,805 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 19:47:04,805 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-17 19:47:04,814 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-17 19:47:04,822 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-17 19:47:04,834 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 19:47:04,834 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:47:04,855 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_127 (Array Int Int))) (< (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_127) c_~B~0.base) c_~B~0.offset) 4294967296)) is different from false [2025-03-17 19:47:04,899 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 19:47:04,899 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2025-03-17 19:47:04,906 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 19:47:04,906 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 29 [2025-03-17 19:47:04,910 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2025-03-17 19:47:04,940 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 1 not checked. [2025-03-17 19:47:04,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [575988608] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:47:04,940 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:47:04,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2025-03-17 19:47:04,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472577838] [2025-03-17 19:47:04,940 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:47:04,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-17 19:47:04,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:47:04,941 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-17 19:47:04,941 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=124, Unknown=1, NotChecked=22, Total=182 [2025-03-17 19:47:04,977 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 105 [2025-03-17 19:47:04,978 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 130 transitions, 577 flow. Second operand has 14 states, 14 states have (on average 37.857142857142854) internal successors, (530), 14 states have internal predecessors, (530), 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-03-17 19:47:04,978 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:47:04,978 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 105 [2025-03-17 19:47:04,978 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:47:05,403 INFO L124 PetriNetUnfolderBase]: 1379/2620 cut-off events. [2025-03-17 19:47:05,403 INFO L125 PetriNetUnfolderBase]: For 138/138 co-relation queries the response was YES. [2025-03-17 19:47:05,407 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4741 conditions, 2620 events. 1379/2620 cut-off events. For 138/138 co-relation queries the response was YES. Maximal size of possible extension queue 189. Compared 16918 event pairs, 1018 based on Foata normal form. 1/1966 useless extension candidates. Maximal degree in co-relation 4646. Up to 1845 conditions per place. [2025-03-17 19:47:05,412 INFO L140 encePairwiseOnDemand]: 90/105 looper letters, 79 selfloop transitions, 25 changer transitions 0/133 dead transitions. [2025-03-17 19:47:05,412 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 133 transitions, 789 flow [2025-03-17 19:47:05,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 19:47:05,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-17 19:47:05,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 469 transitions. [2025-03-17 19:47:05,414 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.40606060606060607 [2025-03-17 19:47:05,414 INFO L175 Difference]: Start difference. First operand has 117 places, 130 transitions, 577 flow. Second operand 11 states and 469 transitions. [2025-03-17 19:47:05,414 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 133 transitions, 789 flow [2025-03-17 19:47:05,415 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 133 transitions, 762 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-17 19:47:05,417 INFO L231 Difference]: Finished difference. Result has 122 places, 129 transitions, 596 flow [2025-03-17 19:47:05,417 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=546, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=596, PETRI_PLACES=122, PETRI_TRANSITIONS=129} [2025-03-17 19:47:05,417 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 22 predicate places. [2025-03-17 19:47:05,417 INFO L471 AbstractCegarLoop]: Abstraction has has 122 places, 129 transitions, 596 flow [2025-03-17 19:47:05,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 37.857142857142854) internal successors, (530), 14 states have internal predecessors, (530), 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-03-17 19:47:05,417 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:47:05,418 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:47:05,423 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-17 19:47:05,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:47:05,622 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2025-03-17 19:47:05,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:47:05,622 INFO L85 PathProgramCache]: Analyzing trace with hash 632972615, now seen corresponding path program 1 times [2025-03-17 19:47:05,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:47:05,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053855751] [2025-03-17 19:47:05,623 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:47:05,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:47:05,629 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-17 19:47:05,637 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-17 19:47:05,637 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:47:05,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:47:05,681 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 19:47:05,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:47:05,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053855751] [2025-03-17 19:47:05,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053855751] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:47:05,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:47:05,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 19:47:05,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142027111] [2025-03-17 19:47:05,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:47:05,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 19:47:05,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:47:05,682 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 19:47:05,682 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 19:47:05,719 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 105 [2025-03-17 19:47:05,720 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 129 transitions, 596 flow. Second operand has 4 states, 4 states have (on average 45.25) internal successors, (181), 4 states have internal predecessors, (181), 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-03-17 19:47:05,720 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:47:05,720 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 105 [2025-03-17 19:47:05,720 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:47:05,922 INFO L124 PetriNetUnfolderBase]: 1378/2621 cut-off events. [2025-03-17 19:47:05,922 INFO L125 PetriNetUnfolderBase]: For 164/164 co-relation queries the response was YES. [2025-03-17 19:47:05,925 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4726 conditions, 2621 events. 1378/2621 cut-off events. For 164/164 co-relation queries the response was YES. Maximal size of possible extension queue 189. Compared 16956 event pairs, 1018 based on Foata normal form. 2/1966 useless extension candidates. Maximal degree in co-relation 4631. Up to 1879 conditions per place. [2025-03-17 19:47:05,930 INFO L140 encePairwiseOnDemand]: 96/105 looper letters, 84 selfloop transitions, 10 changer transitions 0/129 dead transitions. [2025-03-17 19:47:05,931 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 129 transitions, 774 flow [2025-03-17 19:47:05,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 19:47:05,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 19:47:05,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 231 transitions. [2025-03-17 19:47:05,932 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.55 [2025-03-17 19:47:05,932 INFO L175 Difference]: Start difference. First operand has 122 places, 129 transitions, 596 flow. Second operand 4 states and 231 transitions. [2025-03-17 19:47:05,932 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 129 transitions, 774 flow [2025-03-17 19:47:05,933 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 129 transitions, 718 flow, removed 0 selfloop flow, removed 11 redundant places. [2025-03-17 19:47:05,934 INFO L231 Difference]: Finished difference. Result has 114 places, 127 transitions, 546 flow [2025-03-17 19:47:05,934 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=526, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=546, PETRI_PLACES=114, PETRI_TRANSITIONS=127} [2025-03-17 19:47:05,935 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 14 predicate places. [2025-03-17 19:47:05,935 INFO L471 AbstractCegarLoop]: Abstraction has has 114 places, 127 transitions, 546 flow [2025-03-17 19:47:05,935 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 45.25) internal successors, (181), 4 states have internal predecessors, (181), 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-03-17 19:47:05,935 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:47:05,935 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:47:05,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 19:47:05,935 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2025-03-17 19:47:05,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:47:05,935 INFO L85 PathProgramCache]: Analyzing trace with hash 632972374, now seen corresponding path program 1 times [2025-03-17 19:47:05,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:47:05,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199925351] [2025-03-17 19:47:05,935 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:47:05,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:47:05,945 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-17 19:47:05,959 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-17 19:47:05,959 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:47:05,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:47:06,234 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:47:06,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:47:06,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199925351] [2025-03-17 19:47:06,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199925351] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:47:06,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1687767430] [2025-03-17 19:47:06,234 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:47:06,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:47:06,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:47:06,242 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:47:06,244 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-17 19:47:06,291 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-17 19:47:06,308 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-17 19:47:06,308 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:47:06,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:47:06,311 INFO L256 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-17 19:47:06,312 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:47:06,315 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-17 19:47:06,337 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-17 19:47:06,354 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 19:47:06,354 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-17 19:47:06,372 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-03-17 19:47:06,423 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2025-03-17 19:47:06,423 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 17 [2025-03-17 19:47:06,460 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-03-17 19:47:06,500 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:47:06,501 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:47:06,568 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_166 (Array Int Int))) (< 0 (+ 2147483649 (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_166) c_~A~0.base) c_~A~0.offset)))) is different from false [2025-03-17 19:47:06,611 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 19:47:06,611 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2025-03-17 19:47:06,617 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 19:47:06,618 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 35 [2025-03-17 19:47:06,622 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2025-03-17 19:47:06,652 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 1 not checked. [2025-03-17 19:47:06,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1687767430] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:47:06,652 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:47:06,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 6] total 16 [2025-03-17 19:47:06,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620962226] [2025-03-17 19:47:06,653 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:47:06,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-17 19:47:06,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:47:06,653 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-17 19:47:06,653 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=225, Unknown=1, NotChecked=30, Total=306 [2025-03-17 19:47:06,690 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 105 [2025-03-17 19:47:06,691 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 127 transitions, 546 flow. Second operand has 18 states, 18 states have (on average 33.833333333333336) internal successors, (609), 18 states have internal predecessors, (609), 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-03-17 19:47:06,691 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:47:06,691 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 105 [2025-03-17 19:47:06,691 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:47:07,364 INFO L124 PetriNetUnfolderBase]: 1378/2618 cut-off events. [2025-03-17 19:47:07,364 INFO L125 PetriNetUnfolderBase]: For 123/123 co-relation queries the response was YES. [2025-03-17 19:47:07,367 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4722 conditions, 2618 events. 1378/2618 cut-off events. For 123/123 co-relation queries the response was YES. Maximal size of possible extension queue 189. Compared 16930 event pairs, 1018 based on Foata normal form. 0/1964 useless extension candidates. Maximal degree in co-relation 4630. Up to 1841 conditions per place. [2025-03-17 19:47:07,372 INFO L140 encePairwiseOnDemand]: 86/105 looper letters, 80 selfloop transitions, 28 changer transitions 0/133 dead transitions. [2025-03-17 19:47:07,372 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 133 transitions, 774 flow [2025-03-17 19:47:07,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-17 19:47:07,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-17 19:47:07,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 532 transitions. [2025-03-17 19:47:07,374 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3619047619047619 [2025-03-17 19:47:07,374 INFO L175 Difference]: Start difference. First operand has 114 places, 127 transitions, 546 flow. Second operand 14 states and 532 transitions. [2025-03-17 19:47:07,374 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 133 transitions, 774 flow [2025-03-17 19:47:07,375 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 133 transitions, 757 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 19:47:07,377 INFO L231 Difference]: Finished difference. Result has 126 places, 127 transitions, 597 flow [2025-03-17 19:47:07,377 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=527, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=597, PETRI_PLACES=126, PETRI_TRANSITIONS=127} [2025-03-17 19:47:07,377 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 26 predicate places. [2025-03-17 19:47:07,377 INFO L471 AbstractCegarLoop]: Abstraction has has 126 places, 127 transitions, 597 flow [2025-03-17 19:47:07,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 33.833333333333336) internal successors, (609), 18 states have internal predecessors, (609), 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-03-17 19:47:07,378 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:47:07,378 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:47:07,388 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-17 19:47:07,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:47:07,578 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2025-03-17 19:47:07,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:47:07,579 INFO L85 PathProgramCache]: Analyzing trace with hash -1852692059, now seen corresponding path program 1 times [2025-03-17 19:47:07,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:47:07,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753484585] [2025-03-17 19:47:07,579 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:47:07,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:47:07,585 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-17 19:47:07,594 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-17 19:47:07,595 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:47:07,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:47:07,843 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:47:07,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:47:07,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753484585] [2025-03-17 19:47:07,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753484585] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:47:07,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1261814055] [2025-03-17 19:47:07,844 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:47:07,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:47:07,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:47:07,846 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:47:07,847 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-17 19:47:07,898 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-17 19:47:07,914 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-17 19:47:07,914 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:47:07,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:47:07,919 INFO L256 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-17 19:47:07,921 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:47:07,924 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-17 19:47:07,933 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-17 19:47:07,965 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 19:47:07,965 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-17 19:47:07,985 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-17 19:47:08,032 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2025-03-17 19:47:08,032 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 15 [2025-03-17 19:47:08,054 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-17 19:47:08,097 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:47:08,097 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:47:08,157 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_195 (Array Int Int))) (< (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_195) c_~A~0.base) c_~A~0.offset) 2147483648)) is different from false [2025-03-17 19:47:08,209 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 19:47:08,209 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2025-03-17 19:47:08,215 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 19:47:08,215 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 29 [2025-03-17 19:47:08,218 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2025-03-17 19:47:08,251 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 1 not checked. [2025-03-17 19:47:08,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1261814055] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:47:08,251 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:47:08,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 7] total 18 [2025-03-17 19:47:08,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988226549] [2025-03-17 19:47:08,252 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:47:08,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-17 19:47:08,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:47:08,252 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-17 19:47:08,252 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=287, Unknown=1, NotChecked=34, Total=380 [2025-03-17 19:47:08,286 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 105 [2025-03-17 19:47:08,286 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 127 transitions, 597 flow. Second operand has 20 states, 20 states have (on average 33.85) internal successors, (677), 20 states have internal predecessors, (677), 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-03-17 19:47:08,286 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:47:08,287 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 105 [2025-03-17 19:47:08,287 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:47:08,851 INFO L124 PetriNetUnfolderBase]: 1378/2618 cut-off events. [2025-03-17 19:47:08,852 INFO L125 PetriNetUnfolderBase]: For 158/158 co-relation queries the response was YES. [2025-03-17 19:47:08,856 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4759 conditions, 2618 events. 1378/2618 cut-off events. For 158/158 co-relation queries the response was YES. Maximal size of possible extension queue 189. Compared 16967 event pairs, 1018 based on Foata normal form. 4/1970 useless extension candidates. Maximal degree in co-relation 4688. Up to 1846 conditions per place. [2025-03-17 19:47:08,882 INFO L140 encePairwiseOnDemand]: 84/105 looper letters, 74 selfloop transitions, 32 changer transitions 1/132 dead transitions. [2025-03-17 19:47:08,883 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 132 transitions, 834 flow [2025-03-17 19:47:08,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-17 19:47:08,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-03-17 19:47:08,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 623 transitions. [2025-03-17 19:47:08,885 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.34901960784313724 [2025-03-17 19:47:08,885 INFO L175 Difference]: Start difference. First operand has 126 places, 127 transitions, 597 flow. Second operand 17 states and 623 transitions. [2025-03-17 19:47:08,885 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 132 transitions, 834 flow [2025-03-17 19:47:08,887 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 132 transitions, 808 flow, removed 2 selfloop flow, removed 5 redundant places. [2025-03-17 19:47:08,888 INFO L231 Difference]: Finished difference. Result has 139 places, 130 transitions, 665 flow [2025-03-17 19:47:08,888 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=570, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=665, PETRI_PLACES=139, PETRI_TRANSITIONS=130} [2025-03-17 19:47:08,889 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 39 predicate places. [2025-03-17 19:47:08,889 INFO L471 AbstractCegarLoop]: Abstraction has has 139 places, 130 transitions, 665 flow [2025-03-17 19:47:08,889 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 33.85) internal successors, (677), 20 states have internal predecessors, (677), 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-03-17 19:47:08,889 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:47:08,889 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1] [2025-03-17 19:47:08,895 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-17 19:47:09,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:47:09,093 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2025-03-17 19:47:09,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:47:09,093 INFO L85 PathProgramCache]: Analyzing trace with hash 506599570, now seen corresponding path program 1 times [2025-03-17 19:47:09,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:47:09,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34775699] [2025-03-17 19:47:09,094 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:47:09,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:47:09,101 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-17 19:47:09,106 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-17 19:47:09,106 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:47:09,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:47:09,198 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-17 19:47:09,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:47:09,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34775699] [2025-03-17 19:47:09,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34775699] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:47:09,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1239336301] [2025-03-17 19:47:09,199 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:47:09,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:47:09,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:47:09,201 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:47:09,202 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-17 19:47:09,251 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-17 19:47:09,264 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-17 19:47:09,264 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:47:09,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:47:09,265 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-17 19:47:09,266 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:47:09,327 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 15 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-17 19:47:09,327 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:47:09,402 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 15 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-17 19:47:09,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1239336301] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:47:09,402 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:47:09,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 20 [2025-03-17 19:47:09,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147202931] [2025-03-17 19:47:09,403 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:47:09,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-17 19:47:09,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:47:09,403 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-17 19:47:09,403 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=348, Unknown=0, NotChecked=0, Total=420 [2025-03-17 19:47:09,545 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 48 out of 105 [2025-03-17 19:47:09,546 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 130 transitions, 665 flow. Second operand has 21 states, 21 states have (on average 49.285714285714285) internal successors, (1035), 21 states have internal predecessors, (1035), 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-03-17 19:47:09,546 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:47:09,546 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 48 of 105 [2025-03-17 19:47:09,546 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:47:10,194 INFO L124 PetriNetUnfolderBase]: 2743/5184 cut-off events. [2025-03-17 19:47:10,194 INFO L125 PetriNetUnfolderBase]: For 370/370 co-relation queries the response was YES. [2025-03-17 19:47:10,200 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9314 conditions, 5184 events. 2743/5184 cut-off events. For 370/370 co-relation queries the response was YES. Maximal size of possible extension queue 204. Compared 35594 event pairs, 2036 based on Foata normal form. 2/3911 useless extension candidates. Maximal degree in co-relation 9264. Up to 1863 conditions per place. [2025-03-17 19:47:10,212 INFO L140 encePairwiseOnDemand]: 95/105 looper letters, 93 selfloop transitions, 46 changer transitions 0/180 dead transitions. [2025-03-17 19:47:10,212 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 180 transitions, 1165 flow [2025-03-17 19:47:10,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 19:47:10,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-17 19:47:10,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 639 transitions. [2025-03-17 19:47:10,215 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5532467532467532 [2025-03-17 19:47:10,215 INFO L175 Difference]: Start difference. First operand has 139 places, 130 transitions, 665 flow. Second operand 11 states and 639 transitions. [2025-03-17 19:47:10,215 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 180 transitions, 1165 flow [2025-03-17 19:47:10,218 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 180 transitions, 1099 flow, removed 2 selfloop flow, removed 9 redundant places. [2025-03-17 19:47:10,219 INFO L231 Difference]: Finished difference. Result has 140 places, 136 transitions, 759 flow [2025-03-17 19:47:10,219 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=618, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=759, PETRI_PLACES=140, PETRI_TRANSITIONS=136} [2025-03-17 19:47:10,220 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 40 predicate places. [2025-03-17 19:47:10,220 INFO L471 AbstractCegarLoop]: Abstraction has has 140 places, 136 transitions, 759 flow [2025-03-17 19:47:10,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 49.285714285714285) internal successors, (1035), 21 states have internal predecessors, (1035), 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-03-17 19:47:10,220 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:47:10,220 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:47:10,227 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-17 19:47:10,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-17 19:47:10,421 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2025-03-17 19:47:10,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:47:10,422 INFO L85 PathProgramCache]: Analyzing trace with hash 225616872, now seen corresponding path program 1 times [2025-03-17 19:47:10,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:47:10,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73164522] [2025-03-17 19:47:10,422 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:47:10,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:47:10,430 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-17 19:47:10,435 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-17 19:47:10,435 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:47:10,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:47:10,482 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 19:47:10,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:47:10,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73164522] [2025-03-17 19:47:10,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73164522] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:47:10,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:47:10,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 19:47:10,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616590434] [2025-03-17 19:47:10,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:47:10,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 19:47:10,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:47:10,484 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 19:47:10,484 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 19:47:10,532 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 105 [2025-03-17 19:47:10,533 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 136 transitions, 759 flow. Second operand has 5 states, 5 states have (on average 41.0) internal successors, (205), 5 states have internal predecessors, (205), 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-03-17 19:47:10,533 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:47:10,533 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 105 [2025-03-17 19:47:10,533 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:47:10,920 INFO L124 PetriNetUnfolderBase]: 2743/5172 cut-off events. [2025-03-17 19:47:10,921 INFO L125 PetriNetUnfolderBase]: For 347/347 co-relation queries the response was YES. [2025-03-17 19:47:10,927 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9329 conditions, 5172 events. 2743/5172 cut-off events. For 347/347 co-relation queries the response was YES. Maximal size of possible extension queue 204. Compared 35862 event pairs, 2036 based on Foata normal form. 2/3876 useless extension candidates. Maximal degree in co-relation 9279. Up to 3731 conditions per place. [2025-03-17 19:47:10,937 INFO L140 encePairwiseOnDemand]: 92/105 looper letters, 88 selfloop transitions, 19 changer transitions 0/138 dead transitions. [2025-03-17 19:47:10,937 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 138 transitions, 977 flow [2025-03-17 19:47:10,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 19:47:10,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 19:47:10,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 297 transitions. [2025-03-17 19:47:10,939 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4714285714285714 [2025-03-17 19:47:10,939 INFO L175 Difference]: Start difference. First operand has 140 places, 136 transitions, 759 flow. Second operand 6 states and 297 transitions. [2025-03-17 19:47:10,939 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 138 transitions, 977 flow [2025-03-17 19:47:10,941 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 138 transitions, 907 flow, removed 3 selfloop flow, removed 6 redundant places. [2025-03-17 19:47:10,943 INFO L231 Difference]: Finished difference. Result has 139 places, 138 transitions, 756 flow [2025-03-17 19:47:10,943 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=682, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=756, PETRI_PLACES=139, PETRI_TRANSITIONS=138} [2025-03-17 19:47:10,944 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 39 predicate places. [2025-03-17 19:47:10,944 INFO L471 AbstractCegarLoop]: Abstraction has has 139 places, 138 transitions, 756 flow [2025-03-17 19:47:10,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 41.0) internal successors, (205), 5 states have internal predecessors, (205), 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-03-17 19:47:10,944 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:47:10,944 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 2, 2, 2, 1, 1, 1] [2025-03-17 19:47:10,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 19:47:10,945 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2025-03-17 19:47:10,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:47:10,945 INFO L85 PathProgramCache]: Analyzing trace with hash -1026986788, now seen corresponding path program 2 times [2025-03-17 19:47:10,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:47:10,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870062826] [2025-03-17 19:47:10,945 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:47:10,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:47:10,952 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-03-17 19:47:10,957 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 5 of 23 statements. [2025-03-17 19:47:10,957 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 19:47:10,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:47:10,981 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-17 19:47:10,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:47:10,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870062826] [2025-03-17 19:47:10,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870062826] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:47:10,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1306658303] [2025-03-17 19:47:10,982 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:47:10,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:47:10,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:47:10,984 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:47:10,985 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-17 19:47:11,040 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-03-17 19:47:11,048 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 5 of 23 statements. [2025-03-17 19:47:11,048 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 19:47:11,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:47:11,049 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 19:47:11,049 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:47:11,071 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-17 19:47:11,071 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:47:11,093 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-17 19:47:11,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1306658303] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:47:11,093 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:47:11,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 3 [2025-03-17 19:47:11,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104273243] [2025-03-17 19:47:11,094 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:47:11,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 19:47:11,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:47:11,094 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 19:47:11,095 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 19:47:11,115 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 48 out of 105 [2025-03-17 19:47:11,115 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 138 transitions, 756 flow. Second operand has 5 states, 5 states have (on average 49.6) internal successors, (248), 5 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:47:11,115 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:47:11,115 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 48 of 105 [2025-03-17 19:47:11,115 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:47:11,425 INFO L124 PetriNetUnfolderBase]: 2745/5170 cut-off events. [2025-03-17 19:47:11,426 INFO L125 PetriNetUnfolderBase]: For 366/366 co-relation queries the response was YES. [2025-03-17 19:47:11,433 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9308 conditions, 5170 events. 2745/5170 cut-off events. For 366/366 co-relation queries the response was YES. Maximal size of possible extension queue 204. Compared 35869 event pairs, 2036 based on Foata normal form. 2/3874 useless extension candidates. Maximal degree in co-relation 9256. Up to 3699 conditions per place. [2025-03-17 19:47:11,444 INFO L140 encePairwiseOnDemand]: 95/105 looper letters, 55 selfloop transitions, 40 changer transitions 0/136 dead transitions. [2025-03-17 19:47:11,444 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 136 transitions, 926 flow [2025-03-17 19:47:11,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 19:47:11,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-17 19:47:11,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 290 transitions. [2025-03-17 19:47:11,445 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5523809523809524 [2025-03-17 19:47:11,445 INFO L175 Difference]: Start difference. First operand has 139 places, 138 transitions, 756 flow. Second operand 5 states and 290 transitions. [2025-03-17 19:47:11,445 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 136 transitions, 926 flow [2025-03-17 19:47:11,447 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 136 transitions, 868 flow, removed 6 selfloop flow, removed 8 redundant places. [2025-03-17 19:47:11,448 INFO L231 Difference]: Finished difference. Result has 133 places, 136 transitions, 758 flow [2025-03-17 19:47:11,449 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=678, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=758, PETRI_PLACES=133, PETRI_TRANSITIONS=136} [2025-03-17 19:47:11,449 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 33 predicate places. [2025-03-17 19:47:11,449 INFO L471 AbstractCegarLoop]: Abstraction has has 133 places, 136 transitions, 758 flow [2025-03-17 19:47:11,449 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 49.6) internal successors, (248), 5 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:47:11,449 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:47:11,449 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:47:11,455 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-17 19:47:11,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-17 19:47:11,654 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2025-03-17 19:47:11,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:47:11,655 INFO L85 PathProgramCache]: Analyzing trace with hash -986466368, now seen corresponding path program 1 times [2025-03-17 19:47:11,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:47:11,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863727370] [2025-03-17 19:47:11,655 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:47:11,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:47:11,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-17 19:47:11,668 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-17 19:47:11,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:47:11,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:47:11,707 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 19:47:11,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:47:11,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863727370] [2025-03-17 19:47:11,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863727370] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:47:11,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:47:11,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 19:47:11,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013786378] [2025-03-17 19:47:11,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:47:11,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 19:47:11,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:47:11,709 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 19:47:11,709 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 19:47:11,712 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 52 out of 105 [2025-03-17 19:47:11,712 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 136 transitions, 758 flow. Second operand has 4 states, 4 states have (on average 56.25) internal successors, (225), 4 states have internal predecessors, (225), 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-03-17 19:47:11,712 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:47:11,712 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 52 of 105 [2025-03-17 19:47:11,712 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:47:12,344 INFO L124 PetriNetUnfolderBase]: 5785/9526 cut-off events. [2025-03-17 19:47:12,344 INFO L125 PetriNetUnfolderBase]: For 342/342 co-relation queries the response was YES. [2025-03-17 19:47:12,356 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17845 conditions, 9526 events. 5785/9526 cut-off events. For 342/342 co-relation queries the response was YES. Maximal size of possible extension queue 370. Compared 65443 event pairs, 3324 based on Foata normal form. 284/7178 useless extension candidates. Maximal degree in co-relation 17800. Up to 6024 conditions per place. [2025-03-17 19:47:12,376 INFO L140 encePairwiseOnDemand]: 99/105 looper letters, 136 selfloop transitions, 4 changer transitions 0/179 dead transitions. [2025-03-17 19:47:12,376 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 179 transitions, 1128 flow [2025-03-17 19:47:12,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 19:47:12,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 19:47:12,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 303 transitions. [2025-03-17 19:47:12,377 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7214285714285714 [2025-03-17 19:47:12,377 INFO L175 Difference]: Start difference. First operand has 133 places, 136 transitions, 758 flow. Second operand 4 states and 303 transitions. [2025-03-17 19:47:12,377 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 179 transitions, 1128 flow [2025-03-17 19:47:12,379 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 179 transitions, 1053 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-17 19:47:12,380 INFO L231 Difference]: Finished difference. Result has 135 places, 139 transitions, 712 flow [2025-03-17 19:47:12,380 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=683, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=712, PETRI_PLACES=135, PETRI_TRANSITIONS=139} [2025-03-17 19:47:12,381 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 35 predicate places. [2025-03-17 19:47:12,381 INFO L471 AbstractCegarLoop]: Abstraction has has 135 places, 139 transitions, 712 flow [2025-03-17 19:47:12,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 56.25) internal successors, (225), 4 states have internal predecessors, (225), 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-03-17 19:47:12,381 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:47:12,381 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:47:12,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-17 19:47:12,381 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread2Err8ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2025-03-17 19:47:12,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:47:12,382 INFO L85 PathProgramCache]: Analyzing trace with hash 1154062390, now seen corresponding path program 1 times [2025-03-17 19:47:12,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:47:12,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129995046] [2025-03-17 19:47:12,382 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:47:12,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:47:12,387 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-17 19:47:12,391 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-17 19:47:12,391 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:47:12,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:47:12,457 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 19:47:12,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:47:12,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129995046] [2025-03-17 19:47:12,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129995046] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:47:12,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1633119170] [2025-03-17 19:47:12,457 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:47:12,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:47:12,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:47:12,459 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:47:12,461 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-17 19:47:12,520 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-17 19:47:12,540 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-17 19:47:12,541 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:47:12,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:47:12,542 INFO L256 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 19:47:12,543 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:47:12,599 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 19:47:12,599 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:47:12,660 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 19:47:12,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1633119170] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:47:12,661 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:47:12,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2025-03-17 19:47:12,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47107497] [2025-03-17 19:47:12,661 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:47:12,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-17 19:47:12,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:47:12,662 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-17 19:47:12,662 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2025-03-17 19:47:12,712 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 105 [2025-03-17 19:47:12,712 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 139 transitions, 712 flow. Second operand has 15 states, 15 states have (on average 49.06666666666667) internal successors, (736), 15 states have internal predecessors, (736), 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-03-17 19:47:12,712 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:47:12,713 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 105 [2025-03-17 19:47:12,713 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:47:13,186 INFO L124 PetriNetUnfolderBase]: 2917/5511 cut-off events. [2025-03-17 19:47:13,186 INFO L125 PetriNetUnfolderBase]: For 1984/2217 co-relation queries the response was YES. [2025-03-17 19:47:13,194 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11634 conditions, 5511 events. 2917/5511 cut-off events. For 1984/2217 co-relation queries the response was YES. Maximal size of possible extension queue 241. Compared 36614 event pairs, 1946 based on Foata normal form. 0/4400 useless extension candidates. Maximal degree in co-relation 11587. Up to 3087 conditions per place. [2025-03-17 19:47:13,206 INFO L140 encePairwiseOnDemand]: 92/105 looper letters, 111 selfloop transitions, 45 changer transitions 0/196 dead transitions. [2025-03-17 19:47:13,206 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 196 transitions, 1249 flow [2025-03-17 19:47:13,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 19:47:13,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-17 19:47:13,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 631 transitions. [2025-03-17 19:47:13,207 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5463203463203463 [2025-03-17 19:47:13,207 INFO L175 Difference]: Start difference. First operand has 135 places, 139 transitions, 712 flow. Second operand 11 states and 631 transitions. [2025-03-17 19:47:13,207 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 196 transitions, 1249 flow [2025-03-17 19:47:13,210 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 196 transitions, 1240 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 19:47:13,212 INFO L231 Difference]: Finished difference. Result has 146 places, 141 transitions, 815 flow [2025-03-17 19:47:13,212 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=709, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=815, PETRI_PLACES=146, PETRI_TRANSITIONS=141} [2025-03-17 19:47:13,212 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 46 predicate places. [2025-03-17 19:47:13,212 INFO L471 AbstractCegarLoop]: Abstraction has has 146 places, 141 transitions, 815 flow [2025-03-17 19:47:13,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 49.06666666666667) internal successors, (736), 15 states have internal predecessors, (736), 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-03-17 19:47:13,213 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:47:13,213 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:47:13,221 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-17 19:47:13,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-17 19:47:13,413 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2025-03-17 19:47:13,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:47:13,414 INFO L85 PathProgramCache]: Analyzing trace with hash -1652456143, now seen corresponding path program 1 times [2025-03-17 19:47:13,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:47:13,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374179962] [2025-03-17 19:47:13,414 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:47:13,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:47:13,423 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-17 19:47:13,429 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-17 19:47:13,429 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:47:13,429 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:47:13,501 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 19:47:13,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:47:13,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374179962] [2025-03-17 19:47:13,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374179962] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:47:13,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [30875133] [2025-03-17 19:47:13,501 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:47:13,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:47:13,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:47:13,504 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:47:13,505 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-17 19:47:13,567 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-17 19:47:13,586 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-17 19:47:13,586 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:47:13,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:47:13,588 INFO L256 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 19:47:13,589 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:47:13,648 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 19:47:13,648 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:47:13,709 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 19:47:13,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [30875133] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:47:13,710 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:47:13,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2025-03-17 19:47:13,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93965789] [2025-03-17 19:47:13,710 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:47:13,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-17 19:47:13,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:47:13,711 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-17 19:47:13,711 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2025-03-17 19:47:13,770 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 48 out of 105 [2025-03-17 19:47:13,771 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 141 transitions, 815 flow. Second operand has 15 states, 15 states have (on average 50.0) internal successors, (750), 15 states have internal predecessors, (750), 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-03-17 19:47:13,771 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:47:13,771 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 48 of 105 [2025-03-17 19:47:13,771 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:47:14,184 INFO L124 PetriNetUnfolderBase]: 2375/4539 cut-off events. [2025-03-17 19:47:14,184 INFO L125 PetriNetUnfolderBase]: For 1771/1979 co-relation queries the response was YES. [2025-03-17 19:47:14,192 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9622 conditions, 4539 events. 2375/4539 cut-off events. For 1771/1979 co-relation queries the response was YES. Maximal size of possible extension queue 286. Compared 31610 event pairs, 1666 based on Foata normal form. 38/3678 useless extension candidates. Maximal degree in co-relation 9573. Up to 2813 conditions per place. [2025-03-17 19:47:14,202 INFO L140 encePairwiseOnDemand]: 92/105 looper letters, 101 selfloop transitions, 45 changer transitions 0/187 dead transitions. [2025-03-17 19:47:14,202 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 187 transitions, 1284 flow [2025-03-17 19:47:14,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 19:47:14,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-17 19:47:14,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 638 transitions. [2025-03-17 19:47:14,203 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5523809523809524 [2025-03-17 19:47:14,203 INFO L175 Difference]: Start difference. First operand has 146 places, 141 transitions, 815 flow. Second operand 11 states and 638 transitions. [2025-03-17 19:47:14,203 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 187 transitions, 1284 flow [2025-03-17 19:47:14,206 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 187 transitions, 1200 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-03-17 19:47:14,208 INFO L231 Difference]: Finished difference. Result has 150 places, 143 transitions, 841 flow [2025-03-17 19:47:14,208 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=731, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=841, PETRI_PLACES=150, PETRI_TRANSITIONS=143} [2025-03-17 19:47:14,209 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 50 predicate places. [2025-03-17 19:47:14,209 INFO L471 AbstractCegarLoop]: Abstraction has has 150 places, 143 transitions, 841 flow [2025-03-17 19:47:14,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 50.0) internal successors, (750), 15 states have internal predecessors, (750), 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-03-17 19:47:14,209 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:47:14,209 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:47:14,215 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-17 19:47:14,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-17 19:47:14,413 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2025-03-17 19:47:14,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:47:14,413 INFO L85 PathProgramCache]: Analyzing trace with hash -1823276376, now seen corresponding path program 1 times [2025-03-17 19:47:14,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:47:14,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101196361] [2025-03-17 19:47:14,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:47:14,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:47:14,420 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-17 19:47:14,424 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-17 19:47:14,424 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:47:14,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:47:14,458 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 19:47:14,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:47:14,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101196361] [2025-03-17 19:47:14,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101196361] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:47:14,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:47:14,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 19:47:14,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594942828] [2025-03-17 19:47:14,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:47:14,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 19:47:14,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:47:14,459 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 19:47:14,459 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 19:47:14,465 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 105 [2025-03-17 19:47:14,465 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 143 transitions, 841 flow. Second operand has 4 states, 4 states have (on average 56.75) internal successors, (227), 4 states have internal predecessors, (227), 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-03-17 19:47:14,465 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:47:14,465 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 105 [2025-03-17 19:47:14,465 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:47:15,063 INFO L124 PetriNetUnfolderBase]: 5436/9298 cut-off events. [2025-03-17 19:47:15,064 INFO L125 PetriNetUnfolderBase]: For 6463/6808 co-relation queries the response was YES. [2025-03-17 19:47:15,077 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21929 conditions, 9298 events. 5436/9298 cut-off events. For 6463/6808 co-relation queries the response was YES. Maximal size of possible extension queue 340. Compared 63301 event pairs, 2711 based on Foata normal form. 153/7625 useless extension candidates. Maximal degree in co-relation 21844. Up to 4812 conditions per place. [2025-03-17 19:47:15,099 INFO L140 encePairwiseOnDemand]: 100/105 looper letters, 164 selfloop transitions, 3 changer transitions 0/205 dead transitions. [2025-03-17 19:47:15,099 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 205 transitions, 1418 flow [2025-03-17 19:47:15,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 19:47:15,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 19:47:15,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 302 transitions. [2025-03-17 19:47:15,100 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.719047619047619 [2025-03-17 19:47:15,100 INFO L175 Difference]: Start difference. First operand has 150 places, 143 transitions, 841 flow. Second operand 4 states and 302 transitions. [2025-03-17 19:47:15,100 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 205 transitions, 1418 flow [2025-03-17 19:47:15,107 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 205 transitions, 1334 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-03-17 19:47:15,109 INFO L231 Difference]: Finished difference. Result has 147 places, 145 transitions, 779 flow [2025-03-17 19:47:15,109 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=757, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=140, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=779, PETRI_PLACES=147, PETRI_TRANSITIONS=145} [2025-03-17 19:47:15,109 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 47 predicate places. [2025-03-17 19:47:15,110 INFO L471 AbstractCegarLoop]: Abstraction has has 147 places, 145 transitions, 779 flow [2025-03-17 19:47:15,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 56.75) internal successors, (227), 4 states have internal predecessors, (227), 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-03-17 19:47:15,110 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:47:15,110 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:47:15,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-17 19:47:15,110 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread2Err8ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2025-03-17 19:47:15,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:47:15,110 INFO L85 PathProgramCache]: Analyzing trace with hash -1593094171, now seen corresponding path program 2 times [2025-03-17 19:47:15,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:47:15,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491400898] [2025-03-17 19:47:15,110 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:47:15,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:47:15,117 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 34 statements into 2 equivalence classes. [2025-03-17 19:47:15,138 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-03-17 19:47:15,139 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 19:47:15,139 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:47:15,565 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-17 19:47:15,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:47:15,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491400898] [2025-03-17 19:47:15,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491400898] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:47:15,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [735292790] [2025-03-17 19:47:15,565 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:47:15,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:47:15,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:47:15,569 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:47:15,569 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-17 19:47:15,636 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 34 statements into 2 equivalence classes. [2025-03-17 19:47:15,661 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-03-17 19:47:15,662 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 19:47:15,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:47:15,663 INFO L256 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-17 19:47:15,666 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:47:15,669 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-17 19:47:15,705 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-17 19:47:15,727 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 19:47:15,728 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-17 19:47:15,744 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2025-03-17 19:47:15,757 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2025-03-17 19:47:15,795 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-17 19:47:15,796 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:47:15,834 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_389 (Array Int Int))) (< 0 (+ 9223372039002259456 (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_389) c_~B~0.base) (+ 4 c_~B~0.offset))))) is different from false [2025-03-17 19:47:15,874 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 19:47:15,875 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2025-03-17 19:47:15,884 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 19:47:15,884 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 37 [2025-03-17 19:47:15,887 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-17 19:47:15,977 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 4 not checked. [2025-03-17 19:47:15,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [735292790] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:47:15,977 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:47:15,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 25 [2025-03-17 19:47:15,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573723330] [2025-03-17 19:47:15,979 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:47:15,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-17 19:47:15,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:47:15,979 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-17 19:47:15,979 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=528, Unknown=1, NotChecked=46, Total=650 [2025-03-17 19:47:16,001 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 105 [2025-03-17 19:47:16,002 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 145 transitions, 779 flow. Second operand has 26 states, 26 states have (on average 45.07692307692308) internal successors, (1172), 26 states have internal predecessors, (1172), 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-03-17 19:47:16,002 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:47:16,002 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 105 [2025-03-17 19:47:16,002 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:47:19,207 INFO L124 PetriNetUnfolderBase]: 17160/27590 cut-off events. [2025-03-17 19:47:19,207 INFO L125 PetriNetUnfolderBase]: For 21432/23731 co-relation queries the response was YES. [2025-03-17 19:47:19,278 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69396 conditions, 27590 events. 17160/27590 cut-off events. For 21432/23731 co-relation queries the response was YES. Maximal size of possible extension queue 845. Compared 200329 event pairs, 3890 based on Foata normal form. 382/21600 useless extension candidates. Maximal degree in co-relation 69207. Up to 4143 conditions per place. [2025-03-17 19:47:19,377 INFO L140 encePairwiseOnDemand]: 85/105 looper letters, 298 selfloop transitions, 73 changer transitions 0/407 dead transitions. [2025-03-17 19:47:19,377 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 407 transitions, 2608 flow [2025-03-17 19:47:19,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-03-17 19:47:19,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2025-03-17 19:47:19,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 1630 transitions. [2025-03-17 19:47:19,379 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4851190476190476 [2025-03-17 19:47:19,379 INFO L175 Difference]: Start difference. First operand has 147 places, 145 transitions, 779 flow. Second operand 32 states and 1630 transitions. [2025-03-17 19:47:19,379 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 407 transitions, 2608 flow [2025-03-17 19:47:19,402 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 407 transitions, 2588 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 19:47:19,405 INFO L231 Difference]: Finished difference. Result has 183 places, 179 transitions, 1198 flow [2025-03-17 19:47:19,405 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=777, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=32, PETRI_FLOW=1198, PETRI_PLACES=183, PETRI_TRANSITIONS=179} [2025-03-17 19:47:19,406 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 83 predicate places. [2025-03-17 19:47:19,406 INFO L471 AbstractCegarLoop]: Abstraction has has 183 places, 179 transitions, 1198 flow [2025-03-17 19:47:19,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 45.07692307692308) internal successors, (1172), 26 states have internal predecessors, (1172), 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-03-17 19:47:19,406 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:47:19,406 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:47:19,412 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-03-17 19:47:19,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:47:19,607 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread2Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2025-03-17 19:47:19,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:47:19,607 INFO L85 PathProgramCache]: Analyzing trace with hash -1593094170, now seen corresponding path program 1 times [2025-03-17 19:47:19,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:47:19,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292311135] [2025-03-17 19:47:19,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:47:19,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:47:19,614 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-17 19:47:19,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-17 19:47:19,635 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:47:19,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:47:20,187 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 19:47:20,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:47:20,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292311135] [2025-03-17 19:47:20,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292311135] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:47:20,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1298819824] [2025-03-17 19:47:20,187 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:47:20,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:47:20,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:47:20,189 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:47:20,191 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-17 19:47:20,250 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-17 19:47:20,271 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-17 19:47:20,271 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:47:20,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:47:20,272 INFO L256 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-17 19:47:20,277 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:47:20,282 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-17 19:47:20,327 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-17 19:47:20,351 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 19:47:20,351 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-17 19:47:20,371 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-03-17 19:47:20,379 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-03-17 19:47:20,417 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-17 19:47:20,417 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:47:20,457 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_430 (Array Int Int))) (< (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_430) c_~B~0.base) (+ 4 c_~B~0.offset)) 4294967296)) is different from false [2025-03-17 19:47:20,506 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 19:47:20,507 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2025-03-17 19:47:20,513 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 19:47:20,513 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 31 [2025-03-17 19:47:20,516 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-17 19:47:20,600 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 4 not checked. [2025-03-17 19:47:20,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1298819824] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:47:20,600 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:47:20,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8, 8] total 27 [2025-03-17 19:47:20,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358208756] [2025-03-17 19:47:20,600 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:47:20,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-17 19:47:20,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:47:20,601 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-17 19:47:20,601 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=628, Unknown=1, NotChecked=50, Total=756 [2025-03-17 19:47:20,624 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 105 [2025-03-17 19:47:20,625 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 179 transitions, 1198 flow. Second operand has 28 states, 28 states have (on average 44.964285714285715) internal successors, (1259), 28 states have internal predecessors, (1259), 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-03-17 19:47:20,625 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:47:20,625 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 105 [2025-03-17 19:47:20,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:47:23,386 INFO L124 PetriNetUnfolderBase]: 16741/26677 cut-off events. [2025-03-17 19:47:23,387 INFO L125 PetriNetUnfolderBase]: For 27027/29697 co-relation queries the response was YES. [2025-03-17 19:47:23,443 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77661 conditions, 26677 events. 16741/26677 cut-off events. For 27027/29697 co-relation queries the response was YES. Maximal size of possible extension queue 822. Compared 189327 event pairs, 4362 based on Foata normal form. 457/22176 useless extension candidates. Maximal degree in co-relation 77529. Up to 7770 conditions per place. [2025-03-17 19:47:23,525 INFO L140 encePairwiseOnDemand]: 85/105 looper letters, 164 selfloop transitions, 67 changer transitions 0/267 dead transitions. [2025-03-17 19:47:23,525 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 267 transitions, 2040 flow [2025-03-17 19:47:23,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-17 19:47:23,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-03-17 19:47:23,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 946 transitions. [2025-03-17 19:47:23,527 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4741854636591479 [2025-03-17 19:47:23,527 INFO L175 Difference]: Start difference. First operand has 183 places, 179 transitions, 1198 flow. Second operand 19 states and 946 transitions. [2025-03-17 19:47:23,527 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 267 transitions, 2040 flow [2025-03-17 19:47:23,577 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 267 transitions, 1974 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-03-17 19:47:23,580 INFO L231 Difference]: Finished difference. Result has 195 places, 183 transitions, 1365 flow [2025-03-17 19:47:23,580 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=1131, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=178, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=1365, PETRI_PLACES=195, PETRI_TRANSITIONS=183} [2025-03-17 19:47:23,581 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 95 predicate places. [2025-03-17 19:47:23,581 INFO L471 AbstractCegarLoop]: Abstraction has has 195 places, 183 transitions, 1365 flow [2025-03-17 19:47:23,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 44.964285714285715) internal successors, (1259), 28 states have internal predecessors, (1259), 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-03-17 19:47:23,581 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:47:23,581 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:47:23,587 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-03-17 19:47:23,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2025-03-17 19:47:23,782 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2025-03-17 19:47:23,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:47:23,782 INFO L85 PathProgramCache]: Analyzing trace with hash -1593094168, now seen corresponding path program 1 times [2025-03-17 19:47:23,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:47:23,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927596149] [2025-03-17 19:47:23,782 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:47:23,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:47:23,790 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-17 19:47:23,800 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-17 19:47:23,800 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:47:23,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:47:24,260 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 19:47:24,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:47:24,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927596149] [2025-03-17 19:47:24,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927596149] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:47:24,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1356147419] [2025-03-17 19:47:24,260 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:47:24,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:47:24,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:47:24,262 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:47:24,264 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-17 19:47:24,332 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-17 19:47:24,361 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-17 19:47:24,361 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:47:24,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:47:24,367 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-03-17 19:47:24,369 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:47:24,372 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-17 19:47:24,415 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-17 19:47:24,447 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-17 19:47:24,447 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-03-17 19:47:24,472 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2025-03-17 19:47:24,488 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2025-03-17 19:47:24,517 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 19:47:24,517 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-17 19:47:24,538 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2025-03-17 19:47:24,548 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2025-03-17 19:47:24,596 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 19:47:24,596 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:47:24,648 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_473 (Array Int Int))) (< 0 (+ 2147483649 (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_473) c_~A~0.base) (+ c_~A~0.offset 4))))) is different from false [2025-03-17 19:47:24,795 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 19:47:24,796 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2025-03-17 19:47:24,803 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 19:47:24,803 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 159 treesize of output 147 [2025-03-17 19:47:24,810 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2025-03-17 19:47:24,814 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 24 [2025-03-17 19:47:25,011 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 4 not checked. [2025-03-17 19:47:25,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1356147419] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:47:25,012 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:47:25,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 26 [2025-03-17 19:47:25,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782451596] [2025-03-17 19:47:25,012 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:47:25,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-17 19:47:25,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:47:25,013 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-17 19:47:25,013 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=608, Unknown=2, NotChecked=50, Total=756 [2025-03-17 19:47:25,014 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 105 [2025-03-17 19:47:25,015 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 183 transitions, 1365 flow. Second operand has 28 states, 28 states have (on average 46.0) internal successors, (1288), 28 states have internal predecessors, (1288), 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-03-17 19:47:25,015 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:47:25,015 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 105 [2025-03-17 19:47:25,015 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:47:27,750 INFO L124 PetriNetUnfolderBase]: 13323/22512 cut-off events. [2025-03-17 19:47:27,750 INFO L125 PetriNetUnfolderBase]: For 36182/37760 co-relation queries the response was YES. [2025-03-17 19:47:27,826 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69916 conditions, 22512 events. 13323/22512 cut-off events. For 36182/37760 co-relation queries the response was YES. Maximal size of possible extension queue 731. Compared 170337 event pairs, 6592 based on Foata normal form. 298/19900 useless extension candidates. Maximal degree in co-relation 69778. Up to 11803 conditions per place. [2025-03-17 19:47:27,898 INFO L140 encePairwiseOnDemand]: 90/105 looper letters, 170 selfloop transitions, 56 changer transitions 0/263 dead transitions. [2025-03-17 19:47:27,898 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 263 transitions, 2136 flow [2025-03-17 19:47:27,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-17 19:47:27,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-17 19:47:27,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 788 transitions. [2025-03-17 19:47:27,899 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5003174603174603 [2025-03-17 19:47:27,899 INFO L175 Difference]: Start difference. First operand has 195 places, 183 transitions, 1365 flow. Second operand 15 states and 788 transitions. [2025-03-17 19:47:27,899 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 209 places, 263 transitions, 2136 flow [2025-03-17 19:47:27,939 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 263 transitions, 2056 flow, removed 0 selfloop flow, removed 11 redundant places. [2025-03-17 19:47:27,941 INFO L231 Difference]: Finished difference. Result has 198 places, 182 transitions, 1391 flow [2025-03-17 19:47:27,941 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=1279, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=182, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=1391, PETRI_PLACES=198, PETRI_TRANSITIONS=182} [2025-03-17 19:47:27,942 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 98 predicate places. [2025-03-17 19:47:27,942 INFO L471 AbstractCegarLoop]: Abstraction has has 198 places, 182 transitions, 1391 flow [2025-03-17 19:47:27,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 46.0) internal successors, (1288), 28 states have internal predecessors, (1288), 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-03-17 19:47:27,942 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:47:27,942 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:47:27,948 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-03-17 19:47:28,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:47:28,143 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2025-03-17 19:47:28,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:47:28,144 INFO L85 PathProgramCache]: Analyzing trace with hash -1593094167, now seen corresponding path program 1 times [2025-03-17 19:47:28,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:47:28,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909639396] [2025-03-17 19:47:28,144 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:47:28,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:47:28,152 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-17 19:47:28,159 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-17 19:47:28,159 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:47:28,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:47:28,630 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 19:47:28,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:47:28,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909639396] [2025-03-17 19:47:28,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909639396] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:47:28,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1591344461] [2025-03-17 19:47:28,631 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:47:28,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:47:28,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:47:28,632 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:47:28,634 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-17 19:47:28,699 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-17 19:47:28,721 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-17 19:47:28,721 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:47:28,721 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:47:28,722 INFO L256 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-03-17 19:47:28,724 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:47:28,726 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-17 19:47:28,762 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-17 19:47:28,788 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-17 19:47:28,788 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-03-17 19:47:28,810 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-03-17 19:47:28,822 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-03-17 19:47:28,847 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 19:47:28,847 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-17 19:47:28,864 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-03-17 19:47:28,871 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-03-17 19:47:28,902 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 19:47:28,902 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:47:28,937 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_516 (Array Int Int))) (< (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_516) c_~A~0.base) (+ c_~A~0.offset 4)) 2147483648)) is different from false [2025-03-17 19:47:29,055 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 19:47:29,055 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2025-03-17 19:47:29,063 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 19:47:29,064 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 65 [2025-03-17 19:47:29,067 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 46 [2025-03-17 19:47:29,071 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2025-03-17 19:47:29,223 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 4 not checked. [2025-03-17 19:47:29,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1591344461] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:47:29,223 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:47:29,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 26 [2025-03-17 19:47:29,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770283515] [2025-03-17 19:47:29,223 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:47:29,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-17 19:47:29,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:47:29,224 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-17 19:47:29,224 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=608, Unknown=2, NotChecked=50, Total=756 [2025-03-17 19:47:29,234 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 105 [2025-03-17 19:47:29,235 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 182 transitions, 1391 flow. Second operand has 28 states, 28 states have (on average 46.0) internal successors, (1288), 28 states have internal predecessors, (1288), 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-03-17 19:47:29,235 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:47:29,235 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 105 [2025-03-17 19:47:29,235 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:47:31,356 INFO L124 PetriNetUnfolderBase]: 12640/21079 cut-off events. [2025-03-17 19:47:31,356 INFO L125 PetriNetUnfolderBase]: For 39495/41473 co-relation queries the response was YES. [2025-03-17 19:47:31,404 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67607 conditions, 21079 events. 12640/21079 cut-off events. For 39495/41473 co-relation queries the response was YES. Maximal size of possible extension queue 694. Compared 155148 event pairs, 6665 based on Foata normal form. 338/19153 useless extension candidates. Maximal degree in co-relation 67465. Up to 11803 conditions per place. [2025-03-17 19:47:31,464 INFO L140 encePairwiseOnDemand]: 90/105 looper letters, 169 selfloop transitions, 56 changer transitions 0/262 dead transitions. [2025-03-17 19:47:31,464 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 262 transitions, 2160 flow [2025-03-17 19:47:31,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-17 19:47:31,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-17 19:47:31,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 787 transitions. [2025-03-17 19:47:31,465 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4996825396825397 [2025-03-17 19:47:31,466 INFO L175 Difference]: Start difference. First operand has 198 places, 182 transitions, 1391 flow. Second operand 15 states and 787 transitions. [2025-03-17 19:47:31,466 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 262 transitions, 2160 flow [2025-03-17 19:47:31,502 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 262 transitions, 2053 flow, removed 0 selfloop flow, removed 10 redundant places. [2025-03-17 19:47:31,505 INFO L231 Difference]: Finished difference. Result has 202 places, 181 transitions, 1390 flow [2025-03-17 19:47:31,505 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=1278, PETRI_DIFFERENCE_MINUEND_PLACES=188, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=181, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=1390, PETRI_PLACES=202, PETRI_TRANSITIONS=181} [2025-03-17 19:47:31,506 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 102 predicate places. [2025-03-17 19:47:31,506 INFO L471 AbstractCegarLoop]: Abstraction has has 202 places, 181 transitions, 1390 flow [2025-03-17 19:47:31,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 46.0) internal successors, (1288), 28 states have internal predecessors, (1288), 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-03-17 19:47:31,506 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:47:31,506 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:47:31,512 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2025-03-17 19:47:31,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:47:31,707 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2025-03-17 19:47:31,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:47:31,707 INFO L85 PathProgramCache]: Analyzing trace with hash -914963614, now seen corresponding path program 2 times [2025-03-17 19:47:31,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:47:31,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147123869] [2025-03-17 19:47:31,707 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:47:31,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:47:31,713 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 35 statements into 2 equivalence classes. [2025-03-17 19:47:31,717 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 35 of 35 statements. [2025-03-17 19:47:31,717 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 19:47:31,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:47:31,891 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-17 19:47:31,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:47:31,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147123869] [2025-03-17 19:47:31,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147123869] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:47:31,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:47:31,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 19:47:31,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12448174] [2025-03-17 19:47:31,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:47:31,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 19:47:31,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:47:31,893 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 19:47:31,893 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 19:47:31,896 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 105 [2025-03-17 19:47:31,896 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 181 transitions, 1390 flow. Second operand has 5 states, 5 states have (on average 55.0) internal successors, (275), 5 states have internal predecessors, (275), 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-03-17 19:47:31,896 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:47:31,896 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 105 [2025-03-17 19:47:31,896 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:47:34,162 INFO L124 PetriNetUnfolderBase]: 13593/22139 cut-off events. [2025-03-17 19:47:34,162 INFO L125 PetriNetUnfolderBase]: For 52741/54202 co-relation queries the response was YES. [2025-03-17 19:47:34,261 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75272 conditions, 22139 events. 13593/22139 cut-off events. For 52741/54202 co-relation queries the response was YES. Maximal size of possible extension queue 771. Compared 163942 event pairs, 3062 based on Foata normal form. 850/20170 useless extension candidates. Maximal degree in co-relation 75135. Up to 8520 conditions per place. [2025-03-17 19:47:34,363 INFO L140 encePairwiseOnDemand]: 100/105 looper letters, 208 selfloop transitions, 9 changer transitions 0/256 dead transitions. [2025-03-17 19:47:34,363 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 256 transitions, 2422 flow [2025-03-17 19:47:34,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 19:47:34,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 19:47:34,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 295 transitions. [2025-03-17 19:47:34,364 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7023809523809523 [2025-03-17 19:47:34,364 INFO L175 Difference]: Start difference. First operand has 202 places, 181 transitions, 1390 flow. Second operand 4 states and 295 transitions. [2025-03-17 19:47:34,364 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 204 places, 256 transitions, 2422 flow [2025-03-17 19:47:34,424 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 256 transitions, 2272 flow, removed 0 selfloop flow, removed 13 redundant places. [2025-03-17 19:47:34,426 INFO L231 Difference]: Finished difference. Result has 191 places, 180 transitions, 1294 flow [2025-03-17 19:47:34,426 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=1276, PETRI_DIFFERENCE_MINUEND_PLACES=188, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=180, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=171, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1294, PETRI_PLACES=191, PETRI_TRANSITIONS=180} [2025-03-17 19:47:34,427 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 91 predicate places. [2025-03-17 19:47:34,427 INFO L471 AbstractCegarLoop]: Abstraction has has 191 places, 180 transitions, 1294 flow [2025-03-17 19:47:34,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 55.0) internal successors, (275), 5 states have internal predecessors, (275), 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-03-17 19:47:34,427 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:47:34,427 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:47:34,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-17 19:47:34,427 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2025-03-17 19:47:34,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:47:34,428 INFO L85 PathProgramCache]: Analyzing trace with hash -1955104690, now seen corresponding path program 1 times [2025-03-17 19:47:34,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:47:34,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42153247] [2025-03-17 19:47:34,428 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:47:34,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:47:34,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-17 19:47:34,441 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-17 19:47:34,441 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:47:34,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:47:34,475 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-17 19:47:34,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:47:34,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42153247] [2025-03-17 19:47:34,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42153247] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:47:34,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:47:34,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 19:47:34,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742125884] [2025-03-17 19:47:34,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:47:34,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 19:47:34,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:47:34,478 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 19:47:34,478 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 19:47:34,488 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 105 [2025-03-17 19:47:34,488 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 180 transitions, 1294 flow. Second operand has 4 states, 4 states have (on average 56.0) internal successors, (224), 4 states have internal predecessors, (224), 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-03-17 19:47:34,488 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:47:34,488 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 105 [2025-03-17 19:47:34,488 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:47:36,656 INFO L124 PetriNetUnfolderBase]: 12701/22685 cut-off events. [2025-03-17 19:47:36,656 INFO L125 PetriNetUnfolderBase]: For 50446/51234 co-relation queries the response was YES. [2025-03-17 19:47:36,702 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74371 conditions, 22685 events. 12701/22685 cut-off events. For 50446/51234 co-relation queries the response was YES. Maximal size of possible extension queue 678. Compared 180227 event pairs, 7032 based on Foata normal form. 580/21164 useless extension candidates. Maximal degree in co-relation 74238. Up to 14121 conditions per place. [2025-03-17 19:47:36,766 INFO L140 encePairwiseOnDemand]: 99/105 looper letters, 164 selfloop transitions, 15 changer transitions 0/217 dead transitions. [2025-03-17 19:47:36,766 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 217 transitions, 1830 flow [2025-03-17 19:47:36,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 19:47:36,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 19:47:36,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 287 transitions. [2025-03-17 19:47:36,767 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6833333333333333 [2025-03-17 19:47:36,767 INFO L175 Difference]: Start difference. First operand has 191 places, 180 transitions, 1294 flow. Second operand 4 states and 287 transitions. [2025-03-17 19:47:36,767 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 217 transitions, 1830 flow [2025-03-17 19:47:36,801 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 217 transitions, 1780 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-17 19:47:36,803 INFO L231 Difference]: Finished difference. Result has 193 places, 181 transitions, 1330 flow [2025-03-17 19:47:36,803 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=1276, PETRI_DIFFERENCE_MINUEND_PLACES=188, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=180, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=165, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1330, PETRI_PLACES=193, PETRI_TRANSITIONS=181} [2025-03-17 19:47:36,803 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 93 predicate places. [2025-03-17 19:47:36,803 INFO L471 AbstractCegarLoop]: Abstraction has has 193 places, 181 transitions, 1330 flow [2025-03-17 19:47:36,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 56.0) internal successors, (224), 4 states have internal predecessors, (224), 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-03-17 19:47:36,803 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:47:36,803 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:47:36,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-17 19:47:36,804 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2025-03-17 19:47:36,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:47:36,804 INFO L85 PathProgramCache]: Analyzing trace with hash 1700899916, now seen corresponding path program 1 times [2025-03-17 19:47:36,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:47:36,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825136238] [2025-03-17 19:47:36,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:47:36,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:47:36,810 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-17 19:47:36,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-17 19:47:36,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:47:36,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:47:36,848 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-17 19:47:36,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:47:36,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825136238] [2025-03-17 19:47:36,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825136238] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:47:36,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1409320768] [2025-03-17 19:47:36,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:47:36,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:47:36,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:47:36,852 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:47:36,852 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-03-17 19:47:36,924 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-17 19:47:36,945 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-17 19:47:36,945 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:47:36,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:47:36,947 INFO L256 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-17 19:47:36,948 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:47:37,048 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-17 19:47:37,049 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:47:37,153 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-17 19:47:37,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1409320768] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:47:37,154 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:47:37,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 10, 10] total 23 [2025-03-17 19:47:37,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9867658] [2025-03-17 19:47:37,154 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:47:37,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-17 19:47:37,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:47:37,154 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-17 19:47:37,154 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=415, Unknown=0, NotChecked=0, Total=506 [2025-03-17 19:47:37,313 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 105 [2025-03-17 19:47:37,314 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 193 places, 181 transitions, 1330 flow. Second operand has 23 states, 23 states have (on average 48.17391304347826) internal successors, (1108), 23 states have internal predecessors, (1108), 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-03-17 19:47:37,314 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:47:37,314 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 105 [2025-03-17 19:47:37,314 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:47:39,551 INFO L124 PetriNetUnfolderBase]: 14545/24729 cut-off events. [2025-03-17 19:47:39,551 INFO L125 PetriNetUnfolderBase]: For 61003/62297 co-relation queries the response was YES. [2025-03-17 19:47:39,651 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85152 conditions, 24729 events. 14545/24729 cut-off events. For 61003/62297 co-relation queries the response was YES. Maximal size of possible extension queue 654. Compared 189281 event pairs, 5154 based on Foata normal form. 283/22136 useless extension candidates. Maximal degree in co-relation 84885. Up to 6435 conditions per place. [2025-03-17 19:47:39,739 INFO L140 encePairwiseOnDemand]: 90/105 looper letters, 344 selfloop transitions, 84 changer transitions 0/469 dead transitions. [2025-03-17 19:47:39,739 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 213 places, 469 transitions, 4225 flow [2025-03-17 19:47:39,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-17 19:47:39,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-03-17 19:47:39,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 1248 transitions. [2025-03-17 19:47:39,740 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5659863945578232 [2025-03-17 19:47:39,741 INFO L175 Difference]: Start difference. First operand has 193 places, 181 transitions, 1330 flow. Second operand 21 states and 1248 transitions. [2025-03-17 19:47:39,741 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 213 places, 469 transitions, 4225 flow [2025-03-17 19:47:39,841 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 212 places, 469 transitions, 4170 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 19:47:39,844 INFO L231 Difference]: Finished difference. Result has 217 places, 213 transitions, 1805 flow [2025-03-17 19:47:39,844 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=1316, PETRI_DIFFERENCE_MINUEND_PLACES=192, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=181, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=1805, PETRI_PLACES=217, PETRI_TRANSITIONS=213} [2025-03-17 19:47:39,844 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 117 predicate places. [2025-03-17 19:47:39,844 INFO L471 AbstractCegarLoop]: Abstraction has has 217 places, 213 transitions, 1805 flow [2025-03-17 19:47:39,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 48.17391304347826) internal successors, (1108), 23 states have internal predecessors, (1108), 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-03-17 19:47:39,845 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:47:39,845 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:47:39,851 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2025-03-17 19:47:40,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-03-17 19:47:40,047 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2025-03-17 19:47:40,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:47:40,047 INFO L85 PathProgramCache]: Analyzing trace with hash -773869801, now seen corresponding path program 1 times [2025-03-17 19:47:40,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:47:40,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976511501] [2025-03-17 19:47:40,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:47:40,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:47:40,053 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-17 19:47:40,056 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-17 19:47:40,056 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:47:40,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:47:40,114 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 19:47:40,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:47:40,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976511501] [2025-03-17 19:47:40,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976511501] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:47:40,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:47:40,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 19:47:40,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408193266] [2025-03-17 19:47:40,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:47:40,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 19:47:40,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:47:40,115 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 19:47:40,115 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-17 19:47:40,162 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 105 [2025-03-17 19:47:40,162 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 213 transitions, 1805 flow. Second operand has 6 states, 6 states have (on average 47.333333333333336) internal successors, (284), 6 states have internal predecessors, (284), 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-03-17 19:47:40,162 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:47:40,162 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 105 [2025-03-17 19:47:40,162 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:47:43,171 INFO L124 PetriNetUnfolderBase]: 21021/35360 cut-off events. [2025-03-17 19:47:43,172 INFO L125 PetriNetUnfolderBase]: For 102043/104369 co-relation queries the response was YES. [2025-03-17 19:47:43,369 INFO L83 FinitePrefix]: Finished finitePrefix Result has 134686 conditions, 35360 events. 21021/35360 cut-off events. For 102043/104369 co-relation queries the response was YES. Maximal size of possible extension queue 984. Compared 283591 event pairs, 10966 based on Foata normal form. 674/33150 useless extension candidates. Maximal degree in co-relation 134493. Up to 20095 conditions per place. [2025-03-17 19:47:43,499 INFO L140 encePairwiseOnDemand]: 95/105 looper letters, 214 selfloop transitions, 23 changer transitions 0/273 dead transitions. [2025-03-17 19:47:43,499 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 273 transitions, 2753 flow [2025-03-17 19:47:43,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 19:47:43,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-17 19:47:43,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 301 transitions. [2025-03-17 19:47:43,500 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5733333333333334 [2025-03-17 19:47:43,500 INFO L175 Difference]: Start difference. First operand has 217 places, 213 transitions, 1805 flow. Second operand 5 states and 301 transitions. [2025-03-17 19:47:43,500 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 221 places, 273 transitions, 2753 flow [2025-03-17 19:47:44,110 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 273 transitions, 2683 flow, removed 15 selfloop flow, removed 3 redundant places. [2025-03-17 19:47:44,113 INFO L231 Difference]: Finished difference. Result has 221 places, 218 transitions, 1871 flow [2025-03-17 19:47:44,113 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=1751, PETRI_DIFFERENCE_MINUEND_PLACES=214, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=213, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1871, PETRI_PLACES=221, PETRI_TRANSITIONS=218} [2025-03-17 19:47:44,113 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 121 predicate places. [2025-03-17 19:47:44,113 INFO L471 AbstractCegarLoop]: Abstraction has has 221 places, 218 transitions, 1871 flow [2025-03-17 19:47:44,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 47.333333333333336) internal successors, (284), 6 states have internal predecessors, (284), 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-03-17 19:47:44,114 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:47:44,114 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:47:44,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-17 19:47:44,114 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting thread2Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2025-03-17 19:47:44,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:47:44,114 INFO L85 PathProgramCache]: Analyzing trace with hash -471428490, now seen corresponding path program 1 times [2025-03-17 19:47:44,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:47:44,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923753826] [2025-03-17 19:47:44,114 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:47:44,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:47:44,121 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-17 19:47:44,125 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-17 19:47:44,125 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:47:44,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:47:44,223 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-17 19:47:44,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:47:44,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923753826] [2025-03-17 19:47:44,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923753826] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:47:44,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [159821466] [2025-03-17 19:47:44,224 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:47:44,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:47:44,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:47:44,226 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:47:44,227 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-03-17 19:47:44,299 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-17 19:47:44,320 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-17 19:47:44,320 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:47:44,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:47:44,321 INFO L256 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-17 19:47:44,322 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:47:44,420 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-17 19:47:44,420 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:47:44,512 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-17 19:47:44,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [159821466] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:47:44,512 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:47:44,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 25 [2025-03-17 19:47:44,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706098475] [2025-03-17 19:47:44,513 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:47:44,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-17 19:47:44,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:47:44,513 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-17 19:47:44,513 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=514, Unknown=0, NotChecked=0, Total=650 [2025-03-17 19:47:44,613 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 105 [2025-03-17 19:47:44,614 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 221 places, 218 transitions, 1871 flow. Second operand has 26 states, 26 states have (on average 45.84615384615385) internal successors, (1192), 26 states have internal predecessors, (1192), 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-03-17 19:47:44,614 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:47:44,614 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 105 [2025-03-17 19:47:44,614 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:47:48,216 INFO L124 PetriNetUnfolderBase]: 21733/34896 cut-off events. [2025-03-17 19:47:48,216 INFO L125 PetriNetUnfolderBase]: For 87841/89579 co-relation queries the response was YES. [2025-03-17 19:47:48,342 INFO L83 FinitePrefix]: Finished finitePrefix Result has 124177 conditions, 34896 events. 21733/34896 cut-off events. For 87841/89579 co-relation queries the response was YES. Maximal size of possible extension queue 727. Compared 256449 event pairs, 13073 based on Foata normal form. 931/34047 useless extension candidates. Maximal degree in co-relation 124020. Up to 17163 conditions per place. [2025-03-17 19:47:48,472 INFO L140 encePairwiseOnDemand]: 90/105 looper letters, 164 selfloop transitions, 105 changer transitions 0/307 dead transitions. [2025-03-17 19:47:48,472 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 237 places, 307 transitions, 2886 flow [2025-03-17 19:47:48,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-17 19:47:48,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2025-03-17 19:47:48,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 1053 transitions. [2025-03-17 19:47:48,474 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5014285714285714 [2025-03-17 19:47:48,474 INFO L175 Difference]: Start difference. First operand has 221 places, 218 transitions, 1871 flow. Second operand 20 states and 1053 transitions. [2025-03-17 19:47:48,474 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 237 places, 307 transitions, 2886 flow [2025-03-17 19:47:48,727 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 236 places, 307 transitions, 2874 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-03-17 19:47:48,730 INFO L231 Difference]: Finished difference. Result has 242 places, 220 transitions, 2221 flow [2025-03-17 19:47:48,730 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=1809, PETRI_DIFFERENCE_MINUEND_PLACES=217, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=211, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=96, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=2221, PETRI_PLACES=242, PETRI_TRANSITIONS=220} [2025-03-17 19:47:48,731 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 142 predicate places. [2025-03-17 19:47:48,731 INFO L471 AbstractCegarLoop]: Abstraction has has 242 places, 220 transitions, 2221 flow [2025-03-17 19:47:48,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 45.84615384615385) internal successors, (1192), 26 states have internal predecessors, (1192), 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-03-17 19:47:48,731 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:47:48,731 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:47:48,738 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2025-03-17 19:47:48,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-03-17 19:47:48,935 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2025-03-17 19:47:48,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:47:48,935 INFO L85 PathProgramCache]: Analyzing trace with hash 1493107348, now seen corresponding path program 1 times [2025-03-17 19:47:48,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:47:48,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699020124] [2025-03-17 19:47:48,935 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:47:48,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:47:48,944 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-17 19:47:48,947 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-17 19:47:48,948 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:47:48,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:47:49,027 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 19:47:49,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:47:49,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699020124] [2025-03-17 19:47:49,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699020124] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:47:49,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:47:49,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 19:47:49,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979714498] [2025-03-17 19:47:49,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:47:49,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 19:47:49,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:47:49,029 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 19:47:49,029 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-17 19:47:49,097 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 105 [2025-03-17 19:47:49,098 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 242 places, 220 transitions, 2221 flow. Second operand has 7 states, 7 states have (on average 46.714285714285715) internal successors, (327), 7 states have internal predecessors, (327), 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-03-17 19:47:49,098 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:47:49,098 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 105 [2025-03-17 19:47:49,098 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:47:54,330 INFO L124 PetriNetUnfolderBase]: 27491/47703 cut-off events. [2025-03-17 19:47:54,330 INFO L125 PetriNetUnfolderBase]: For 179018/182221 co-relation queries the response was YES. [2025-03-17 19:47:54,651 INFO L83 FinitePrefix]: Finished finitePrefix Result has 186647 conditions, 47703 events. 27491/47703 cut-off events. For 179018/182221 co-relation queries the response was YES. Maximal size of possible extension queue 1192. Compared 409997 event pairs, 22945 based on Foata normal form. 921/45628 useless extension candidates. Maximal degree in co-relation 186459. Up to 22661 conditions per place. [2025-03-17 19:47:54,810 INFO L140 encePairwiseOnDemand]: 93/105 looper letters, 223 selfloop transitions, 33 changer transitions 0/292 dead transitions. [2025-03-17 19:47:54,810 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 247 places, 292 transitions, 3347 flow [2025-03-17 19:47:54,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 19:47:54,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 19:47:54,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 345 transitions. [2025-03-17 19:47:54,811 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5476190476190477 [2025-03-17 19:47:54,811 INFO L175 Difference]: Start difference. First operand has 242 places, 220 transitions, 2221 flow. Second operand 6 states and 345 transitions. [2025-03-17 19:47:54,811 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 247 places, 292 transitions, 3347 flow [2025-03-17 19:47:55,825 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 230 places, 292 transitions, 3050 flow, removed 16 selfloop flow, removed 17 redundant places. [2025-03-17 19:47:55,828 INFO L231 Difference]: Finished difference. Result has 233 places, 228 transitions, 2106 flow [2025-03-17 19:47:55,828 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=1939, PETRI_DIFFERENCE_MINUEND_PLACES=225, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=220, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=189, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2106, PETRI_PLACES=233, PETRI_TRANSITIONS=228} [2025-03-17 19:47:55,828 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 133 predicate places. [2025-03-17 19:47:55,828 INFO L471 AbstractCegarLoop]: Abstraction has has 233 places, 228 transitions, 2106 flow [2025-03-17 19:47:55,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 46.714285714285715) internal successors, (327), 7 states have internal predecessors, (327), 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-03-17 19:47:55,829 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:47:55,829 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:47:55,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-17 19:47:55,829 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting thread3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2025-03-17 19:47:55,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:47:55,829 INFO L85 PathProgramCache]: Analyzing trace with hash -607912696, now seen corresponding path program 1 times [2025-03-17 19:47:55,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:47:55,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682950834] [2025-03-17 19:47:55,829 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:47:55,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:47:55,835 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-17 19:47:55,839 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-17 19:47:55,839 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:47:55,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:47:56,002 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-17 19:47:56,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:47:56,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682950834] [2025-03-17 19:47:56,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682950834] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:47:56,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1116852976] [2025-03-17 19:47:56,002 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:47:56,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:47:56,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:47:56,004 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:47:56,006 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-03-17 19:47:56,081 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-17 19:47:56,102 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-17 19:47:56,103 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:47:56,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:47:56,104 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 19:47:56,106 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:47:56,151 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-17 19:47:56,151 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:47:56,200 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-17 19:47:56,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1116852976] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:47:56,200 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:47:56,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2025-03-17 19:47:56,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439479370] [2025-03-17 19:47:56,200 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:47:56,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-17 19:47:56,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:47:56,201 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-17 19:47:56,201 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2025-03-17 19:47:56,246 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 105 [2025-03-17 19:47:56,247 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 233 places, 228 transitions, 2106 flow. Second operand has 15 states, 15 states have (on average 49.4) internal successors, (741), 15 states have internal predecessors, (741), 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-03-17 19:47:56,247 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:47:56,247 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 105 [2025-03-17 19:47:56,247 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand