./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/weaver/chl-time-symm.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/chl-time-symm.wvr.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash afd4dff22cd4af07bd40593cdae3d07b68e9e49be619064a67ffd75ffa5bf4b2 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 14:09:26,192 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 14:09:26,246 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-02-08 14:09:26,252 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 14:09:26,255 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 14:09:26,281 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 14:09:26,281 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 14:09:26,282 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 14:09:26,282 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 14:09:26,282 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 14:09:26,282 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 14:09:26,283 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 14:09:26,283 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 14:09:26,283 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 14:09:26,284 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 14:09:26,284 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 14:09:26,284 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 14:09:26,284 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 14:09:26,284 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 14:09:26,284 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 14:09:26,284 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 14:09:26,284 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 14:09:26,284 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 14:09:26,284 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 14:09:26,284 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-08 14:09:26,285 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 14:09:26,285 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 14:09:26,285 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 14:09:26,285 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 14:09:26,285 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 14:09:26,285 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 14:09:26,285 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 14:09:26,285 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 14:09:26,286 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 14:09:26,286 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 14:09:26,286 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 14:09:26,286 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 14:09:26,286 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 14:09:26,286 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 14:09:26,287 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 14:09:26,287 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 14:09:26,287 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 14:09:26,287 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 14:09:26,287 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 14:09:26,287 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 14:09:26,287 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 -> afd4dff22cd4af07bd40593cdae3d07b68e9e49be619064a67ffd75ffa5bf4b2 [2025-02-08 14:09:26,547 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 14:09:26,560 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 14:09:26,566 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 14:09:26,567 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 14:09:26,567 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 14:09:26,568 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-time-symm.wvr.c [2025-02-08 14:09:27,902 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3c1b895cb/28f7330a45324eafa62fde494be0706e/FLAG0e630aa52 [2025-02-08 14:09:28,135 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 14:09:28,136 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/chl-time-symm.wvr.c [2025-02-08 14:09:28,145 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3c1b895cb/28f7330a45324eafa62fde494be0706e/FLAG0e630aa52 [2025-02-08 14:09:28,170 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3c1b895cb/28f7330a45324eafa62fde494be0706e [2025-02-08 14:09:28,176 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 14:09:28,177 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 14:09:28,178 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 14:09:28,178 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 14:09:28,186 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 14:09:28,186 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 02:09:28" (1/1) ... [2025-02-08 14:09:28,190 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14f920af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:09:28, skipping insertion in model container [2025-02-08 14:09:28,191 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 02:09:28" (1/1) ... [2025-02-08 14:09:28,200 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 14:09:28,321 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 14:09:28,327 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 14:09:28,346 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 14:09:28,358 INFO L204 MainTranslator]: Completed translation [2025-02-08 14:09:28,359 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:09:28 WrapperNode [2025-02-08 14:09:28,359 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 14:09:28,360 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 14:09:28,360 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 14:09:28,360 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 14:09:28,364 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:09:28" (1/1) ... [2025-02-08 14:09:28,370 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:09:28" (1/1) ... [2025-02-08 14:09:28,389 INFO L138 Inliner]: procedures = 21, calls = 20, calls flagged for inlining = 10, calls inlined = 16, statements flattened = 203 [2025-02-08 14:09:28,392 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 14:09:28,392 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 14:09:28,393 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 14:09:28,393 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 14:09:28,399 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:09:28" (1/1) ... [2025-02-08 14:09:28,399 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:09:28" (1/1) ... [2025-02-08 14:09:28,401 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:09:28" (1/1) ... [2025-02-08 14:09:28,417 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-08 14:09:28,420 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:09:28" (1/1) ... [2025-02-08 14:09:28,420 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:09:28" (1/1) ... [2025-02-08 14:09:28,423 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:09:28" (1/1) ... [2025-02-08 14:09:28,424 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:09:28" (1/1) ... [2025-02-08 14:09:28,424 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:09:28" (1/1) ... [2025-02-08 14:09:28,425 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:09:28" (1/1) ... [2025-02-08 14:09:28,426 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 14:09:28,427 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 14:09:28,427 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 14:09:28,427 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 14:09:28,427 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:09:28" (1/1) ... [2025-02-08 14:09:28,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 14:09:28,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:09:28,451 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-02-08 14:09:28,456 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-02-08 14:09:28,491 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 14:09:28,492 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-08 14:09:28,492 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-08 14:09:28,492 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-08 14:09:28,492 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-08 14:09:28,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 14:09:28,492 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-02-08 14:09:28,492 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-02-08 14:09:28,492 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 14:09:28,492 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 14:09:28,493 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-08 14:09:28,557 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 14:09:28,558 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 14:09:28,678 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L46-3: #t~ite3#1 := #t~ret2#1; [2025-02-08 14:09:28,679 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L46-4: assume { :end_inline_minus } true;assume -2147483648 <= #t~ret2#1 && #t~ret2#1 <= 2147483647; [2025-02-08 14:09:28,679 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L46-5: havoc minus_#in~a#1, minus_#in~b#1; [2025-02-08 14:09:28,679 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L46-6: havoc minus_#t~short17#1, minus_#t~short18#1, minus_~a#1, minus_~b#1; [2025-02-08 14:09:28,679 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L46-7: #t~ret2#1 := minus_#res#1; [2025-02-08 14:09:28,773 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L55-3: #t~ite6#1 := #t~ret5#1; [2025-02-08 14:09:28,776 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L55-4: assume { :end_inline_minus } true;assume -2147483648 <= #t~ret5#1 && #t~ret5#1 <= 2147483647; [2025-02-08 14:09:28,776 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L55-5: havoc minus_#in~a#1, minus_#in~b#1; [2025-02-08 14:09:28,776 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L55-6: havoc minus_#t~short17#1, minus_#t~short18#1, minus_~a#1, minus_~b#1; [2025-02-08 14:09:28,776 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L55-7: #t~ret5#1 := minus_#res#1; [2025-02-08 14:09:28,846 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 14:09:28,846 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 14:09:29,240 WARN L149 AtomicBlockAnalyzer]: Unexpected successor node of atomic block begin: L88 is not an error location. [2025-02-08 14:09:29,241 WARN L149 AtomicBlockAnalyzer]: Unexpected successor node of atomic block begin: L88 is not an error location. [2025-02-08 14:09:29,242 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 14:09:29,243 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 14:09:29,243 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 02:09:29 BoogieIcfgContainer [2025-02-08 14:09:29,243 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 14:09:29,245 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 14:09:29,246 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 14:09:29,250 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 14:09:29,250 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 02:09:28" (1/3) ... [2025-02-08 14:09:29,251 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1805db44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 02:09:29, skipping insertion in model container [2025-02-08 14:09:29,251 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:09:28" (2/3) ... [2025-02-08 14:09:29,251 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1805db44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 02:09:29, skipping insertion in model container [2025-02-08 14:09:29,251 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 02:09:29" (3/3) ... [2025-02-08 14:09:29,252 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-time-symm.wvr.c [2025-02-08 14:09:29,266 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 14:09:29,269 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-time-symm.wvr.c that has 3 procedures, 46 locations, 1 initial locations, 0 loop locations, and 26 error locations. [2025-02-08 14:09:29,269 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 14:09:29,446 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-02-08 14:09:29,470 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 45 transitions, 104 flow [2025-02-08 14:09:29,504 INFO L124 PetriNetUnfolderBase]: 0/43 cut-off events. [2025-02-08 14:09:29,506 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-08 14:09:29,508 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52 conditions, 43 events. 0/43 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 164 event pairs, 0 based on Foata normal form. 0/15 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2025-02-08 14:09:29,508 INFO L82 GeneralOperation]: Start removeDead. Operand has 52 places, 45 transitions, 104 flow [2025-02-08 14:09:29,512 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 49 places, 42 transitions, 96 flow [2025-02-08 14:09:29,520 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 14:09:29,528 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;@547d08b9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 14:09:29,528 INFO L334 AbstractCegarLoop]: Starting to check reachability of 52 error locations. [2025-02-08 14:09:29,531 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 14:09:29,531 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events. [2025-02-08 14:09:29,531 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 14:09:29,531 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:09:29,531 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-02-08 14:09:29,532 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err10ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 49 more)] === [2025-02-08 14:09:29,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:09:29,535 INFO L85 PathProgramCache]: Analyzing trace with hash 20434491, now seen corresponding path program 1 times [2025-02-08 14:09:29,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:09:29,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547863849] [2025-02-08 14:09:29,541 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:09:29,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:09:29,589 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 14:09:29,598 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 14:09:29,598 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:09:29,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:09:29,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:09:29,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:09:29,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547863849] [2025-02-08 14:09:29,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547863849] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:09:29,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:09:29,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 14:09:29,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126473042] [2025-02-08 14:09:29,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:09:29,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-08 14:09:29,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:09:29,836 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-08 14:09:29,836 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 14:09:29,837 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 45 [2025-02-08 14:09:29,839 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 42 transitions, 96 flow. Second operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 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-02-08 14:09:29,839 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:09:29,839 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 45 [2025-02-08 14:09:29,840 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:09:30,092 INFO L124 PetriNetUnfolderBase]: 418/757 cut-off events. [2025-02-08 14:09:30,092 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-02-08 14:09:30,094 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1544 conditions, 757 events. 418/757 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 222. Compared 5240 event pairs, 418 based on Foata normal form. 2/288 useless extension candidates. Maximal degree in co-relation 1472. Up to 745 conditions per place. [2025-02-08 14:09:30,099 INFO L140 encePairwiseOnDemand]: 35/45 looper letters, 28 selfloop transitions, 0 changer transitions 2/32 dead transitions. [2025-02-08 14:09:30,099 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 32 transitions, 134 flow [2025-02-08 14:09:30,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-08 14:09:30,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-02-08 14:09:30,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 49 transitions. [2025-02-08 14:09:30,111 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5444444444444444 [2025-02-08 14:09:30,112 INFO L175 Difference]: Start difference. First operand has 49 places, 42 transitions, 96 flow. Second operand 2 states and 49 transitions. [2025-02-08 14:09:30,113 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 32 transitions, 134 flow [2025-02-08 14:09:30,116 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 32 transitions, 126 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-02-08 14:09:30,123 INFO L231 Difference]: Finished difference. Result has 36 places, 30 transitions, 63 flow [2025-02-08 14:09:30,124 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=63, PETRI_PLACES=36, PETRI_TRANSITIONS=30} [2025-02-08 14:09:30,130 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, -13 predicate places. [2025-02-08 14:09:30,131 INFO L471 AbstractCegarLoop]: Abstraction has has 36 places, 30 transitions, 63 flow [2025-02-08 14:09:30,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 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-02-08 14:09:30,131 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:09:30,131 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-02-08 14:09:30,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 14:09:30,131 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thread1Err10ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err10ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 49 more)] === [2025-02-08 14:09:30,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:09:30,132 INFO L85 PathProgramCache]: Analyzing trace with hash 20434492, now seen corresponding path program 1 times [2025-02-08 14:09:30,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:09:30,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465977988] [2025-02-08 14:09:30,132 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:09:30,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:09:30,141 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 14:09:30,151 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 14:09:30,154 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:09:30,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:09:30,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:09:30,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:09:30,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465977988] [2025-02-08 14:09:30,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465977988] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:09:30,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:09:30,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 14:09:30,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395109980] [2025-02-08 14:09:30,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:09:30,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 14:09:30,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:09:30,229 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 14:09:30,229 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 14:09:30,229 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 45 [2025-02-08 14:09:30,229 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 30 transitions, 63 flow. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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-02-08 14:09:30,229 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:09:30,229 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 45 [2025-02-08 14:09:30,229 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:09:30,380 INFO L124 PetriNetUnfolderBase]: 350/637 cut-off events. [2025-02-08 14:09:30,380 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 14:09:30,381 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1278 conditions, 637 events. 350/637 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 182. Compared 4282 event pairs, 350 based on Foata normal form. 0/250 useless extension candidates. Maximal degree in co-relation 1275. Up to 626 conditions per place. [2025-02-08 14:09:30,384 INFO L140 encePairwiseOnDemand]: 42/45 looper letters, 25 selfloop transitions, 1 changer transitions 0/28 dead transitions. [2025-02-08 14:09:30,384 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 28 transitions, 111 flow [2025-02-08 14:09:30,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 14:09:30,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 14:09:30,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 43 transitions. [2025-02-08 14:09:30,386 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.31851851851851853 [2025-02-08 14:09:30,386 INFO L175 Difference]: Start difference. First operand has 36 places, 30 transitions, 63 flow. Second operand 3 states and 43 transitions. [2025-02-08 14:09:30,386 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 28 transitions, 111 flow [2025-02-08 14:09:30,386 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 28 transitions, 111 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 14:09:30,387 INFO L231 Difference]: Finished difference. Result has 34 places, 28 transitions, 61 flow [2025-02-08 14:09:30,387 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=59, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=61, PETRI_PLACES=34, PETRI_TRANSITIONS=28} [2025-02-08 14:09:30,388 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, -15 predicate places. [2025-02-08 14:09:30,388 INFO L471 AbstractCegarLoop]: Abstraction has has 34 places, 28 transitions, 61 flow [2025-02-08 14:09:30,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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-02-08 14:09:30,388 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:09:30,388 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-02-08 14:09:30,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 14:09:30,388 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err10ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 49 more)] === [2025-02-08 14:09:30,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:09:30,389 INFO L85 PathProgramCache]: Analyzing trace with hash 20434493, now seen corresponding path program 1 times [2025-02-08 14:09:30,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:09:30,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751953317] [2025-02-08 14:09:30,389 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:09:30,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:09:30,396 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 14:09:30,404 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 14:09:30,405 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:09:30,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:09:30,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:09:30,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:09:30,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751953317] [2025-02-08 14:09:30,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751953317] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:09:30,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:09:30,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 14:09:30,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147319750] [2025-02-08 14:09:30,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:09:30,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 14:09:30,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:09:30,448 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 14:09:30,448 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 14:09:30,448 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 45 [2025-02-08 14:09:30,449 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 28 transitions, 61 flow. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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-02-08 14:09:30,449 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:09:30,449 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 45 [2025-02-08 14:09:30,449 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:09:30,644 INFO L124 PetriNetUnfolderBase]: 288/529 cut-off events. [2025-02-08 14:09:30,644 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 14:09:30,645 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1064 conditions, 529 events. 288/529 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 3425 event pairs, 288 based on Foata normal form. 0/218 useless extension candidates. Maximal degree in co-relation 1060. Up to 519 conditions per place. [2025-02-08 14:09:30,647 INFO L140 encePairwiseOnDemand]: 42/45 looper letters, 23 selfloop transitions, 1 changer transitions 0/26 dead transitions. [2025-02-08 14:09:30,647 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 26 transitions, 105 flow [2025-02-08 14:09:30,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 14:09:30,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 14:09:30,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 41 transitions. [2025-02-08 14:09:30,648 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3037037037037037 [2025-02-08 14:09:30,648 INFO L175 Difference]: Start difference. First operand has 34 places, 28 transitions, 61 flow. Second operand 3 states and 41 transitions. [2025-02-08 14:09:30,648 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 26 transitions, 105 flow [2025-02-08 14:09:30,648 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 26 transitions, 104 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 14:09:30,649 INFO L231 Difference]: Finished difference. Result has 33 places, 26 transitions, 58 flow [2025-02-08 14:09:30,649 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=58, PETRI_PLACES=33, PETRI_TRANSITIONS=26} [2025-02-08 14:09:30,649 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, -16 predicate places. [2025-02-08 14:09:30,649 INFO L471 AbstractCegarLoop]: Abstraction has has 33 places, 26 transitions, 58 flow [2025-02-08 14:09:30,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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-02-08 14:09:30,650 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:09:30,650 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-02-08 14:09:30,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 14:09:30,650 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err10ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 49 more)] === [2025-02-08 14:09:30,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:09:30,650 INFO L85 PathProgramCache]: Analyzing trace with hash 20434495, now seen corresponding path program 1 times [2025-02-08 14:09:30,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:09:30,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643877654] [2025-02-08 14:09:30,650 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:09:30,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:09:30,657 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 14:09:30,668 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 14:09:30,669 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:09:30,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:09:30,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:09:30,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:09:30,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643877654] [2025-02-08 14:09:30,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [643877654] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:09:30,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:09:30,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 14:09:30,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384251415] [2025-02-08 14:09:30,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:09:30,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 14:09:30,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:09:30,804 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 14:09:30,804 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 14:09:30,804 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 45 [2025-02-08 14:09:30,804 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 26 transitions, 58 flow. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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-02-08 14:09:30,804 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:09:30,804 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 45 [2025-02-08 14:09:30,805 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:09:30,915 INFO L124 PetriNetUnfolderBase]: 232/431 cut-off events. [2025-02-08 14:09:30,915 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 14:09:30,916 INFO L83 FinitePrefix]: Finished finitePrefix Result has 869 conditions, 431 events. 232/431 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 2663 event pairs, 232 based on Foata normal form. 0/188 useless extension candidates. Maximal degree in co-relation 865. Up to 422 conditions per place. [2025-02-08 14:09:30,918 INFO L140 encePairwiseOnDemand]: 42/45 looper letters, 21 selfloop transitions, 1 changer transitions 0/24 dead transitions. [2025-02-08 14:09:30,918 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 24 transitions, 98 flow [2025-02-08 14:09:30,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 14:09:30,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 14:09:30,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 39 transitions. [2025-02-08 14:09:30,919 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.28888888888888886 [2025-02-08 14:09:30,919 INFO L175 Difference]: Start difference. First operand has 33 places, 26 transitions, 58 flow. Second operand 3 states and 39 transitions. [2025-02-08 14:09:30,919 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 24 transitions, 98 flow [2025-02-08 14:09:30,919 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 24 transitions, 97 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 14:09:30,920 INFO L231 Difference]: Finished difference. Result has 32 places, 24 transitions, 55 flow [2025-02-08 14:09:30,920 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=53, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=55, PETRI_PLACES=32, PETRI_TRANSITIONS=24} [2025-02-08 14:09:30,921 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, -17 predicate places. [2025-02-08 14:09:30,921 INFO L471 AbstractCegarLoop]: Abstraction has has 32 places, 24 transitions, 55 flow [2025-02-08 14:09:30,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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-02-08 14:09:30,922 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:09:30,922 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-02-08 14:09:30,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 14:09:30,922 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err10ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 49 more)] === [2025-02-08 14:09:30,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:09:30,923 INFO L85 PathProgramCache]: Analyzing trace with hash 20434496, now seen corresponding path program 1 times [2025-02-08 14:09:30,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:09:30,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031050003] [2025-02-08 14:09:30,923 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:09:30,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:09:30,929 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 14:09:30,935 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 14:09:30,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:09:30,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:09:31,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:09:31,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:09:31,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031050003] [2025-02-08 14:09:31,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031050003] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:09:31,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:09:31,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 14:09:31,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438982906] [2025-02-08 14:09:31,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:09:31,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 14:09:31,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:09:31,007 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 14:09:31,008 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 14:09:31,008 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 45 [2025-02-08 14:09:31,008 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 24 transitions, 55 flow. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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-02-08 14:09:31,011 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:09:31,011 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 45 [2025-02-08 14:09:31,011 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:09:31,086 INFO L124 PetriNetUnfolderBase]: 182/343 cut-off events. [2025-02-08 14:09:31,086 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 14:09:31,087 INFO L83 FinitePrefix]: Finished finitePrefix Result has 694 conditions, 343 events. 182/343 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 2046 event pairs, 182 based on Foata normal form. 0/160 useless extension candidates. Maximal degree in co-relation 690. Up to 335 conditions per place. [2025-02-08 14:09:31,088 INFO L140 encePairwiseOnDemand]: 42/45 looper letters, 19 selfloop transitions, 1 changer transitions 0/22 dead transitions. [2025-02-08 14:09:31,089 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 22 transitions, 91 flow [2025-02-08 14:09:31,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 14:09:31,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 14:09:31,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 37 transitions. [2025-02-08 14:09:31,090 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2740740740740741 [2025-02-08 14:09:31,090 INFO L175 Difference]: Start difference. First operand has 32 places, 24 transitions, 55 flow. Second operand 3 states and 37 transitions. [2025-02-08 14:09:31,090 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 22 transitions, 91 flow [2025-02-08 14:09:31,090 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 22 transitions, 90 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 14:09:31,090 INFO L231 Difference]: Finished difference. Result has 31 places, 22 transitions, 52 flow [2025-02-08 14:09:31,090 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=52, PETRI_PLACES=31, PETRI_TRANSITIONS=22} [2025-02-08 14:09:31,091 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, -18 predicate places. [2025-02-08 14:09:31,091 INFO L471 AbstractCegarLoop]: Abstraction has has 31 places, 22 transitions, 52 flow [2025-02-08 14:09:31,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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-02-08 14:09:31,091 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:09:31,091 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-02-08 14:09:31,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 14:09:31,091 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err10ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 49 more)] === [2025-02-08 14:09:31,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:09:31,092 INFO L85 PathProgramCache]: Analyzing trace with hash 20434499, now seen corresponding path program 1 times [2025-02-08 14:09:31,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:09:31,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532572118] [2025-02-08 14:09:31,092 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:09:31,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:09:31,099 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 14:09:31,103 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 14:09:31,103 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:09:31,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:09:31,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:09:31,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:09:31,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532572118] [2025-02-08 14:09:31,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532572118] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:09:31,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:09:31,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 14:09:31,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273539469] [2025-02-08 14:09:31,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:09:31,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 14:09:31,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:09:31,133 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 14:09:31,133 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 14:09:31,134 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 45 [2025-02-08 14:09:31,134 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 22 transitions, 52 flow. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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-02-08 14:09:31,134 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:09:31,134 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 45 [2025-02-08 14:09:31,134 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:09:31,194 INFO L124 PetriNetUnfolderBase]: 138/265 cut-off events. [2025-02-08 14:09:31,194 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 14:09:31,195 INFO L83 FinitePrefix]: Finished finitePrefix Result has 539 conditions, 265 events. 138/265 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 1479 event pairs, 138 based on Foata normal form. 0/134 useless extension candidates. Maximal degree in co-relation 535. Up to 258 conditions per place. [2025-02-08 14:09:31,196 INFO L140 encePairwiseOnDemand]: 42/45 looper letters, 17 selfloop transitions, 1 changer transitions 0/20 dead transitions. [2025-02-08 14:09:31,196 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 20 transitions, 84 flow [2025-02-08 14:09:31,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 14:09:31,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 14:09:31,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 35 transitions. [2025-02-08 14:09:31,198 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.25925925925925924 [2025-02-08 14:09:31,198 INFO L175 Difference]: Start difference. First operand has 31 places, 22 transitions, 52 flow. Second operand 3 states and 35 transitions. [2025-02-08 14:09:31,198 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 20 transitions, 84 flow [2025-02-08 14:09:31,199 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 20 transitions, 83 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 14:09:31,199 INFO L231 Difference]: Finished difference. Result has 30 places, 20 transitions, 49 flow [2025-02-08 14:09:31,199 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=47, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=49, PETRI_PLACES=30, PETRI_TRANSITIONS=20} [2025-02-08 14:09:31,200 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, -19 predicate places. [2025-02-08 14:09:31,200 INFO L471 AbstractCegarLoop]: Abstraction has has 30 places, 20 transitions, 49 flow [2025-02-08 14:09:31,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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-02-08 14:09:31,201 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:09:31,201 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-02-08 14:09:31,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 14:09:31,201 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err10ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 49 more)] === [2025-02-08 14:09:31,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:09:31,202 INFO L85 PathProgramCache]: Analyzing trace with hash 20434500, now seen corresponding path program 1 times [2025-02-08 14:09:31,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:09:31,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109748408] [2025-02-08 14:09:31,202 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:09:31,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:09:31,207 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 14:09:31,213 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 14:09:31,217 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:09:31,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:09:31,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:09:31,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:09:31,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109748408] [2025-02-08 14:09:31,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109748408] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:09:31,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:09:31,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 14:09:31,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294621300] [2025-02-08 14:09:31,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:09:31,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 14:09:31,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:09:31,276 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 14:09:31,276 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 14:09:31,276 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 45 [2025-02-08 14:09:31,276 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 20 transitions, 49 flow. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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-02-08 14:09:31,276 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:09:31,276 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 45 [2025-02-08 14:09:31,276 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:09:31,328 INFO L124 PetriNetUnfolderBase]: 100/197 cut-off events. [2025-02-08 14:09:31,328 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 14:09:31,330 INFO L83 FinitePrefix]: Finished finitePrefix Result has 404 conditions, 197 events. 100/197 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 1011 event pairs, 100 based on Foata normal form. 0/110 useless extension candidates. Maximal degree in co-relation 400. Up to 191 conditions per place. [2025-02-08 14:09:31,331 INFO L140 encePairwiseOnDemand]: 42/45 looper letters, 15 selfloop transitions, 1 changer transitions 0/18 dead transitions. [2025-02-08 14:09:31,331 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 18 transitions, 77 flow [2025-02-08 14:09:31,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 14:09:31,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 14:09:31,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 33 transitions. [2025-02-08 14:09:31,332 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.24444444444444444 [2025-02-08 14:09:31,332 INFO L175 Difference]: Start difference. First operand has 30 places, 20 transitions, 49 flow. Second operand 3 states and 33 transitions. [2025-02-08 14:09:31,332 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 18 transitions, 77 flow [2025-02-08 14:09:31,332 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 18 transitions, 76 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 14:09:31,333 INFO L231 Difference]: Finished difference. Result has 29 places, 18 transitions, 46 flow [2025-02-08 14:09:31,333 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=44, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=46, PETRI_PLACES=29, PETRI_TRANSITIONS=18} [2025-02-08 14:09:31,333 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, -20 predicate places. [2025-02-08 14:09:31,333 INFO L471 AbstractCegarLoop]: Abstraction has has 29 places, 18 transitions, 46 flow [2025-02-08 14:09:31,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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-02-08 14:09:31,333 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:09:31,333 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-02-08 14:09:31,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 14:09:31,333 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err10ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 49 more)] === [2025-02-08 14:09:31,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:09:31,334 INFO L85 PathProgramCache]: Analyzing trace with hash 20434502, now seen corresponding path program 1 times [2025-02-08 14:09:31,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:09:31,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746310137] [2025-02-08 14:09:31,334 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:09:31,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:09:31,343 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 14:09:31,349 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 14:09:31,351 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:09:31,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:09:31,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:09:31,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:09:31,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746310137] [2025-02-08 14:09:31,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1746310137] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:09:31,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:09:31,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 14:09:31,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981353604] [2025-02-08 14:09:31,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:09:31,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 14:09:31,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:09:31,434 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 14:09:31,434 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 14:09:31,434 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 45 [2025-02-08 14:09:31,434 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 18 transitions, 46 flow. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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-02-08 14:09:31,434 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:09:31,434 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 45 [2025-02-08 14:09:31,435 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:09:31,470 INFO L124 PetriNetUnfolderBase]: 68/139 cut-off events. [2025-02-08 14:09:31,471 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 14:09:31,471 INFO L83 FinitePrefix]: Finished finitePrefix Result has 289 conditions, 139 events. 68/139 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 638 event pairs, 68 based on Foata normal form. 0/88 useless extension candidates. Maximal degree in co-relation 285. Up to 134 conditions per place. [2025-02-08 14:09:31,472 INFO L140 encePairwiseOnDemand]: 42/45 looper letters, 13 selfloop transitions, 1 changer transitions 0/16 dead transitions. [2025-02-08 14:09:31,472 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 16 transitions, 70 flow [2025-02-08 14:09:31,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 14:09:31,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 14:09:31,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 31 transitions. [2025-02-08 14:09:31,474 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.22962962962962963 [2025-02-08 14:09:31,474 INFO L175 Difference]: Start difference. First operand has 29 places, 18 transitions, 46 flow. Second operand 3 states and 31 transitions. [2025-02-08 14:09:31,474 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 16 transitions, 70 flow [2025-02-08 14:09:31,474 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 16 transitions, 69 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 14:09:31,475 INFO L231 Difference]: Finished difference. Result has 28 places, 16 transitions, 43 flow [2025-02-08 14:09:31,475 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=41, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=43, PETRI_PLACES=28, PETRI_TRANSITIONS=16} [2025-02-08 14:09:31,476 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, -21 predicate places. [2025-02-08 14:09:31,476 INFO L471 AbstractCegarLoop]: Abstraction has has 28 places, 16 transitions, 43 flow [2025-02-08 14:09:31,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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-02-08 14:09:31,476 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:09:31,476 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-02-08 14:09:31,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 14:09:31,476 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err10ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 49 more)] === [2025-02-08 14:09:31,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:09:31,476 INFO L85 PathProgramCache]: Analyzing trace with hash 20434503, now seen corresponding path program 1 times [2025-02-08 14:09:31,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:09:31,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455830560] [2025-02-08 14:09:31,476 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:09:31,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:09:31,484 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 14:09:31,490 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 14:09:31,491 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:09:31,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:09:31,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:09:31,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:09:31,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455830560] [2025-02-08 14:09:31,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455830560] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:09:31,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:09:31,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 14:09:31,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511270816] [2025-02-08 14:09:31,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:09:31,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 14:09:31,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:09:31,556 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 14:09:31,556 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 14:09:31,556 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 45 [2025-02-08 14:09:31,556 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 16 transitions, 43 flow. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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-02-08 14:09:31,557 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:09:31,557 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 45 [2025-02-08 14:09:31,557 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:09:31,580 INFO L124 PetriNetUnfolderBase]: 42/91 cut-off events. [2025-02-08 14:09:31,581 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 14:09:31,581 INFO L83 FinitePrefix]: Finished finitePrefix Result has 194 conditions, 91 events. 42/91 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 349 event pairs, 42 based on Foata normal form. 0/68 useless extension candidates. Maximal degree in co-relation 190. Up to 87 conditions per place. [2025-02-08 14:09:31,581 INFO L140 encePairwiseOnDemand]: 42/45 looper letters, 0 selfloop transitions, 0 changer transitions 14/14 dead transitions. [2025-02-08 14:09:31,581 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 14 transitions, 63 flow [2025-02-08 14:09:31,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 14:09:31,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 14:09:31,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 29 transitions. [2025-02-08 14:09:31,582 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.21481481481481482 [2025-02-08 14:09:31,582 INFO L175 Difference]: Start difference. First operand has 28 places, 16 transitions, 43 flow. Second operand 3 states and 29 transitions. [2025-02-08 14:09:31,582 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 14 transitions, 63 flow [2025-02-08 14:09:31,583 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 14 transitions, 62 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 14:09:31,583 INFO L231 Difference]: Finished difference. Result has 27 places, 0 transitions, 0 flow [2025-02-08 14:09:31,583 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=14, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=27, PETRI_TRANSITIONS=0} [2025-02-08 14:09:31,584 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, -22 predicate places. [2025-02-08 14:09:31,585 INFO L471 AbstractCegarLoop]: Abstraction has has 27 places, 0 transitions, 0 flow [2025-02-08 14:09:31,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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-02-08 14:09:31,587 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW (51 of 52 remaining) [2025-02-08 14:09:31,587 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONINTEGER_OVERFLOW (50 of 52 remaining) [2025-02-08 14:09:31,587 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (49 of 52 remaining) [2025-02-08 14:09:31,587 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (48 of 52 remaining) [2025-02-08 14:09:31,587 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (47 of 52 remaining) [2025-02-08 14:09:31,587 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW (46 of 52 remaining) [2025-02-08 14:09:31,587 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (45 of 52 remaining) [2025-02-08 14:09:31,587 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (44 of 52 remaining) [2025-02-08 14:09:31,587 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (43 of 52 remaining) [2025-02-08 14:09:31,587 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (42 of 52 remaining) [2025-02-08 14:09:31,587 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (41 of 52 remaining) [2025-02-08 14:09:31,587 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (40 of 52 remaining) [2025-02-08 14:09:31,587 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONINTEGER_OVERFLOW (39 of 52 remaining) [2025-02-08 14:09:31,587 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONINTEGER_OVERFLOW (38 of 52 remaining) [2025-02-08 14:09:31,588 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (37 of 52 remaining) [2025-02-08 14:09:31,588 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (36 of 52 remaining) [2025-02-08 14:09:31,588 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (35 of 52 remaining) [2025-02-08 14:09:31,588 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONINTEGER_OVERFLOW (34 of 52 remaining) [2025-02-08 14:09:31,588 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (33 of 52 remaining) [2025-02-08 14:09:31,588 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (32 of 52 remaining) [2025-02-08 14:09:31,588 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (31 of 52 remaining) [2025-02-08 14:09:31,588 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (30 of 52 remaining) [2025-02-08 14:09:31,588 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 52 remaining) [2025-02-08 14:09:31,588 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 52 remaining) [2025-02-08 14:09:31,588 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 52 remaining) [2025-02-08 14:09:31,588 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 52 remaining) [2025-02-08 14:09:31,588 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (25 of 52 remaining) [2025-02-08 14:09:31,588 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (24 of 52 remaining) [2025-02-08 14:09:31,588 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 52 remaining) [2025-02-08 14:09:31,588 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 52 remaining) [2025-02-08 14:09:31,588 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 52 remaining) [2025-02-08 14:09:31,588 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 52 remaining) [2025-02-08 14:09:31,588 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 52 remaining) [2025-02-08 14:09:31,588 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 52 remaining) [2025-02-08 14:09:31,588 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 52 remaining) [2025-02-08 14:09:31,588 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 52 remaining) [2025-02-08 14:09:31,588 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 52 remaining) [2025-02-08 14:09:31,588 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 52 remaining) [2025-02-08 14:09:31,588 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 52 remaining) [2025-02-08 14:09:31,588 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 52 remaining) [2025-02-08 14:09:31,588 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 52 remaining) [2025-02-08 14:09:31,588 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 52 remaining) [2025-02-08 14:09:31,588 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 52 remaining) [2025-02-08 14:09:31,588 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 52 remaining) [2025-02-08 14:09:31,588 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 52 remaining) [2025-02-08 14:09:31,588 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 52 remaining) [2025-02-08 14:09:31,588 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 52 remaining) [2025-02-08 14:09:31,589 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 52 remaining) [2025-02-08 14:09:31,589 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 52 remaining) [2025-02-08 14:09:31,589 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 52 remaining) [2025-02-08 14:09:31,589 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 52 remaining) [2025-02-08 14:09:31,591 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 52 remaining) [2025-02-08 14:09:31,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 14:09:31,592 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:09:31,598 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-08 14:09:31,598 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 14:09:31,603 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 02:09:31 BasicIcfg [2025-02-08 14:09:31,603 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 14:09:31,604 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 14:09:31,604 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 14:09:31,604 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 14:09:31,605 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 02:09:29" (3/4) ... [2025-02-08 14:09:31,606 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-08 14:09:31,607 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-02-08 14:09:31,608 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-02-08 14:09:31,611 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 46 nodes and edges [2025-02-08 14:09:31,612 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2025-02-08 14:09:31,612 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2025-02-08 14:09:31,612 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-02-08 14:09:31,668 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 14:09:31,669 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 14:09:31,669 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 14:09:31,670 INFO L158 Benchmark]: Toolchain (without parser) took 3492.65ms. Allocated memory was 142.6MB in the beginning and 318.8MB in the end (delta: 176.2MB). Free memory was 107.1MB in the beginning and 179.4MB in the end (delta: -72.3MB). Peak memory consumption was 98.7MB. Max. memory is 16.1GB. [2025-02-08 14:09:31,670 INFO L158 Benchmark]: CDTParser took 4.19ms. Allocated memory is still 201.3MB. Free memory is still 126.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 14:09:31,670 INFO L158 Benchmark]: CACSL2BoogieTranslator took 181.49ms. Allocated memory is still 142.6MB. Free memory was 107.1MB in the beginning and 95.2MB in the end (delta: 11.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 14:09:31,671 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.18ms. Allocated memory is still 142.6MB. Free memory was 95.2MB in the beginning and 93.5MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 14:09:31,671 INFO L158 Benchmark]: Boogie Preprocessor took 33.76ms. Allocated memory is still 142.6MB. Free memory was 93.5MB in the beginning and 91.6MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 14:09:31,671 INFO L158 Benchmark]: IcfgBuilder took 816.56ms. Allocated memory is still 142.6MB. Free memory was 91.6MB in the beginning and 63.8MB in the end (delta: 27.8MB). Peak memory consumption was 64.1MB. Max. memory is 16.1GB. [2025-02-08 14:09:31,671 INFO L158 Benchmark]: TraceAbstraction took 2358.12ms. Allocated memory was 142.6MB in the beginning and 318.8MB in the end (delta: 176.2MB). Free memory was 63.1MB in the beginning and 184.5MB in the end (delta: -121.4MB). Peak memory consumption was 59.7MB. Max. memory is 16.1GB. [2025-02-08 14:09:31,672 INFO L158 Benchmark]: Witness Printer took 64.99ms. Allocated memory is still 318.8MB. Free memory was 184.5MB in the beginning and 179.4MB in the end (delta: 5.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 14:09:31,673 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 4.19ms. Allocated memory is still 201.3MB. Free memory is still 126.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 181.49ms. Allocated memory is still 142.6MB. Free memory was 107.1MB in the beginning and 95.2MB in the end (delta: 11.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.18ms. Allocated memory is still 142.6MB. Free memory was 95.2MB in the beginning and 93.5MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 33.76ms. Allocated memory is still 142.6MB. Free memory was 93.5MB in the beginning and 91.6MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 816.56ms. Allocated memory is still 142.6MB. Free memory was 91.6MB in the beginning and 63.8MB in the end (delta: 27.8MB). Peak memory consumption was 64.1MB. Max. memory is 16.1GB. * TraceAbstraction took 2358.12ms. Allocated memory was 142.6MB in the beginning and 318.8MB in the end (delta: 176.2MB). Free memory was 63.1MB in the beginning and 184.5MB in the end (delta: -121.4MB). Peak memory consumption was 59.7MB. Max. memory is 16.1GB. * Witness Printer took 64.99ms. Allocated memory is still 318.8MB. Free memory was 184.5MB in the beginning and 179.4MB in the end (delta: 5.1MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 86]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 86]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 87]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 87]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 88]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 88]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 86]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 86]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 87]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 87]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 88]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 88]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 86]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 86]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 87]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 87]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 88]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 88]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 86]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 86]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 87]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 87]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 88]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 88]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 79]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 79]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 82 locations, 52 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 2.1s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 136 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 136 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 15 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 181 IncrementalHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 15 mSolverCounterUnsat, 0 mSDtfsCounter, 181 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=96occurred in iteration=0, InterpolantAutomatonStates: 26, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 36 NumberOfCodeBlocks, 36 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 27 ConstructedInterpolants, 0 QuantifiedInterpolants, 99 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 26 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-02-08 14:09:31,689 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE