./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/pthread-ext/09_fmaxsym-zero.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-ext/09_fmaxsym-zero.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 41cf9d90b654ba629ed26494b45977a61fd5035aced9f092d4e43a94133522bd --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 06:34:13,514 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 06:34:13,571 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-01-10 06:34:13,579 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 06:34:13,580 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 06:34:13,606 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 06:34:13,607 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 06:34:13,607 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 06:34:13,608 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 06:34:13,608 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 06:34:13,609 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 06:34:13,609 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 06:34:13,609 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 06:34:13,609 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 06:34:13,610 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 06:34:13,610 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 06:34:13,610 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 06:34:13,610 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 06:34:13,610 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 06:34:13,610 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 06:34:13,610 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 06:34:13,610 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 06:34:13,610 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 06:34:13,610 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 06:34:13,611 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 06:34:13,611 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 06:34:13,611 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 06:34:13,611 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 06:34:13,611 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 06:34:13,611 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 06:34:13,612 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 06:34:13,612 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 06:34:13,612 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 06:34:13,612 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 06:34:13,612 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:34:13,612 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 06:34:13,612 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 06:34:13,612 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 06:34:13,612 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 06:34:13,612 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:34:13,612 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 06:34:13,613 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 06:34:13,613 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 06:34:13,613 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 06:34:13,613 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 06:34:13,613 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 06:34:13,613 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 06:34:13,613 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 06:34:13,613 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 06:34:13,613 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 06:34:13,613 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 41cf9d90b654ba629ed26494b45977a61fd5035aced9f092d4e43a94133522bd [2025-01-10 06:34:13,869 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 06:34:13,875 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 06:34:13,877 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 06:34:13,878 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 06:34:13,878 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 06:34:13,879 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-ext/09_fmaxsym-zero.i [2025-01-10 06:34:15,021 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/210aed0c0/95955f01f1c14f3dac4d7a8826883820/FLAG1bfdf6f40 [2025-01-10 06:34:15,309 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 06:34:15,310 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-ext/09_fmaxsym-zero.i [2025-01-10 06:34:15,325 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/210aed0c0/95955f01f1c14f3dac4d7a8826883820/FLAG1bfdf6f40 [2025-01-10 06:34:15,575 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/210aed0c0/95955f01f1c14f3dac4d7a8826883820 [2025-01-10 06:34:15,577 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 06:34:15,579 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 06:34:15,580 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 06:34:15,580 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 06:34:15,584 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 06:34:15,585 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:34:15" (1/1) ... [2025-01-10 06:34:15,586 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d6b1d1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:34:15, skipping insertion in model container [2025-01-10 06:34:15,586 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:34:15" (1/1) ... [2025-01-10 06:34:15,609 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 06:34:15,876 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 06:34:15,893 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 06:34:15,937 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 06:34:15,964 INFO L204 MainTranslator]: Completed translation [2025-01-10 06:34:15,966 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:34:15 WrapperNode [2025-01-10 06:34:15,966 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 06:34:15,967 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 06:34:15,967 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 06:34:15,967 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 06:34:15,972 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:34:15" (1/1) ... [2025-01-10 06:34:15,983 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:34:15" (1/1) ... [2025-01-10 06:34:16,001 INFO L138 Inliner]: procedures = 164, calls = 26, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 75 [2025-01-10 06:34:16,002 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 06:34:16,003 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 06:34:16,003 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 06:34:16,004 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 06:34:16,009 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:34:15" (1/1) ... [2025-01-10 06:34:16,010 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:34:15" (1/1) ... [2025-01-10 06:34:16,012 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:34:15" (1/1) ... [2025-01-10 06:34:16,027 INFO L175 MemorySlicer]: Split 14 memory accesses to 3 slices as follows [2, 5, 7]. 50 percent of accesses are in the largest equivalence class. The 13 initializations are split as follows [2, 5, 6]. The 0 writes are split as follows [0, 0, 0]. [2025-01-10 06:34:16,028 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:34:15" (1/1) ... [2025-01-10 06:34:16,028 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:34:15" (1/1) ... [2025-01-10 06:34:16,036 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:34:15" (1/1) ... [2025-01-10 06:34:16,037 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:34:15" (1/1) ... [2025-01-10 06:34:16,041 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:34:15" (1/1) ... [2025-01-10 06:34:16,043 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:34:15" (1/1) ... [2025-01-10 06:34:16,047 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:34:15" (1/1) ... [2025-01-10 06:34:16,049 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 06:34:16,049 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 06:34:16,049 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 06:34:16,049 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 06:34:16,050 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:34:15" (1/1) ... [2025-01-10 06:34:16,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:34:16,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:34:16,083 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-10 06:34:16,086 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-10 06:34:16,105 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 06:34:16,105 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-10 06:34:16,105 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-10 06:34:16,105 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-01-10 06:34:16,106 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-01-10 06:34:16,106 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-01-10 06:34:16,106 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 06:34:16,106 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 06:34:16,106 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 06:34:16,106 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-10 06:34:16,106 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-01-10 06:34:16,106 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 06:34:16,106 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 06:34:16,108 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-10 06:34:16,205 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 06:34:16,207 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 06:34:16,320 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 06:34:16,320 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 06:34:16,404 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 06:34:16,404 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2025-01-10 06:34:16,405 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:34:16 BoogieIcfgContainer [2025-01-10 06:34:16,405 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 06:34:16,407 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 06:34:16,407 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 06:34:16,411 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 06:34:16,411 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 06:34:15" (1/3) ... [2025-01-10 06:34:16,411 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bd20c74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:34:16, skipping insertion in model container [2025-01-10 06:34:16,411 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:34:15" (2/3) ... [2025-01-10 06:34:16,411 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bd20c74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:34:16, skipping insertion in model container [2025-01-10 06:34:16,411 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:34:16" (3/3) ... [2025-01-10 06:34:16,412 INFO L128 eAbstractionObserver]: Analyzing ICFG 09_fmaxsym-zero.i [2025-01-10 06:34:16,423 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 06:34:16,424 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 09_fmaxsym-zero.i that has 2 procedures, 21 locations, 1 initial locations, 2 loop locations, and 4 error locations. [2025-01-10 06:34:16,425 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 06:34:16,474 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-10 06:34:16,504 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 24 places, 23 transitions, 50 flow [2025-01-10 06:34:16,534 INFO L124 PetriNetUnfolderBase]: 2/25 cut-off events. [2025-01-10 06:34:16,537 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 06:34:16,540 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29 conditions, 25 events. 2/25 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 29 event pairs, 0 based on Foata normal form. 0/17 useless extension candidates. Maximal degree in co-relation 20. Up to 2 conditions per place. [2025-01-10 06:34:16,540 INFO L82 GeneralOperation]: Start removeDead. Operand has 24 places, 23 transitions, 50 flow [2025-01-10 06:34:16,543 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 24 places, 23 transitions, 50 flow [2025-01-10 06:34:16,556 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 06:34:16,568 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;@32fdc0a7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 06:34:16,569 INFO L334 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2025-01-10 06:34:16,576 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 06:34:16,576 INFO L124 PetriNetUnfolderBase]: 0/9 cut-off events. [2025-01-10 06:34:16,577 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 06:34:16,577 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:34:16,577 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-01-10 06:34:16,578 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-01-10 06:34:16,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:34:16,582 INFO L85 PathProgramCache]: Analyzing trace with hash 229745624, now seen corresponding path program 1 times [2025-01-10 06:34:16,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:34:16,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466894120] [2025-01-10 06:34:16,588 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:34:16,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:34:16,653 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 06:34:16,675 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 06:34:16,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:34:16,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:34:16,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:34:16,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:34:16,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466894120] [2025-01-10 06:34:16,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466894120] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:34:16,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:34:16,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:34:16,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161975462] [2025-01-10 06:34:16,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:34:16,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:34:16,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:34:16,841 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:34:16,841 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:34:16,851 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 23 [2025-01-10 06:34:16,853 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 23 transitions, 50 flow. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:34:16,853 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:34:16,853 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 23 [2025-01-10 06:34:16,854 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:34:16,897 INFO L124 PetriNetUnfolderBase]: 19/68 cut-off events. [2025-01-10 06:34:16,897 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 06:34:16,897 INFO L83 FinitePrefix]: Finished finitePrefix Result has 121 conditions, 68 events. 19/68 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 168 event pairs, 2 based on Foata normal form. 3/68 useless extension candidates. Maximal degree in co-relation 108. Up to 38 conditions per place. [2025-01-10 06:34:16,898 INFO L140 encePairwiseOnDemand]: 18/23 looper letters, 13 selfloop transitions, 2 changer transitions 0/22 dead transitions. [2025-01-10 06:34:16,898 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 22 transitions, 78 flow [2025-01-10 06:34:16,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:34:16,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 06:34:16,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 40 transitions. [2025-01-10 06:34:16,906 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5797101449275363 [2025-01-10 06:34:16,907 INFO L175 Difference]: Start difference. First operand has 24 places, 23 transitions, 50 flow. Second operand 3 states and 40 transitions. [2025-01-10 06:34:16,907 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 24 places, 22 transitions, 78 flow [2025-01-10 06:34:16,910 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 22 transitions, 78 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 06:34:16,912 INFO L231 Difference]: Finished difference. Result has 24 places, 20 transitions, 48 flow [2025-01-10 06:34:16,913 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=44, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=48, PETRI_PLACES=24, PETRI_TRANSITIONS=20} [2025-01-10 06:34:16,916 INFO L279 CegarLoopForPetriNet]: 24 programPoint places, 0 predicate places. [2025-01-10 06:34:16,916 INFO L471 AbstractCegarLoop]: Abstraction has has 24 places, 20 transitions, 48 flow [2025-01-10 06:34:16,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:34:16,916 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:34:16,916 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-01-10 06:34:16,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 06:34:16,916 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-01-10 06:34:16,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:34:16,917 INFO L85 PathProgramCache]: Analyzing trace with hash -1467836007, now seen corresponding path program 1 times [2025-01-10 06:34:16,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:34:16,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421413755] [2025-01-10 06:34:16,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:34:16,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:34:16,925 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 06:34:16,937 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 06:34:16,937 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:34:16,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:34:16,937 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 06:34:16,945 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 06:34:16,954 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 06:34:16,954 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:34:16,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:34:16,972 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 06:34:16,973 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-10 06:34:16,974 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 9 remaining) [2025-01-10 06:34:16,977 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 9 remaining) [2025-01-10 06:34:16,979 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 9 remaining) [2025-01-10 06:34:16,980 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 9 remaining) [2025-01-10 06:34:16,980 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 9 remaining) [2025-01-10 06:34:16,980 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 9 remaining) [2025-01-10 06:34:16,980 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 9 remaining) [2025-01-10 06:34:16,980 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 9 remaining) [2025-01-10 06:34:16,980 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 9 remaining) [2025-01-10 06:34:16,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 06:34:16,980 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-01-10 06:34:16,982 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-10 06:34:16,983 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-01-10 06:34:17,005 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-10 06:34:17,007 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 41 transitions, 92 flow [2025-01-10 06:34:17,020 INFO L124 PetriNetUnfolderBase]: 4/46 cut-off events. [2025-01-10 06:34:17,020 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-10 06:34:17,021 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54 conditions, 46 events. 4/46 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 89 event pairs, 0 based on Foata normal form. 0/31 useless extension candidates. Maximal degree in co-relation 37. Up to 3 conditions per place. [2025-01-10 06:34:17,021 INFO L82 GeneralOperation]: Start removeDead. Operand has 42 places, 41 transitions, 92 flow [2025-01-10 06:34:17,022 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 42 places, 41 transitions, 92 flow [2025-01-10 06:34:17,022 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 06:34:17,023 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;@32fdc0a7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 06:34:17,023 INFO L334 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2025-01-10 06:34:17,026 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 06:34:17,027 INFO L124 PetriNetUnfolderBase]: 0/9 cut-off events. [2025-01-10 06:34:17,027 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-10 06:34:17,028 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:34:17,028 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-01-10 06:34:17,029 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-01-10 06:34:17,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:34:17,030 INFO L85 PathProgramCache]: Analyzing trace with hash 268889010, now seen corresponding path program 1 times [2025-01-10 06:34:17,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:34:17,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538831058] [2025-01-10 06:34:17,030 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:34:17,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:34:17,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 06:34:17,051 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 06:34:17,053 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:34:17,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:34:17,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:34:17,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:34:17,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538831058] [2025-01-10 06:34:17,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538831058] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:34:17,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:34:17,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:34:17,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950217534] [2025-01-10 06:34:17,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:34:17,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:34:17,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:34:17,122 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:34:17,122 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:34:17,130 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 41 [2025-01-10 06:34:17,130 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 41 transitions, 92 flow. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:34:17,130 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:34:17,130 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 41 [2025-01-10 06:34:17,130 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:34:17,326 INFO L124 PetriNetUnfolderBase]: 388/818 cut-off events. [2025-01-10 06:34:17,326 INFO L125 PetriNetUnfolderBase]: For 25/25 co-relation queries the response was YES. [2025-01-10 06:34:17,328 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1484 conditions, 818 events. 388/818 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 4412 event pairs, 144 based on Foata normal form. 54/812 useless extension candidates. Maximal degree in co-relation 1276. Up to 517 conditions per place. [2025-01-10 06:34:17,332 INFO L140 encePairwiseOnDemand]: 35/41 looper letters, 31 selfloop transitions, 2 changer transitions 0/48 dead transitions. [2025-01-10 06:34:17,332 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 48 transitions, 177 flow [2025-01-10 06:34:17,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:34:17,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 06:34:17,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 84 transitions. [2025-01-10 06:34:17,335 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6829268292682927 [2025-01-10 06:34:17,335 INFO L175 Difference]: Start difference. First operand has 42 places, 41 transitions, 92 flow. Second operand 3 states and 84 transitions. [2025-01-10 06:34:17,335 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 48 transitions, 177 flow [2025-01-10 06:34:17,337 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 48 transitions, 177 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 06:34:17,337 INFO L231 Difference]: Finished difference. Result has 42 places, 37 transitions, 88 flow [2025-01-10 06:34:17,338 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=88, PETRI_PLACES=42, PETRI_TRANSITIONS=37} [2025-01-10 06:34:17,338 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 0 predicate places. [2025-01-10 06:34:17,338 INFO L471 AbstractCegarLoop]: Abstraction has has 42 places, 37 transitions, 88 flow [2025-01-10 06:34:17,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:34:17,338 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:34:17,338 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-01-10 06:34:17,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 06:34:17,339 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-01-10 06:34:17,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:34:17,339 INFO L85 PathProgramCache]: Analyzing trace with hash -254374968, now seen corresponding path program 1 times [2025-01-10 06:34:17,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:34:17,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738703518] [2025-01-10 06:34:17,339 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:34:17,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:34:17,349 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 06:34:17,354 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 06:34:17,355 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:34:17,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:34:17,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:34:17,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:34:17,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738703518] [2025-01-10 06:34:17,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738703518] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:34:17,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:34:17,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:34:17,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983798049] [2025-01-10 06:34:17,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:34:17,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:34:17,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:34:17,418 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:34:17,418 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:34:17,426 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 41 [2025-01-10 06:34:17,426 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 37 transitions, 88 flow. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:34:17,426 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:34:17,426 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 41 [2025-01-10 06:34:17,426 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:34:17,545 INFO L124 PetriNetUnfolderBase]: 345/739 cut-off events. [2025-01-10 06:34:17,545 INFO L125 PetriNetUnfolderBase]: For 77/77 co-relation queries the response was YES. [2025-01-10 06:34:17,548 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1387 conditions, 739 events. 345/739 cut-off events. For 77/77 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 3887 event pairs, 126 based on Foata normal form. 27/712 useless extension candidates. Maximal degree in co-relation 1187. Up to 447 conditions per place. [2025-01-10 06:34:17,552 INFO L140 encePairwiseOnDemand]: 38/41 looper letters, 30 selfloop transitions, 2 changer transitions 0/47 dead transitions. [2025-01-10 06:34:17,552 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 47 transitions, 177 flow [2025-01-10 06:34:17,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:34:17,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 06:34:17,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 78 transitions. [2025-01-10 06:34:17,554 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6341463414634146 [2025-01-10 06:34:17,554 INFO L175 Difference]: Start difference. First operand has 42 places, 37 transitions, 88 flow. Second operand 3 states and 78 transitions. [2025-01-10 06:34:17,554 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 47 transitions, 177 flow [2025-01-10 06:34:17,555 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 47 transitions, 173 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 06:34:17,556 INFO L231 Difference]: Finished difference. Result has 41 places, 36 transitions, 86 flow [2025-01-10 06:34:17,557 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=86, PETRI_PLACES=41, PETRI_TRANSITIONS=36} [2025-01-10 06:34:17,557 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, -1 predicate places. [2025-01-10 06:34:17,557 INFO L471 AbstractCegarLoop]: Abstraction has has 41 places, 36 transitions, 86 flow [2025-01-10 06:34:17,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:34:17,557 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:34:17,557 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-01-10 06:34:17,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 06:34:17,558 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-01-10 06:34:17,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:34:17,558 INFO L85 PathProgramCache]: Analyzing trace with hash 327205181, now seen corresponding path program 1 times [2025-01-10 06:34:17,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:34:17,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326072624] [2025-01-10 06:34:17,558 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:34:17,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:34:17,564 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 06:34:17,567 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 06:34:17,567 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:34:17,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:34:17,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:34:17,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:34:17,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326072624] [2025-01-10 06:34:17,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326072624] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:34:17,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:34:17,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:34:17,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122445623] [2025-01-10 06:34:17,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:34:17,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:34:17,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:34:17,599 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:34:17,599 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:34:17,607 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 41 [2025-01-10 06:34:17,607 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 36 transitions, 86 flow. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:34:17,607 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:34:17,607 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 41 [2025-01-10 06:34:17,607 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:34:17,731 INFO L124 PetriNetUnfolderBase]: 385/811 cut-off events. [2025-01-10 06:34:17,731 INFO L125 PetriNetUnfolderBase]: For 85/85 co-relation queries the response was YES. [2025-01-10 06:34:17,734 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1529 conditions, 811 events. 385/811 cut-off events. For 85/85 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 4422 event pairs, 72 based on Foata normal form. 24/796 useless extension candidates. Maximal degree in co-relation 1040. Up to 472 conditions per place. [2025-01-10 06:34:17,739 INFO L140 encePairwiseOnDemand]: 38/41 looper letters, 30 selfloop transitions, 2 changer transitions 0/45 dead transitions. [2025-01-10 06:34:17,741 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 45 transitions, 172 flow [2025-01-10 06:34:17,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:34:17,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 06:34:17,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 78 transitions. [2025-01-10 06:34:17,742 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6341463414634146 [2025-01-10 06:34:17,742 INFO L175 Difference]: Start difference. First operand has 41 places, 36 transitions, 86 flow. Second operand 3 states and 78 transitions. [2025-01-10 06:34:17,743 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 45 transitions, 172 flow [2025-01-10 06:34:17,744 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 45 transitions, 164 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 06:34:17,745 INFO L231 Difference]: Finished difference. Result has 40 places, 35 transitions, 84 flow [2025-01-10 06:34:17,745 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=84, PETRI_PLACES=40, PETRI_TRANSITIONS=35} [2025-01-10 06:34:17,745 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, -2 predicate places. [2025-01-10 06:34:17,746 INFO L471 AbstractCegarLoop]: Abstraction has has 40 places, 35 transitions, 84 flow [2025-01-10 06:34:17,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:34:17,746 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:34:17,746 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1] [2025-01-10 06:34:17,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 06:34:17,746 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-01-10 06:34:17,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:34:17,747 INFO L85 PathProgramCache]: Analyzing trace with hash 1553410318, now seen corresponding path program 1 times [2025-01-10 06:34:17,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:34:17,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661059470] [2025-01-10 06:34:17,747 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:34:17,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:34:17,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 06:34:17,755 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 06:34:17,756 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:34:17,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:34:17,756 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 06:34:17,757 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 06:34:17,761 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 06:34:17,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:34:17,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:34:17,766 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 06:34:17,767 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-10 06:34:17,767 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 13 remaining) [2025-01-10 06:34:17,767 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 13 remaining) [2025-01-10 06:34:17,767 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 13 remaining) [2025-01-10 06:34:17,767 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 13 remaining) [2025-01-10 06:34:17,767 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 13 remaining) [2025-01-10 06:34:17,767 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 13 remaining) [2025-01-10 06:34:17,767 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 13 remaining) [2025-01-10 06:34:17,767 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 13 remaining) [2025-01-10 06:34:17,767 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 13 remaining) [2025-01-10 06:34:17,767 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 13 remaining) [2025-01-10 06:34:17,767 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 13 remaining) [2025-01-10 06:34:17,767 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 13 remaining) [2025-01-10 06:34:17,767 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 13 remaining) [2025-01-10 06:34:17,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 06:34:17,767 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-01-10 06:34:17,768 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-10 06:34:17,768 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-01-10 06:34:17,798 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-10 06:34:17,799 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 60 places, 59 transitions, 136 flow [2025-01-10 06:34:17,806 INFO L124 PetriNetUnfolderBase]: 6/67 cut-off events. [2025-01-10 06:34:17,806 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-01-10 06:34:17,807 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80 conditions, 67 events. 6/67 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 176 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 54. Up to 4 conditions per place. [2025-01-10 06:34:17,807 INFO L82 GeneralOperation]: Start removeDead. Operand has 60 places, 59 transitions, 136 flow [2025-01-10 06:34:17,808 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 60 places, 59 transitions, 136 flow [2025-01-10 06:34:17,809 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 06:34:17,809 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;@32fdc0a7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 06:34:17,809 INFO L334 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2025-01-10 06:34:17,811 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 06:34:17,811 INFO L124 PetriNetUnfolderBase]: 0/9 cut-off events. [2025-01-10 06:34:17,811 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-10 06:34:17,811 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:34:17,811 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-01-10 06:34:17,811 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-01-10 06:34:17,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:34:17,811 INFO L85 PathProgramCache]: Analyzing trace with hash 325209342, now seen corresponding path program 1 times [2025-01-10 06:34:17,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:34:17,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291959474] [2025-01-10 06:34:17,812 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:34:17,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:34:17,819 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 06:34:17,821 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 06:34:17,821 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:34:17,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:34:17,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:34:17,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:34:17,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291959474] [2025-01-10 06:34:17,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291959474] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:34:17,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:34:17,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:34:17,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631507110] [2025-01-10 06:34:17,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:34:17,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:34:17,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:34:17,854 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:34:17,854 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:34:17,862 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 59 [2025-01-10 06:34:17,863 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 59 transitions, 136 flow. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:34:17,863 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:34:17,863 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 59 [2025-01-10 06:34:17,863 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:34:18,472 INFO L124 PetriNetUnfolderBase]: 5068/8513 cut-off events. [2025-01-10 06:34:18,473 INFO L125 PetriNetUnfolderBase]: For 473/473 co-relation queries the response was YES. [2025-01-10 06:34:18,488 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15876 conditions, 8513 events. 5068/8513 cut-off events. For 473/473 co-relation queries the response was YES. Maximal size of possible extension queue 496. Compared 59661 event pairs, 2492 based on Foata normal form. 678/8654 useless extension candidates. Maximal degree in co-relation 10761. Up to 5693 conditions per place. [2025-01-10 06:34:18,575 INFO L140 encePairwiseOnDemand]: 52/59 looper letters, 49 selfloop transitions, 2 changer transitions 0/74 dead transitions. [2025-01-10 06:34:18,576 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 74 transitions, 280 flow [2025-01-10 06:34:18,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:34:18,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 06:34:18,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 128 transitions. [2025-01-10 06:34:18,577 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7231638418079096 [2025-01-10 06:34:18,577 INFO L175 Difference]: Start difference. First operand has 60 places, 59 transitions, 136 flow. Second operand 3 states and 128 transitions. [2025-01-10 06:34:18,577 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 74 transitions, 280 flow [2025-01-10 06:34:18,578 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 74 transitions, 276 flow, removed 2 selfloop flow, removed 0 redundant places. [2025-01-10 06:34:18,580 INFO L231 Difference]: Finished difference. Result has 60 places, 54 transitions, 128 flow [2025-01-10 06:34:18,580 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=128, PETRI_PLACES=60, PETRI_TRANSITIONS=54} [2025-01-10 06:34:18,581 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 0 predicate places. [2025-01-10 06:34:18,581 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 54 transitions, 128 flow [2025-01-10 06:34:18,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:34:18,581 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:34:18,581 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-01-10 06:34:18,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 06:34:18,581 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-01-10 06:34:18,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:34:18,581 INFO L85 PathProgramCache]: Analyzing trace with hash 1491555383, now seen corresponding path program 1 times [2025-01-10 06:34:18,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:34:18,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438356118] [2025-01-10 06:34:18,582 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:34:18,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:34:18,586 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 06:34:18,588 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 06:34:18,588 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:34:18,588 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:34:18,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:34:18,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:34:18,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438356118] [2025-01-10 06:34:18,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438356118] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:34:18,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:34:18,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:34:18,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127827457] [2025-01-10 06:34:18,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:34:18,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:34:18,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:34:18,619 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:34:18,619 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:34:18,627 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 59 [2025-01-10 06:34:18,627 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 54 transitions, 128 flow. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:34:18,627 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:34:18,627 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 59 [2025-01-10 06:34:18,627 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:34:19,128 INFO L124 PetriNetUnfolderBase]: 4505/7983 cut-off events. [2025-01-10 06:34:19,128 INFO L125 PetriNetUnfolderBase]: For 671/671 co-relation queries the response was YES. [2025-01-10 06:34:19,138 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14904 conditions, 7983 events. 4505/7983 cut-off events. For 671/671 co-relation queries the response was YES. Maximal size of possible extension queue 443. Compared 59764 event pairs, 806 based on Foata normal form. 219/7788 useless extension candidates. Maximal degree in co-relation 13393. Up to 4911 conditions per place. [2025-01-10 06:34:19,173 INFO L140 encePairwiseOnDemand]: 56/59 looper letters, 48 selfloop transitions, 2 changer transitions 0/73 dead transitions. [2025-01-10 06:34:19,174 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 73 transitions, 276 flow [2025-01-10 06:34:19,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:34:19,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 06:34:19,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 120 transitions. [2025-01-10 06:34:19,176 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6779661016949152 [2025-01-10 06:34:19,177 INFO L175 Difference]: Start difference. First operand has 60 places, 54 transitions, 128 flow. Second operand 3 states and 120 transitions. [2025-01-10 06:34:19,178 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 73 transitions, 276 flow [2025-01-10 06:34:19,181 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 73 transitions, 272 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 06:34:19,182 INFO L231 Difference]: Finished difference. Result has 59 places, 53 transitions, 126 flow [2025-01-10 06:34:19,182 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=126, PETRI_PLACES=59, PETRI_TRANSITIONS=53} [2025-01-10 06:34:19,182 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, -1 predicate places. [2025-01-10 06:34:19,184 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 53 transitions, 126 flow [2025-01-10 06:34:19,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:34:19,184 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:34:19,184 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-01-10 06:34:19,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 06:34:19,184 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-01-10 06:34:19,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:34:19,185 INFO L85 PathProgramCache]: Analyzing trace with hash -1165920931, now seen corresponding path program 1 times [2025-01-10 06:34:19,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:34:19,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837093353] [2025-01-10 06:34:19,185 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:34:19,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:34:19,189 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 06:34:19,192 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 06:34:19,192 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:34:19,192 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:34:19,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:34:19,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:34:19,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837093353] [2025-01-10 06:34:19,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837093353] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:34:19,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:34:19,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:34:19,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589970840] [2025-01-10 06:34:19,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:34:19,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:34:19,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:34:19,215 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:34:19,215 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:34:19,221 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 59 [2025-01-10 06:34:19,222 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 53 transitions, 126 flow. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:34:19,222 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:34:19,222 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 59 [2025-01-10 06:34:19,222 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:34:19,672 INFO L124 PetriNetUnfolderBase]: 5065/8773 cut-off events. [2025-01-10 06:34:19,672 INFO L125 PetriNetUnfolderBase]: For 751/751 co-relation queries the response was YES. [2025-01-10 06:34:19,684 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16548 conditions, 8773 events. 5065/8773 cut-off events. For 751/751 co-relation queries the response was YES. Maximal size of possible extension queue 463. Compared 64727 event pairs, 824 based on Foata normal form. 216/8563 useless extension candidates. Maximal degree in co-relation 11982. Up to 5648 conditions per place. [2025-01-10 06:34:19,713 INFO L140 encePairwiseOnDemand]: 56/59 looper letters, 48 selfloop transitions, 2 changer transitions 0/71 dead transitions. [2025-01-10 06:34:19,713 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 71 transitions, 271 flow [2025-01-10 06:34:19,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:34:19,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 06:34:19,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 120 transitions. [2025-01-10 06:34:19,715 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6779661016949152 [2025-01-10 06:34:19,715 INFO L175 Difference]: Start difference. First operand has 59 places, 53 transitions, 126 flow. Second operand 3 states and 120 transitions. [2025-01-10 06:34:19,715 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 71 transitions, 271 flow [2025-01-10 06:34:19,718 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 71 transitions, 263 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 06:34:19,719 INFO L231 Difference]: Finished difference. Result has 58 places, 52 transitions, 124 flow [2025-01-10 06:34:19,719 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=124, PETRI_PLACES=58, PETRI_TRANSITIONS=52} [2025-01-10 06:34:19,720 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, -2 predicate places. [2025-01-10 06:34:19,720 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 52 transitions, 124 flow [2025-01-10 06:34:19,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:34:19,720 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:34:19,720 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:34:19,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-10 06:34:19,720 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-01-10 06:34:19,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:34:19,721 INFO L85 PathProgramCache]: Analyzing trace with hash -1783810103, now seen corresponding path program 1 times [2025-01-10 06:34:19,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:34:19,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335894627] [2025-01-10 06:34:19,721 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:34:19,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:34:19,726 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 06:34:19,730 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 06:34:19,730 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:34:19,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:34:19,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:34:19,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:34:19,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335894627] [2025-01-10 06:34:19,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335894627] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:34:19,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:34:19,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:34:19,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707319770] [2025-01-10 06:34:19,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:34:19,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:34:19,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:34:19,770 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:34:19,770 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:34:19,775 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 59 [2025-01-10 06:34:19,775 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 52 transitions, 124 flow. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:34:19,775 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:34:19,775 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 59 [2025-01-10 06:34:19,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:34:20,290 INFO L124 PetriNetUnfolderBase]: 4505/7991 cut-off events. [2025-01-10 06:34:20,291 INFO L125 PetriNetUnfolderBase]: For 658/658 co-relation queries the response was YES. [2025-01-10 06:34:20,304 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14906 conditions, 7991 events. 4505/7991 cut-off events. For 658/658 co-relation queries the response was YES. Maximal size of possible extension queue 431. Compared 59586 event pairs, 824 based on Foata normal form. 216/7800 useless extension candidates. Maximal degree in co-relation 9230. Up to 4872 conditions per place. [2025-01-10 06:34:20,334 INFO L140 encePairwiseOnDemand]: 56/59 looper letters, 47 selfloop transitions, 2 changer transitions 0/70 dead transitions. [2025-01-10 06:34:20,334 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 70 transitions, 263 flow [2025-01-10 06:34:20,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:34:20,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 06:34:20,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 119 transitions. [2025-01-10 06:34:20,335 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.672316384180791 [2025-01-10 06:34:20,335 INFO L175 Difference]: Start difference. First operand has 58 places, 52 transitions, 124 flow. Second operand 3 states and 119 transitions. [2025-01-10 06:34:20,335 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 70 transitions, 263 flow [2025-01-10 06:34:20,338 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 70 transitions, 259 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 06:34:20,340 INFO L231 Difference]: Finished difference. Result has 57 places, 51 transitions, 122 flow [2025-01-10 06:34:20,340 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=122, PETRI_PLACES=57, PETRI_TRANSITIONS=51} [2025-01-10 06:34:20,341 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, -3 predicate places. [2025-01-10 06:34:20,341 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 51 transitions, 122 flow [2025-01-10 06:34:20,342 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:34:20,342 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:34:20,342 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1] [2025-01-10 06:34:20,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-10 06:34:20,342 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-01-10 06:34:20,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:34:20,343 INFO L85 PathProgramCache]: Analyzing trace with hash -597347777, now seen corresponding path program 1 times [2025-01-10 06:34:20,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:34:20,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043466006] [2025-01-10 06:34:20,343 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:34:20,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:34:20,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 06:34:20,353 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 06:34:20,353 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:34:20,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:34:20,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:34:20,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:34:20,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043466006] [2025-01-10 06:34:20,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043466006] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:34:20,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:34:20,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:34:20,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985212248] [2025-01-10 06:34:20,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:34:20,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:34:20,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:34:20,389 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:34:20,389 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:34:20,396 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 59 [2025-01-10 06:34:20,397 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 51 transitions, 122 flow. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:34:20,397 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:34:20,397 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 59 [2025-01-10 06:34:20,397 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:34:20,823 INFO L124 PetriNetUnfolderBase]: 5017/8534 cut-off events. [2025-01-10 06:34:20,823 INFO L125 PetriNetUnfolderBase]: For 736/736 co-relation queries the response was YES. [2025-01-10 06:34:20,833 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16201 conditions, 8534 events. 5017/8534 cut-off events. For 736/736 co-relation queries the response was YES. Maximal size of possible extension queue 471. Compared 61225 event pairs, 1094 based on Foata normal form. 192/8365 useless extension candidates. Maximal degree in co-relation 10059. Up to 5120 conditions per place. [2025-01-10 06:34:20,856 INFO L140 encePairwiseOnDemand]: 56/59 looper letters, 47 selfloop transitions, 2 changer transitions 0/68 dead transitions. [2025-01-10 06:34:20,857 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 68 transitions, 258 flow [2025-01-10 06:34:20,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:34:20,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 06:34:20,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 119 transitions. [2025-01-10 06:34:20,858 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.672316384180791 [2025-01-10 06:34:20,858 INFO L175 Difference]: Start difference. First operand has 57 places, 51 transitions, 122 flow. Second operand 3 states and 119 transitions. [2025-01-10 06:34:20,858 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 68 transitions, 258 flow [2025-01-10 06:34:20,859 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 68 transitions, 250 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 06:34:20,859 INFO L231 Difference]: Finished difference. Result has 56 places, 50 transitions, 120 flow [2025-01-10 06:34:20,859 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=120, PETRI_PLACES=56, PETRI_TRANSITIONS=50} [2025-01-10 06:34:20,860 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, -4 predicate places. [2025-01-10 06:34:20,860 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 50 transitions, 120 flow [2025-01-10 06:34:20,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:34:20,860 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:34:20,861 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 3, 1, 1, 1, 1, 1] [2025-01-10 06:34:20,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-10 06:34:20,861 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-01-10 06:34:20,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:34:20,862 INFO L85 PathProgramCache]: Analyzing trace with hash -1337927528, now seen corresponding path program 1 times [2025-01-10 06:34:20,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:34:20,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777198473] [2025-01-10 06:34:20,862 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:34:20,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:34:20,868 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 06:34:20,871 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 06:34:20,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:34:20,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:34:20,871 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 06:34:20,873 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 06:34:20,876 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 06:34:20,876 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:34:20,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:34:20,883 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 06:34:20,883 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-10 06:34:20,884 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (16 of 17 remaining) [2025-01-10 06:34:20,884 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 17 remaining) [2025-01-10 06:34:20,884 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 17 remaining) [2025-01-10 06:34:20,884 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 17 remaining) [2025-01-10 06:34:20,884 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 17 remaining) [2025-01-10 06:34:20,884 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 17 remaining) [2025-01-10 06:34:20,884 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 17 remaining) [2025-01-10 06:34:20,884 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 17 remaining) [2025-01-10 06:34:20,884 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 17 remaining) [2025-01-10 06:34:20,884 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 17 remaining) [2025-01-10 06:34:20,884 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 17 remaining) [2025-01-10 06:34:20,884 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 17 remaining) [2025-01-10 06:34:20,884 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 17 remaining) [2025-01-10 06:34:20,884 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 17 remaining) [2025-01-10 06:34:20,884 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 17 remaining) [2025-01-10 06:34:20,884 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 17 remaining) [2025-01-10 06:34:20,884 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 17 remaining) [2025-01-10 06:34:20,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-10 06:34:20,884 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-01-10 06:34:20,887 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-10 06:34:20,887 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-01-10 06:34:20,911 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-10 06:34:20,913 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 78 places, 77 transitions, 182 flow [2025-01-10 06:34:20,919 INFO L124 PetriNetUnfolderBase]: 8/88 cut-off events. [2025-01-10 06:34:20,919 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-01-10 06:34:20,919 INFO L83 FinitePrefix]: Finished finitePrefix Result has 107 conditions, 88 events. 8/88 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 252 event pairs, 0 based on Foata normal form. 0/59 useless extension candidates. Maximal degree in co-relation 79. Up to 5 conditions per place. [2025-01-10 06:34:20,920 INFO L82 GeneralOperation]: Start removeDead. Operand has 78 places, 77 transitions, 182 flow [2025-01-10 06:34:20,922 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 78 places, 77 transitions, 182 flow [2025-01-10 06:34:20,923 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 06:34:20,924 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;@32fdc0a7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 06:34:20,924 INFO L334 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2025-01-10 06:34:20,926 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 06:34:20,926 INFO L124 PetriNetUnfolderBase]: 0/9 cut-off events. [2025-01-10 06:34:20,926 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-10 06:34:20,926 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:34:20,926 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-01-10 06:34:20,926 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-01-10 06:34:20,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:34:20,927 INFO L85 PathProgramCache]: Analyzing trace with hash 398707708, now seen corresponding path program 1 times [2025-01-10 06:34:20,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:34:20,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075616733] [2025-01-10 06:34:20,927 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:34:20,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:34:20,930 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 06:34:20,932 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 06:34:20,932 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:34:20,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:34:20,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:34:20,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:34:20,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075616733] [2025-01-10 06:34:20,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075616733] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:34:20,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:34:20,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:34:20,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513200805] [2025-01-10 06:34:20,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:34:20,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:34:20,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:34:20,963 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:34:20,963 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:34:20,969 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 77 [2025-01-10 06:34:20,969 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 77 transitions, 182 flow. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:34:20,969 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:34:20,969 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 77 [2025-01-10 06:34:20,969 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:34:25,036 INFO L124 PetriNetUnfolderBase]: 56332/84118 cut-off events. [2025-01-10 06:34:25,036 INFO L125 PetriNetUnfolderBase]: For 6419/6419 co-relation queries the response was YES. [2025-01-10 06:34:25,215 INFO L83 FinitePrefix]: Finished finitePrefix Result has 159450 conditions, 84118 events. 56332/84118 cut-off events. For 6419/6419 co-relation queries the response was YES. Maximal size of possible extension queue 3710. Compared 672118 event pairs, 31380 based on Foata normal form. 7398/87068 useless extension candidates. Maximal degree in co-relation 92390. Up to 57853 conditions per place. [2025-01-10 06:34:25,642 INFO L140 encePairwiseOnDemand]: 69/77 looper letters, 67 selfloop transitions, 2 changer transitions 0/100 dead transitions. [2025-01-10 06:34:25,642 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 100 transitions, 387 flow [2025-01-10 06:34:25,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:34:25,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 06:34:25,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 172 transitions. [2025-01-10 06:34:25,644 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7445887445887446 [2025-01-10 06:34:25,644 INFO L175 Difference]: Start difference. First operand has 78 places, 77 transitions, 182 flow. Second operand 3 states and 172 transitions. [2025-01-10 06:34:25,644 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 100 transitions, 387 flow [2025-01-10 06:34:25,647 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 100 transitions, 375 flow, removed 6 selfloop flow, removed 0 redundant places. [2025-01-10 06:34:25,648 INFO L231 Difference]: Finished difference. Result has 78 places, 71 transitions, 168 flow [2025-01-10 06:34:25,648 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=168, PETRI_PLACES=78, PETRI_TRANSITIONS=71} [2025-01-10 06:34:25,648 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 0 predicate places. [2025-01-10 06:34:25,648 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 71 transitions, 168 flow [2025-01-10 06:34:25,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:34:25,649 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:34:25,649 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-01-10 06:34:25,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-10 06:34:25,649 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-01-10 06:34:25,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:34:25,649 INFO L85 PathProgramCache]: Analyzing trace with hash -524962473, now seen corresponding path program 1 times [2025-01-10 06:34:25,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:34:25,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6696905] [2025-01-10 06:34:25,649 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:34:25,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:34:25,655 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 06:34:25,658 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 06:34:25,658 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:34:25,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:34:25,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:34:25,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:34:25,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6696905] [2025-01-10 06:34:25,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6696905] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:34:25,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:34:25,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:34:25,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100423155] [2025-01-10 06:34:25,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:34:25,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:34:25,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:34:25,691 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:34:25,692 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:34:25,699 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 77 [2025-01-10 06:34:25,699 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 71 transitions, 168 flow. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:34:25,699 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:34:25,699 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 77 [2025-01-10 06:34:25,699 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:34:29,524 INFO L124 PetriNetUnfolderBase]: 50073/74907 cut-off events. [2025-01-10 06:34:29,524 INFO L125 PetriNetUnfolderBase]: For 5479/5479 co-relation queries the response was YES. [2025-01-10 06:34:29,706 INFO L83 FinitePrefix]: Finished finitePrefix Result has 144293 conditions, 74907 events. 50073/74907 cut-off events. For 5479/5479 co-relation queries the response was YES. Maximal size of possible extension queue 3292. Compared 589841 event pairs, 27618 based on Foata normal form. 1755/72634 useless extension candidates. Maximal degree in co-relation 143597. Up to 49839 conditions per place. [2025-01-10 06:34:30,041 INFO L140 encePairwiseOnDemand]: 74/77 looper letters, 66 selfloop transitions, 2 changer transitions 0/99 dead transitions. [2025-01-10 06:34:30,041 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 99 transitions, 375 flow [2025-01-10 06:34:30,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:34:30,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 06:34:30,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 162 transitions. [2025-01-10 06:34:30,042 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7012987012987013 [2025-01-10 06:34:30,042 INFO L175 Difference]: Start difference. First operand has 78 places, 71 transitions, 168 flow. Second operand 3 states and 162 transitions. [2025-01-10 06:34:30,042 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 99 transitions, 375 flow [2025-01-10 06:34:30,046 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 99 transitions, 371 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 06:34:30,047 INFO L231 Difference]: Finished difference. Result has 77 places, 70 transitions, 166 flow [2025-01-10 06:34:30,047 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=166, PETRI_PLACES=77, PETRI_TRANSITIONS=70} [2025-01-10 06:34:30,047 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, -1 predicate places. [2025-01-10 06:34:30,047 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 70 transitions, 166 flow [2025-01-10 06:34:30,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:34:30,048 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:34:30,048 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-01-10 06:34:30,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-10 06:34:30,048 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-01-10 06:34:30,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:34:30,048 INFO L85 PathProgramCache]: Analyzing trace with hash -2025533347, now seen corresponding path program 1 times [2025-01-10 06:34:30,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:34:30,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248267298] [2025-01-10 06:34:30,048 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:34:30,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:34:30,054 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 06:34:30,056 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 06:34:30,056 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:34:30,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:34:30,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:34:30,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:34:30,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248267298] [2025-01-10 06:34:30,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248267298] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:34:30,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:34:30,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:34:30,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242802286] [2025-01-10 06:34:30,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:34:30,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:34:30,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:34:30,092 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:34:30,092 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:34:30,103 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 77 [2025-01-10 06:34:30,103 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 70 transitions, 166 flow. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:34:30,104 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:34:30,104 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 77 [2025-01-10 06:34:30,104 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:34:34,572 INFO L124 PetriNetUnfolderBase]: 56329/85963 cut-off events. [2025-01-10 06:34:34,573 INFO L125 PetriNetUnfolderBase]: For 6269/6269 co-relation queries the response was YES. [2025-01-10 06:34:34,921 INFO L83 FinitePrefix]: Finished finitePrefix Result has 164011 conditions, 85963 events. 56329/85963 cut-off events. For 6269/6269 co-relation queries the response was YES. Maximal size of possible extension queue 3501. Compared 728099 event pairs, 9528 based on Foata normal form. 1752/84258 useless extension candidates. Maximal degree in co-relation 119988. Up to 57808 conditions per place. [2025-01-10 06:34:35,206 INFO L140 encePairwiseOnDemand]: 74/77 looper letters, 66 selfloop transitions, 2 changer transitions 0/97 dead transitions. [2025-01-10 06:34:35,206 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 97 transitions, 370 flow [2025-01-10 06:34:35,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:34:35,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 06:34:35,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 162 transitions. [2025-01-10 06:34:35,209 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7012987012987013 [2025-01-10 06:34:35,209 INFO L175 Difference]: Start difference. First operand has 77 places, 70 transitions, 166 flow. Second operand 3 states and 162 transitions. [2025-01-10 06:34:35,209 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 97 transitions, 370 flow [2025-01-10 06:34:35,213 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 97 transitions, 362 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 06:34:35,213 INFO L231 Difference]: Finished difference. Result has 76 places, 69 transitions, 164 flow [2025-01-10 06:34:35,214 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=164, PETRI_PLACES=76, PETRI_TRANSITIONS=69} [2025-01-10 06:34:35,214 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, -2 predicate places. [2025-01-10 06:34:35,214 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 69 transitions, 164 flow [2025-01-10 06:34:35,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:34:35,214 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:34:35,214 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:34:35,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-10 06:34:35,214 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-01-10 06:34:35,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:34:35,215 INFO L85 PathProgramCache]: Analyzing trace with hash 1632976167, now seen corresponding path program 1 times [2025-01-10 06:34:35,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:34:35,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310984648] [2025-01-10 06:34:35,215 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:34:35,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:34:35,219 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 06:34:35,222 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 06:34:35,222 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:34:35,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:34:35,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:34:35,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:34:35,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310984648] [2025-01-10 06:34:35,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310984648] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:34:35,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:34:35,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:34:35,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971901195] [2025-01-10 06:34:35,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:34:35,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:34:35,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:34:35,253 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:34:35,254 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:34:35,260 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 77 [2025-01-10 06:34:35,260 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 69 transitions, 164 flow. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:34:35,260 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:34:35,261 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 77 [2025-01-10 06:34:35,261 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:34:39,300 INFO L124 PetriNetUnfolderBase]: 50073/77955 cut-off events. [2025-01-10 06:34:39,300 INFO L125 PetriNetUnfolderBase]: For 5606/5606 co-relation queries the response was YES. [2025-01-10 06:34:39,463 INFO L83 FinitePrefix]: Finished finitePrefix Result has 147335 conditions, 77955 events. 50073/77955 cut-off events. For 5606/5606 co-relation queries the response was YES. Maximal size of possible extension queue 3188. Compared 671337 event pairs, 9528 based on Foata normal form. 1752/76364 useless extension candidates. Maximal degree in co-relation 91960. Up to 49800 conditions per place. [2025-01-10 06:34:39,731 INFO L140 encePairwiseOnDemand]: 74/77 looper letters, 65 selfloop transitions, 2 changer transitions 0/96 dead transitions. [2025-01-10 06:34:39,732 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 96 transitions, 362 flow [2025-01-10 06:34:39,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:34:39,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 06:34:39,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 161 transitions. [2025-01-10 06:34:39,736 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.696969696969697 [2025-01-10 06:34:39,736 INFO L175 Difference]: Start difference. First operand has 76 places, 69 transitions, 164 flow. Second operand 3 states and 161 transitions. [2025-01-10 06:34:39,736 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 96 transitions, 362 flow [2025-01-10 06:34:39,743 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 96 transitions, 358 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 06:34:39,744 INFO L231 Difference]: Finished difference. Result has 75 places, 68 transitions, 162 flow [2025-01-10 06:34:39,744 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=162, PETRI_PLACES=75, PETRI_TRANSITIONS=68} [2025-01-10 06:34:39,745 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, -3 predicate places. [2025-01-10 06:34:39,745 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 68 transitions, 162 flow [2025-01-10 06:34:39,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:34:39,745 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:34:39,745 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1] [2025-01-10 06:34:39,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-10 06:34:39,745 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-01-10 06:34:39,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:34:39,746 INFO L85 PathProgramCache]: Analyzing trace with hash 1563039709, now seen corresponding path program 1 times [2025-01-10 06:34:39,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:34:39,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380317072] [2025-01-10 06:34:39,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:34:39,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:34:39,750 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 06:34:39,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 06:34:39,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:34:39,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:34:39,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:34:39,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:34:39,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380317072] [2025-01-10 06:34:39,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380317072] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:34:39,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:34:39,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:34:39,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53008675] [2025-01-10 06:34:39,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:34:39,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:34:39,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:34:39,774 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:34:39,774 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:34:39,779 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 77 [2025-01-10 06:34:39,780 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 68 transitions, 162 flow. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:34:39,780 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:34:39,780 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 77 [2025-01-10 06:34:39,780 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:34:44,361 INFO L124 PetriNetUnfolderBase]: 56281/86072 cut-off events. [2025-01-10 06:34:44,361 INFO L125 PetriNetUnfolderBase]: For 6306/6306 co-relation queries the response was YES. [2025-01-10 06:34:44,509 INFO L83 FinitePrefix]: Finished finitePrefix Result has 164012 conditions, 86072 events. 56281/86072 cut-off events. For 6306/6306 co-relation queries the response was YES. Maximal size of possible extension queue 3480. Compared 726565 event pairs, 9798 based on Foata normal form. 1728/84331 useless extension candidates. Maximal degree in co-relation 102399. Up to 57280 conditions per place. [2025-01-10 06:34:44,829 INFO L140 encePairwiseOnDemand]: 74/77 looper letters, 65 selfloop transitions, 2 changer transitions 0/94 dead transitions. [2025-01-10 06:34:44,829 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 94 transitions, 357 flow [2025-01-10 06:34:44,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:34:44,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 06:34:44,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 161 transitions. [2025-01-10 06:34:44,830 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.696969696969697 [2025-01-10 06:34:44,830 INFO L175 Difference]: Start difference. First operand has 75 places, 68 transitions, 162 flow. Second operand 3 states and 161 transitions. [2025-01-10 06:34:44,830 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 94 transitions, 357 flow [2025-01-10 06:34:44,836 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 94 transitions, 349 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 06:34:44,837 INFO L231 Difference]: Finished difference. Result has 74 places, 67 transitions, 160 flow [2025-01-10 06:34:44,837 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=160, PETRI_PLACES=74, PETRI_TRANSITIONS=67} [2025-01-10 06:34:44,838 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, -4 predicate places. [2025-01-10 06:34:44,838 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 67 transitions, 160 flow [2025-01-10 06:34:44,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:34:44,838 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:34:44,838 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:34:44,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-10 06:34:44,839 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-01-10 06:34:44,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:34:44,839 INFO L85 PathProgramCache]: Analyzing trace with hash 1209591156, now seen corresponding path program 1 times [2025-01-10 06:34:44,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:34:44,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722577337] [2025-01-10 06:34:44,839 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:34:44,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:34:44,845 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 06:34:44,847 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 06:34:44,847 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:34:44,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:34:44,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:34:44,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:34:44,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722577337] [2025-01-10 06:34:44,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722577337] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:34:44,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:34:44,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:34:44,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480991253] [2025-01-10 06:34:44,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:34:44,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:34:44,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:34:44,887 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:34:44,887 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:34:44,893 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 77 [2025-01-10 06:34:44,894 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 67 transitions, 160 flow. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:34:44,894 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:34:44,894 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 77 [2025-01-10 06:34:44,894 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand