./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_nondet_test1-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_nondet_test1-1.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash fdc85b042221b41aa26e62667e19ce1f6c246be9a2cb4f81fe8b15c8429db160 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 06:20:32,799 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 06:20:32,843 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-01-10 06:20:32,847 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 06:20:32,847 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 06:20:32,862 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 06:20:32,863 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 06:20:32,863 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 06:20:32,863 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 06:20:32,863 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 06:20:32,863 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 06:20:32,863 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 06:20:32,863 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 06:20:32,864 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 06:20:32,864 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 06:20:32,864 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 06:20:32,864 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 06:20:32,864 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 06:20:32,864 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 06:20:32,864 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 06:20:32,864 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 06:20:32,864 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 06:20:32,864 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 06:20:32,864 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 06:20:32,864 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 06:20:32,864 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 06:20:32,864 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 06:20:32,864 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 06:20:32,864 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 06:20:32,865 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 06:20:32,865 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 06:20:32,865 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 06:20:32,865 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 06:20:32,865 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 06:20:32,865 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:20:32,865 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 06:20:32,865 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 06:20:32,865 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 06:20:32,865 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 06:20:32,866 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:20:32,866 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 06:20:32,866 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 06:20:32,866 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 06:20:32,866 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 06:20:32,866 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 06:20:32,866 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 06:20:32,866 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 06:20:32,866 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 06:20:32,866 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 06:20:32,866 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 06:20:32,866 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 -> fdc85b042221b41aa26e62667e19ce1f6c246be9a2cb4f81fe8b15c8429db160 [2025-01-10 06:20:33,091 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 06:20:33,100 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 06:20:33,103 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 06:20:33,104 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 06:20:33,105 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 06:20:33,106 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_nondet_test1-1.i [2025-01-10 06:20:34,238 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/af0578b5a/a9ee6c106de2494b87d85b113c0ec4e7/FLAG198b4348e [2025-01-10 06:20:34,593 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 06:20:34,594 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_nondet_test1-1.i [2025-01-10 06:20:34,607 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/af0578b5a/a9ee6c106de2494b87d85b113c0ec4e7/FLAG198b4348e [2025-01-10 06:20:34,821 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/af0578b5a/a9ee6c106de2494b87d85b113c0ec4e7 [2025-01-10 06:20:34,822 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 06:20:34,823 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 06:20:34,824 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 06:20:34,824 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 06:20:34,827 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 06:20:34,828 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:20:34" (1/1) ... [2025-01-10 06:20:34,828 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1cf158bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:20:34, skipping insertion in model container [2025-01-10 06:20:34,828 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:20:34" (1/1) ... [2025-01-10 06:20:34,860 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 06:20:35,146 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 06:20:35,157 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 06:20:35,218 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 06:20:35,258 INFO L204 MainTranslator]: Completed translation [2025-01-10 06:20:35,265 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:20:35 WrapperNode [2025-01-10 06:20:35,265 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 06:20:35,266 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 06:20:35,266 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 06:20:35,266 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 06:20:35,271 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:20:35" (1/1) ... [2025-01-10 06:20:35,285 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:20:35" (1/1) ... [2025-01-10 06:20:35,325 INFO L138 Inliner]: procedures = 176, calls = 170, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 779 [2025-01-10 06:20:35,330 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 06:20:35,330 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 06:20:35,330 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 06:20:35,330 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 06:20:35,339 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:20:35" (1/1) ... [2025-01-10 06:20:35,339 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:20:35" (1/1) ... [2025-01-10 06:20:35,351 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:20:35" (1/1) ... [2025-01-10 06:20:35,398 INFO L175 MemorySlicer]: Split 158 memory accesses to 2 slices as follows [2, 156]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 42 writes are split as follows [0, 42]. [2025-01-10 06:20:35,398 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:20:35" (1/1) ... [2025-01-10 06:20:35,398 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:20:35" (1/1) ... [2025-01-10 06:20:35,428 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:20:35" (1/1) ... [2025-01-10 06:20:35,430 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:20:35" (1/1) ... [2025-01-10 06:20:35,438 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:20:35" (1/1) ... [2025-01-10 06:20:35,443 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:20:35" (1/1) ... [2025-01-10 06:20:35,445 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:20:35" (1/1) ... [2025-01-10 06:20:35,450 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 06:20:35,454 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 06:20:35,457 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 06:20:35,457 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 06:20:35,458 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:20:35" (1/1) ... [2025-01-10 06:20:35,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:20:35,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:20:35,488 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-10 06:20:35,491 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-10 06:20:35,512 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 06:20:35,512 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-10 06:20:35,512 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 06:20:35,512 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-10 06:20:35,512 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-01-10 06:20:35,512 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-01-10 06:20:35,512 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-01-10 06:20:35,512 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-01-10 06:20:35,512 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-10 06:20:35,512 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 06:20:35,512 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-10 06:20:35,512 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-10 06:20:35,513 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-10 06:20:35,514 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-10 06:20:35,514 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-10 06:20:35,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 06:20:35,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 06:20:35,514 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 06:20:35,514 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 06:20:35,674 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 06:20:35,675 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 06:20:36,336 INFO L? ?]: Removed 205 outVars from TransFormulas that were not future-live. [2025-01-10 06:20:36,336 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 06:20:36,345 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 06:20:36,345 INFO L312 CfgBuilder]: Removed 14 assume(true) statements. [2025-01-10 06:20:36,345 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:20:36 BoogieIcfgContainer [2025-01-10 06:20:36,346 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 06:20:36,347 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 06:20:36,347 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 06:20:36,350 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 06:20:36,350 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 06:20:34" (1/3) ... [2025-01-10 06:20:36,351 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77403328 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:20:36, skipping insertion in model container [2025-01-10 06:20:36,351 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:20:35" (2/3) ... [2025-01-10 06:20:36,351 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77403328 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:20:36, skipping insertion in model container [2025-01-10 06:20:36,351 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:20:36" (3/3) ... [2025-01-10 06:20:36,352 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_OAT_nondet_test1-1.i [2025-01-10 06:20:36,362 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 06:20:36,363 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_OAT_nondet_test1-1.i that has 3 procedures, 223 locations, 1 initial locations, 20 loop locations, and 6 error locations. [2025-01-10 06:20:36,407 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 06:20:36,417 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;@6283ad9e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 06:20:36,417 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-01-10 06:20:36,421 INFO L276 IsEmpty]: Start isEmpty. Operand has 219 states, 208 states have (on average 1.6057692307692308) internal successors, (334), 214 states have internal predecessors, (334), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-10 06:20:36,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-01-10 06:20:36,424 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:20:36,425 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-01-10 06:20:36,425 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 06:20:36,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:20:36,429 INFO L85 PathProgramCache]: Analyzing trace with hash 44703485, now seen corresponding path program 1 times [2025-01-10 06:20:36,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:20:36,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980047171] [2025-01-10 06:20:36,436 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:20:36,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:20:36,498 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 06:20:36,507 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 06:20:36,508 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:20:36,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:20:36,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:20:36,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:20:36,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980047171] [2025-01-10 06:20:36,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980047171] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:20:36,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:20:36,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:20:36,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723774258] [2025-01-10 06:20:36,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:20:36,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:20:36,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:20:36,587 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:20:36,587 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:20:36,592 INFO L87 Difference]: Start difference. First operand has 219 states, 208 states have (on average 1.6057692307692308) internal successors, (334), 214 states have internal predecessors, (334), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:20:36,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:20:36,678 INFO L93 Difference]: Finished difference Result 632 states and 993 transitions. [2025-01-10 06:20:36,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:20:36,681 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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) Word has length 5 [2025-01-10 06:20:36,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:20:36,688 INFO L225 Difference]: With dead ends: 632 [2025-01-10 06:20:36,690 INFO L226 Difference]: Without dead ends: 409 [2025-01-10 06:20:36,693 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:20:36,697 INFO L435 NwaCegarLoop]: 303 mSDtfsCounter, 277 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 602 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 06:20:36,697 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [280 Valid, 602 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:20:36,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2025-01-10 06:20:36,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 213. [2025-01-10 06:20:36,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 203 states have (on average 1.4532019704433496) internal successors, (295), 208 states have internal predecessors, (295), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-10 06:20:36,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 301 transitions. [2025-01-10 06:20:36,732 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 301 transitions. Word has length 5 [2025-01-10 06:20:36,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:20:36,732 INFO L471 AbstractCegarLoop]: Abstraction has 213 states and 301 transitions. [2025-01-10 06:20:36,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:20:36,732 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 301 transitions. [2025-01-10 06:20:36,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-01-10 06:20:36,732 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:20:36,732 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-01-10 06:20:36,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 06:20:36,733 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 06:20:36,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:20:36,733 INFO L85 PathProgramCache]: Analyzing trace with hash 1362875753, now seen corresponding path program 1 times [2025-01-10 06:20:36,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:20:36,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380028271] [2025-01-10 06:20:36,733 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:20:36,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:20:36,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 06:20:36,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 06:20:36,753 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:20:36,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:20:36,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:20:36,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:20:36,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380028271] [2025-01-10 06:20:36,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380028271] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:20:36,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:20:36,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:20:36,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155441963] [2025-01-10 06:20:36,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:20:36,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:20:36,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:20:36,885 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:20:36,885 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:20:36,885 INFO L87 Difference]: Start difference. First operand 213 states and 301 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:20:36,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:20:36,930 INFO L93 Difference]: Finished difference Result 218 states and 307 transitions. [2025-01-10 06:20:36,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:20:36,930 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 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) Word has length 6 [2025-01-10 06:20:36,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:20:36,931 INFO L225 Difference]: With dead ends: 218 [2025-01-10 06:20:36,931 INFO L226 Difference]: Without dead ends: 217 [2025-01-10 06:20:36,932 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:20:36,932 INFO L435 NwaCegarLoop]: 297 mSDtfsCounter, 2 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 590 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 06:20:36,932 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 590 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:20:36,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2025-01-10 06:20:36,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 216. [2025-01-10 06:20:36,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 206 states have (on average 1.4466019417475728) internal successors, (298), 211 states have internal predecessors, (298), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-10 06:20:36,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 304 transitions. [2025-01-10 06:20:36,940 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 304 transitions. Word has length 6 [2025-01-10 06:20:36,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:20:36,940 INFO L471 AbstractCegarLoop]: Abstraction has 216 states and 304 transitions. [2025-01-10 06:20:36,940 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:20:36,941 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 304 transitions. [2025-01-10 06:20:36,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-01-10 06:20:36,941 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:20:36,941 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:20:36,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 06:20:36,941 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 06:20:36,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:20:36,942 INFO L85 PathProgramCache]: Analyzing trace with hash -700524554, now seen corresponding path program 1 times [2025-01-10 06:20:36,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:20:36,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324443191] [2025-01-10 06:20:36,942 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:20:36,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:20:36,949 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 06:20:36,952 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 06:20:36,952 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:20:36,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:20:37,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:20:37,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:20:37,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324443191] [2025-01-10 06:20:37,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324443191] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:20:37,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:20:37,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:20:37,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964753587] [2025-01-10 06:20:37,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:20:37,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:20:37,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:20:37,048 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:20:37,048 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:20:37,049 INFO L87 Difference]: Start difference. First operand 216 states and 304 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:20:37,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:20:37,073 INFO L93 Difference]: Finished difference Result 218 states and 306 transitions. [2025-01-10 06:20:37,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:20:37,073 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 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) Word has length 7 [2025-01-10 06:20:37,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:20:37,074 INFO L225 Difference]: With dead ends: 218 [2025-01-10 06:20:37,074 INFO L226 Difference]: Without dead ends: 217 [2025-01-10 06:20:37,075 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:20:37,075 INFO L435 NwaCegarLoop]: 298 mSDtfsCounter, 0 mSDsluCounter, 581 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 879 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 06:20:37,076 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 879 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:20:37,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2025-01-10 06:20:37,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2025-01-10 06:20:37,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 207 states have (on average 1.4444444444444444) internal successors, (299), 212 states have internal predecessors, (299), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-10 06:20:37,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 305 transitions. [2025-01-10 06:20:37,082 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 305 transitions. Word has length 7 [2025-01-10 06:20:37,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:20:37,082 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 305 transitions. [2025-01-10 06:20:37,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:20:37,083 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 305 transitions. [2025-01-10 06:20:37,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-01-10 06:20:37,084 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:20:37,084 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:20:37,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 06:20:37,084 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 06:20:37,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:20:37,085 INFO L85 PathProgramCache]: Analyzing trace with hash -1230645322, now seen corresponding path program 1 times [2025-01-10 06:20:37,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:20:37,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013747507] [2025-01-10 06:20:37,085 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:20:37,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:20:37,133 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-01-10 06:20:37,138 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-01-10 06:20:37,138 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:20:37,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:20:37,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:20:37,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:20:37,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013747507] [2025-01-10 06:20:37,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1013747507] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:20:37,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:20:37,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 06:20:37,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353997310] [2025-01-10 06:20:37,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:20:37,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:20:37,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:20:37,337 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:20:37,338 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:20:37,338 INFO L87 Difference]: Start difference. First operand 217 states and 305 transitions. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:20:37,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:20:37,427 INFO L93 Difference]: Finished difference Result 430 states and 606 transitions. [2025-01-10 06:20:37,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:20:37,430 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 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) Word has length 79 [2025-01-10 06:20:37,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:20:37,431 INFO L225 Difference]: With dead ends: 430 [2025-01-10 06:20:37,431 INFO L226 Difference]: Without dead ends: 220 [2025-01-10 06:20:37,432 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:20:37,432 INFO L435 NwaCegarLoop]: 273 mSDtfsCounter, 105 mSDsluCounter, 453 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 726 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 06:20:37,432 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 726 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 06:20:37,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2025-01-10 06:20:37,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 217. [2025-01-10 06:20:37,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 207 states have (on average 1.4106280193236715) internal successors, (292), 212 states have internal predecessors, (292), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-10 06:20:37,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 298 transitions. [2025-01-10 06:20:37,446 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 298 transitions. Word has length 79 [2025-01-10 06:20:37,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:20:37,446 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 298 transitions. [2025-01-10 06:20:37,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:20:37,446 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 298 transitions. [2025-01-10 06:20:37,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-01-10 06:20:37,452 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:20:37,452 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:20:37,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 06:20:37,452 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 06:20:37,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:20:37,453 INFO L85 PathProgramCache]: Analyzing trace with hash 251759786, now seen corresponding path program 1 times [2025-01-10 06:20:37,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:20:37,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285078978] [2025-01-10 06:20:37,453 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:20:37,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:20:37,488 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-01-10 06:20:37,502 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-01-10 06:20:37,503 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:20:37,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:20:37,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:20:37,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:20:37,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285078978] [2025-01-10 06:20:37,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285078978] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:20:37,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:20:37,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:20:37,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927675961] [2025-01-10 06:20:37,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:20:37,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:20:37,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:20:37,612 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:20:37,612 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:20:37,612 INFO L87 Difference]: Start difference. First operand 217 states and 298 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:20:37,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:20:37,654 INFO L93 Difference]: Finished difference Result 553 states and 775 transitions. [2025-01-10 06:20:37,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:20:37,655 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 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) Word has length 79 [2025-01-10 06:20:37,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:20:37,657 INFO L225 Difference]: With dead ends: 553 [2025-01-10 06:20:37,657 INFO L226 Difference]: Without dead ends: 343 [2025-01-10 06:20:37,657 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:20:37,657 INFO L435 NwaCegarLoop]: 292 mSDtfsCounter, 134 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 576 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 06:20:37,658 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 576 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:20:37,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2025-01-10 06:20:37,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 343. [2025-01-10 06:20:37,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 333 states have (on average 1.4324324324324325) internal successors, (477), 338 states have internal predecessors, (477), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-10 06:20:37,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 483 transitions. [2025-01-10 06:20:37,669 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 483 transitions. Word has length 79 [2025-01-10 06:20:37,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:20:37,670 INFO L471 AbstractCegarLoop]: Abstraction has 343 states and 483 transitions. [2025-01-10 06:20:37,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:20:37,670 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 483 transitions. [2025-01-10 06:20:37,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-01-10 06:20:37,671 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:20:37,671 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:20:37,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 06:20:37,672 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 06:20:37,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:20:37,672 INFO L85 PathProgramCache]: Analyzing trace with hash -690610596, now seen corresponding path program 1 times [2025-01-10 06:20:37,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:20:37,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059079694] [2025-01-10 06:20:37,672 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:20:37,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:20:37,713 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-01-10 06:20:37,750 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-01-10 06:20:37,750 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:20:37,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:20:37,917 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 06:20:37,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:20:37,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059079694] [2025-01-10 06:20:37,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059079694] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:20:37,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:20:37,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:20:37,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944471378] [2025-01-10 06:20:37,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:20:37,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:20:37,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:20:37,918 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:20:37,918 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:20:37,919 INFO L87 Difference]: Start difference. First operand 343 states and 483 transitions. Second operand has 4 states, 3 states have (on average 29.0) internal successors, (87), 4 states have internal predecessors, (87), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 06:20:37,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:20:37,958 INFO L93 Difference]: Finished difference Result 409 states and 569 transitions. [2025-01-10 06:20:37,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:20:37,959 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 29.0) internal successors, (87), 4 states have internal predecessors, (87), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 94 [2025-01-10 06:20:37,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:20:37,963 INFO L225 Difference]: With dead ends: 409 [2025-01-10 06:20:37,963 INFO L226 Difference]: Without dead ends: 407 [2025-01-10 06:20:37,963 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:20:37,963 INFO L435 NwaCegarLoop]: 288 mSDtfsCounter, 186 mSDsluCounter, 571 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 859 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 06:20:37,964 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 859 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:20:37,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2025-01-10 06:20:37,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 407. [2025-01-10 06:20:37,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 407 states, 394 states have (on average 1.4086294416243654) internal successors, (555), 399 states have internal predecessors, (555), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-10 06:20:37,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 567 transitions. [2025-01-10 06:20:37,984 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 567 transitions. Word has length 94 [2025-01-10 06:20:37,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:20:37,985 INFO L471 AbstractCegarLoop]: Abstraction has 407 states and 567 transitions. [2025-01-10 06:20:37,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 29.0) internal successors, (87), 4 states have internal predecessors, (87), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 06:20:37,985 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 567 transitions. [2025-01-10 06:20:37,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-01-10 06:20:37,987 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:20:37,987 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:20:37,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 06:20:37,987 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 06:20:37,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:20:37,989 INFO L85 PathProgramCache]: Analyzing trace with hash 689768288, now seen corresponding path program 1 times [2025-01-10 06:20:37,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:20:37,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497541813] [2025-01-10 06:20:37,990 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:20:37,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:20:38,022 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-01-10 06:20:38,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-01-10 06:20:38,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:20:38,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:20:38,234 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 06:20:38,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:20:38,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497541813] [2025-01-10 06:20:38,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497541813] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:20:38,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1446107243] [2025-01-10 06:20:38,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:20:38,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:20:38,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:20:38,237 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:20:38,239 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-10 06:20:38,387 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-01-10 06:20:38,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-01-10 06:20:38,467 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:20:38,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:20:38,474 INFO L256 TraceCheckSpWp]: Trace formula consists of 552 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 06:20:38,482 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:20:38,616 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 06:20:38,617 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:20:38,784 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 06:20:38,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1446107243] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:20:38,785 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:20:38,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-01-10 06:20:38,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509477166] [2025-01-10 06:20:38,786 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:20:38,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-10 06:20:38,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:20:38,788 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-10 06:20:38,789 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-01-10 06:20:38,789 INFO L87 Difference]: Start difference. First operand 407 states and 567 transitions. Second operand has 10 states, 10 states have (on average 26.0) internal successors, (260), 10 states have internal predecessors, (260), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-01-10 06:20:38,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:20:38,886 INFO L93 Difference]: Finished difference Result 613 states and 856 transitions. [2025-01-10 06:20:38,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 06:20:38,887 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 26.0) internal successors, (260), 10 states have internal predecessors, (260), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 98 [2025-01-10 06:20:38,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:20:38,891 INFO L225 Difference]: With dead ends: 613 [2025-01-10 06:20:38,891 INFO L226 Difference]: Without dead ends: 607 [2025-01-10 06:20:38,892 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-01-10 06:20:38,893 INFO L435 NwaCegarLoop]: 287 mSDtfsCounter, 1058 mSDsluCounter, 1746 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1065 SdHoareTripleChecker+Valid, 2033 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 06:20:38,894 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1065 Valid, 2033 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 06:20:38,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2025-01-10 06:20:38,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 605. [2025-01-10 06:20:38,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 605 states, 589 states have (on average 1.4091680814940577) internal successors, (830), 594 states have internal predecessors, (830), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-10 06:20:38,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 848 transitions. [2025-01-10 06:20:38,922 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 848 transitions. Word has length 98 [2025-01-10 06:20:38,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:20:38,922 INFO L471 AbstractCegarLoop]: Abstraction has 605 states and 848 transitions. [2025-01-10 06:20:38,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 26.0) internal successors, (260), 10 states have internal predecessors, (260), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-01-10 06:20:38,923 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 848 transitions. [2025-01-10 06:20:38,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-01-10 06:20:38,927 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:20:38,927 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:20:38,938 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-10 06:20:39,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:20:39,133 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 06:20:39,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:20:39,134 INFO L85 PathProgramCache]: Analyzing trace with hash -114951834, now seen corresponding path program 1 times [2025-01-10 06:20:39,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:20:39,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308600108] [2025-01-10 06:20:39,134 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:20:39,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:20:39,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-01-10 06:20:39,218 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-01-10 06:20:39,219 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:20:39,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:20:39,625 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 06:20:39,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:20:39,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308600108] [2025-01-10 06:20:39,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308600108] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:20:39,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [68938039] [2025-01-10 06:20:39,626 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:20:39,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:20:39,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:20:39,628 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:20:39,630 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-10 06:20:39,766 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-01-10 06:20:39,838 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-01-10 06:20:39,838 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:20:39,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:20:39,843 INFO L256 TraceCheckSpWp]: Trace formula consists of 584 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-01-10 06:20:39,846 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:20:40,031 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 06:20:40,031 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:20:40,175 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 06:20:40,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [68938039] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:20:40,175 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:20:40,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2025-01-10 06:20:40,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931509317] [2025-01-10 06:20:40,176 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:20:40,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-10 06:20:40,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:20:40,177 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-10 06:20:40,177 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2025-01-10 06:20:40,177 INFO L87 Difference]: Start difference. First operand 605 states and 848 transitions. Second operand has 13 states, 12 states have (on average 15.666666666666666) internal successors, (188), 13 states have internal predecessors, (188), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-10 06:20:40,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:20:40,313 INFO L93 Difference]: Finished difference Result 813 states and 1141 transitions. [2025-01-10 06:20:40,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-10 06:20:40,313 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 15.666666666666666) internal successors, (188), 13 states have internal predecessors, (188), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 99 [2025-01-10 06:20:40,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:20:40,316 INFO L225 Difference]: With dead ends: 813 [2025-01-10 06:20:40,316 INFO L226 Difference]: Without dead ends: 812 [2025-01-10 06:20:40,317 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=133, Unknown=0, NotChecked=0, Total=210 [2025-01-10 06:20:40,317 INFO L435 NwaCegarLoop]: 329 mSDtfsCounter, 1128 mSDsluCounter, 1794 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1133 SdHoareTripleChecker+Valid, 2123 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 06:20:40,317 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1133 Valid, 2123 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 06:20:40,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 812 states. [2025-01-10 06:20:40,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 812 to 805. [2025-01-10 06:20:40,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 805 states, 786 states have (on average 1.4083969465648856) internal successors, (1107), 791 states have internal predecessors, (1107), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-10 06:20:40,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 805 states to 805 states and 1131 transitions. [2025-01-10 06:20:40,336 INFO L78 Accepts]: Start accepts. Automaton has 805 states and 1131 transitions. Word has length 99 [2025-01-10 06:20:40,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:20:40,336 INFO L471 AbstractCegarLoop]: Abstraction has 805 states and 1131 transitions. [2025-01-10 06:20:40,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 15.666666666666666) internal successors, (188), 13 states have internal predecessors, (188), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-10 06:20:40,336 INFO L276 IsEmpty]: Start isEmpty. Operand 805 states and 1131 transitions. [2025-01-10 06:20:40,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-01-10 06:20:40,337 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:20:40,337 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:20:40,347 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-10 06:20:40,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:20:40,538 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 06:20:40,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:20:40,538 INFO L85 PathProgramCache]: Analyzing trace with hash 731460505, now seen corresponding path program 1 times [2025-01-10 06:20:40,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:20:40,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069404943] [2025-01-10 06:20:40,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:20:40,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:20:40,571 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-01-10 06:20:40,601 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-01-10 06:20:40,601 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:20:40,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:20:41,017 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 06:20:41,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:20:41,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069404943] [2025-01-10 06:20:41,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069404943] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:20:41,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [999503101] [2025-01-10 06:20:41,018 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:20:41,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:20:41,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:20:41,020 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:20:41,021 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-10 06:20:41,253 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-01-10 06:20:41,327 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-01-10 06:20:41,327 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:20:41,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:20:41,332 INFO L256 TraceCheckSpWp]: Trace formula consists of 585 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-10 06:20:41,338 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:20:41,590 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 06:20:41,590 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:20:41,761 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 06:20:41,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [999503101] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:20:41,762 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:20:41,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2025-01-10 06:20:41,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970598116] [2025-01-10 06:20:41,762 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:20:41,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-10 06:20:41,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:20:41,763 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-10 06:20:41,763 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2025-01-10 06:20:41,763 INFO L87 Difference]: Start difference. First operand 805 states and 1131 transitions. Second operand has 13 states, 12 states have (on average 15.916666666666666) internal successors, (191), 13 states have internal predecessors, (191), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-10 06:20:41,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:20:41,923 INFO L93 Difference]: Finished difference Result 813 states and 1138 transitions. [2025-01-10 06:20:41,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 06:20:41,924 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 15.916666666666666) internal successors, (191), 13 states have internal predecessors, (191), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 100 [2025-01-10 06:20:41,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:20:41,927 INFO L225 Difference]: With dead ends: 813 [2025-01-10 06:20:41,927 INFO L226 Difference]: Without dead ends: 812 [2025-01-10 06:20:41,927 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=133, Unknown=0, NotChecked=0, Total=210 [2025-01-10 06:20:41,927 INFO L435 NwaCegarLoop]: 330 mSDtfsCounter, 1126 mSDsluCounter, 2432 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1131 SdHoareTripleChecker+Valid, 2762 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 06:20:41,931 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1131 Valid, 2762 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 06:20:41,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 812 states. [2025-01-10 06:20:41,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 812 to 806. [2025-01-10 06:20:41,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 806 states, 787 states have (on average 1.4053367217280812) internal successors, (1106), 792 states have internal predecessors, (1106), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-10 06:20:41,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 806 states to 806 states and 1130 transitions. [2025-01-10 06:20:41,971 INFO L78 Accepts]: Start accepts. Automaton has 806 states and 1130 transitions. Word has length 100 [2025-01-10 06:20:41,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:20:41,973 INFO L471 AbstractCegarLoop]: Abstraction has 806 states and 1130 transitions. [2025-01-10 06:20:41,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 15.916666666666666) internal successors, (191), 13 states have internal predecessors, (191), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-10 06:20:41,974 INFO L276 IsEmpty]: Start isEmpty. Operand 806 states and 1130 transitions. [2025-01-10 06:20:41,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2025-01-10 06:20:41,975 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:20:41,975 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:20:41,987 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-10 06:20:42,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:20:42,176 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 06:20:42,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:20:42,176 INFO L85 PathProgramCache]: Analyzing trace with hash -1844642483, now seen corresponding path program 1 times [2025-01-10 06:20:42,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:20:42,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809862524] [2025-01-10 06:20:42,177 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:20:42,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:20:42,227 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-01-10 06:20:42,262 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-01-10 06:20:42,263 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:20:42,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:20:42,484 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 0 proven. 75 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 06:20:42,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:20:42,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809862524] [2025-01-10 06:20:42,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809862524] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:20:42,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1100699872] [2025-01-10 06:20:42,484 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:20:42,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:20:42,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:20:42,486 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:20:42,488 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-10 06:20:42,674 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-01-10 06:20:42,770 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-01-10 06:20:42,771 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:20:42,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:20:42,775 INFO L256 TraceCheckSpWp]: Trace formula consists of 917 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 06:20:42,778 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:20:43,128 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 06:20:43,128 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 06:20:43,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1100699872] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:20:43,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 06:20:43,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-01-10 06:20:43,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081290616] [2025-01-10 06:20:43,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:20:43,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 06:20:43,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:20:43,130 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 06:20:43,130 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-01-10 06:20:43,130 INFO L87 Difference]: Start difference. First operand 806 states and 1130 transitions. Second operand has 6 states, 5 states have (on average 33.0) internal successors, (165), 6 states have internal predecessors, (165), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 06:20:43,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:20:43,191 INFO L93 Difference]: Finished difference Result 806 states and 1130 transitions. [2025-01-10 06:20:43,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:20:43,192 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 33.0) internal successors, (165), 6 states have internal predecessors, (165), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 172 [2025-01-10 06:20:43,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:20:43,195 INFO L225 Difference]: With dead ends: 806 [2025-01-10 06:20:43,195 INFO L226 Difference]: Without dead ends: 805 [2025-01-10 06:20:43,196 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-01-10 06:20:43,196 INFO L435 NwaCegarLoop]: 511 mSDtfsCounter, 425 mSDsluCounter, 1299 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 429 SdHoareTripleChecker+Valid, 1810 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 06:20:43,196 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [429 Valid, 1810 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:20:43,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 805 states. [2025-01-10 06:20:43,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 805 to 805. [2025-01-10 06:20:43,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 805 states, 787 states have (on average 1.4015247776365947) internal successors, (1103), 791 states have internal predecessors, (1103), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-10 06:20:43,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 805 states to 805 states and 1127 transitions. [2025-01-10 06:20:43,219 INFO L78 Accepts]: Start accepts. Automaton has 805 states and 1127 transitions. Word has length 172 [2025-01-10 06:20:43,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:20:43,219 INFO L471 AbstractCegarLoop]: Abstraction has 805 states and 1127 transitions. [2025-01-10 06:20:43,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 33.0) internal successors, (165), 6 states have internal predecessors, (165), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 06:20:43,219 INFO L276 IsEmpty]: Start isEmpty. Operand 805 states and 1127 transitions. [2025-01-10 06:20:43,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2025-01-10 06:20:43,221 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:20:43,221 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:20:43,232 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-10 06:20:43,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-01-10 06:20:43,426 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 06:20:43,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:20:43,426 INFO L85 PathProgramCache]: Analyzing trace with hash 370604125, now seen corresponding path program 1 times [2025-01-10 06:20:43,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:20:43,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857568438] [2025-01-10 06:20:43,427 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:20:43,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:20:43,491 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 251 statements into 1 equivalence classes. [2025-01-10 06:20:43,533 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 251 of 251 statements. [2025-01-10 06:20:43,533 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:20:43,533 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:20:43,732 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-01-10 06:20:43,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:20:43,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857568438] [2025-01-10 06:20:43,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857568438] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:20:43,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:20:43,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:20:43,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896732902] [2025-01-10 06:20:43,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:20:43,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:20:43,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:20:43,736 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:20:43,736 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:20:43,736 INFO L87 Difference]: Start difference. First operand 805 states and 1127 transitions. Second operand has 4 states, 3 states have (on average 56.333333333333336) internal successors, (169), 4 states have internal predecessors, (169), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 06:20:43,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:20:43,766 INFO L93 Difference]: Finished difference Result 805 states and 1127 transitions. [2025-01-10 06:20:43,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:20:43,766 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 56.333333333333336) internal successors, (169), 4 states have internal predecessors, (169), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 251 [2025-01-10 06:20:43,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:20:43,770 INFO L225 Difference]: With dead ends: 805 [2025-01-10 06:20:43,770 INFO L226 Difference]: Without dead ends: 804 [2025-01-10 06:20:43,770 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:20:43,771 INFO L435 NwaCegarLoop]: 286 mSDtfsCounter, 195 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 584 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 06:20:43,772 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 584 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:20:43,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 804 states. [2025-01-10 06:20:43,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 804 to 804. [2025-01-10 06:20:43,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 804 states, 787 states have (on average 1.3989834815756035) internal successors, (1101), 790 states have internal predecessors, (1101), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-10 06:20:43,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 804 states and 1125 transitions. [2025-01-10 06:20:43,798 INFO L78 Accepts]: Start accepts. Automaton has 804 states and 1125 transitions. Word has length 251 [2025-01-10 06:20:43,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:20:43,798 INFO L471 AbstractCegarLoop]: Abstraction has 804 states and 1125 transitions. [2025-01-10 06:20:43,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 56.333333333333336) internal successors, (169), 4 states have internal predecessors, (169), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 06:20:43,799 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 1125 transitions. [2025-01-10 06:20:43,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2025-01-10 06:20:43,804 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:20:43,805 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:20:43,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-10 06:20:43,805 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 06:20:43,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:20:43,805 INFO L85 PathProgramCache]: Analyzing trace with hash -1692638590, now seen corresponding path program 1 times [2025-01-10 06:20:43,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:20:43,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961167694] [2025-01-10 06:20:43,806 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:20:43,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:20:43,879 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 254 statements into 1 equivalence classes. [2025-01-10 06:20:43,940 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 254 of 254 statements. [2025-01-10 06:20:43,941 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:20:43,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:20:44,352 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 0 proven. 233 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 06:20:44,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:20:44,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961167694] [2025-01-10 06:20:44,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961167694] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:20:44,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2054893130] [2025-01-10 06:20:44,353 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:20:44,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:20:44,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:20:44,356 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:20:44,364 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-10 06:20:44,626 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 254 statements into 1 equivalence classes. [2025-01-10 06:20:44,758 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 254 of 254 statements. [2025-01-10 06:20:44,758 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:20:44,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:20:44,764 INFO L256 TraceCheckSpWp]: Trace formula consists of 1306 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-10 06:20:44,769 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:20:45,002 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 0 proven. 233 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 06:20:45,003 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:20:45,282 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 0 proven. 233 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 06:20:45,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2054893130] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:20:45,283 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:20:45,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2025-01-10 06:20:45,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642272172] [2025-01-10 06:20:45,284 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:20:45,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-01-10 06:20:45,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:20:45,287 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-01-10 06:20:45,287 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-01-10 06:20:45,287 INFO L87 Difference]: Start difference. First operand 804 states and 1125 transitions. Second operand has 18 states, 18 states have (on average 31.77777777777778) internal successors, (572), 18 states have internal predecessors, (572), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-01-10 06:20:45,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:20:45,433 INFO L93 Difference]: Finished difference Result 1400 states and 1964 transitions. [2025-01-10 06:20:45,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-10 06:20:45,434 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 31.77777777777778) internal successors, (572), 18 states have internal predecessors, (572), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 254 [2025-01-10 06:20:45,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:20:45,439 INFO L225 Difference]: With dead ends: 1400 [2025-01-10 06:20:45,439 INFO L226 Difference]: Without dead ends: 1395 [2025-01-10 06:20:45,440 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 515 GetRequests, 499 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-01-10 06:20:45,440 INFO L435 NwaCegarLoop]: 329 mSDtfsCounter, 2173 mSDsluCounter, 3083 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2192 SdHoareTripleChecker+Valid, 3412 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 06:20:45,440 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2192 Valid, 3412 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 06:20:45,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1395 states. [2025-01-10 06:20:45,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1395 to 1391. [2025-01-10 06:20:45,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1391 states, 1365 states have (on average 1.4014652014652014) internal successors, (1913), 1368 states have internal predecessors, (1913), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-01-10 06:20:45,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1391 states to 1391 states and 1955 transitions. [2025-01-10 06:20:45,470 INFO L78 Accepts]: Start accepts. Automaton has 1391 states and 1955 transitions. Word has length 254 [2025-01-10 06:20:45,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:20:45,470 INFO L471 AbstractCegarLoop]: Abstraction has 1391 states and 1955 transitions. [2025-01-10 06:20:45,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 31.77777777777778) internal successors, (572), 18 states have internal predecessors, (572), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-01-10 06:20:45,471 INFO L276 IsEmpty]: Start isEmpty. Operand 1391 states and 1955 transitions. [2025-01-10 06:20:45,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2025-01-10 06:20:45,474 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:20:45,475 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:20:45,484 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-10 06:20:45,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-01-10 06:20:45,676 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 06:20:45,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:20:45,677 INFO L85 PathProgramCache]: Analyzing trace with hash 645174707, now seen corresponding path program 1 times [2025-01-10 06:20:45,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:20:45,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874870756] [2025-01-10 06:20:45,677 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:20:45,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:20:45,780 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 333 statements into 1 equivalence classes. [2025-01-10 06:20:45,856 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 333 of 333 statements. [2025-01-10 06:20:45,856 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:20:45,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:20:47,745 INFO L134 CoverageAnalysis]: Checked inductivity of 482 backedges. 0 proven. 478 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 06:20:47,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:20:47,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874870756] [2025-01-10 06:20:47,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874870756] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:20:47,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1841728615] [2025-01-10 06:20:47,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:20:47,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:20:47,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:20:47,752 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:20:47,754 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-10 06:20:48,103 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 333 statements into 1 equivalence classes. [2025-01-10 06:20:48,303 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 333 of 333 statements. [2025-01-10 06:20:48,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:20:48,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:20:48,311 INFO L256 TraceCheckSpWp]: Trace formula consists of 1715 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-01-10 06:20:48,321 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:20:48,859 INFO L134 CoverageAnalysis]: Checked inductivity of 482 backedges. 0 proven. 478 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 06:20:48,859 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:20:49,317 INFO L134 CoverageAnalysis]: Checked inductivity of 482 backedges. 0 proven. 478 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 06:20:49,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1841728615] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:20:49,317 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:20:49,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 27 [2025-01-10 06:20:49,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831781353] [2025-01-10 06:20:49,318 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:20:49,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-01-10 06:20:49,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:20:49,320 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-01-10 06:20:49,320 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=258, Invalid=498, Unknown=0, NotChecked=0, Total=756 [2025-01-10 06:20:49,320 INFO L87 Difference]: Start difference. First operand 1391 states and 1955 transitions. Second operand has 28 states, 27 states have (on average 24.62962962962963) internal successors, (665), 28 states have internal predecessors, (665), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-10 06:20:49,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:20:49,643 INFO L93 Difference]: Finished difference Result 1996 states and 2816 transitions. [2025-01-10 06:20:49,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-01-10 06:20:49,644 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 24.62962962962963) internal successors, (665), 28 states have internal predecessors, (665), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 333 [2025-01-10 06:20:49,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:20:49,651 INFO L225 Difference]: With dead ends: 1996 [2025-01-10 06:20:49,651 INFO L226 Difference]: Without dead ends: 1995 [2025-01-10 06:20:49,652 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 680 GetRequests, 649 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 380 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=338, Invalid=718, Unknown=0, NotChecked=0, Total=1056 [2025-01-10 06:20:49,653 INFO L435 NwaCegarLoop]: 370 mSDtfsCounter, 2792 mSDsluCounter, 4736 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2815 SdHoareTripleChecker+Valid, 5106 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 06:20:49,653 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2815 Valid, 5106 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 06:20:49,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1995 states. [2025-01-10 06:20:49,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1995 to 1985. [2025-01-10 06:20:49,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1985 states, 1950 states have (on average 1.4015384615384616) internal successors, (2733), 1953 states have internal predecessors, (2733), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-01-10 06:20:49,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1985 states to 1985 states and 2793 transitions. [2025-01-10 06:20:49,707 INFO L78 Accepts]: Start accepts. Automaton has 1985 states and 2793 transitions. Word has length 333 [2025-01-10 06:20:49,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:20:49,708 INFO L471 AbstractCegarLoop]: Abstraction has 1985 states and 2793 transitions. [2025-01-10 06:20:49,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 24.62962962962963) internal successors, (665), 28 states have internal predecessors, (665), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-10 06:20:49,708 INFO L276 IsEmpty]: Start isEmpty. Operand 1985 states and 2793 transitions. [2025-01-10 06:20:49,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2025-01-10 06:20:49,712 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:20:49,713 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:20:49,725 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-01-10 06:20:49,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-01-10 06:20:49,918 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 06:20:49,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:20:49,918 INFO L85 PathProgramCache]: Analyzing trace with hash -1474420500, now seen corresponding path program 1 times [2025-01-10 06:20:49,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:20:49,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397292425] [2025-01-10 06:20:49,919 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:20:49,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:20:50,018 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 334 statements into 1 equivalence classes. [2025-01-10 06:20:50,092 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 334 of 334 statements. [2025-01-10 06:20:50,092 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:20:50,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:20:51,584 INFO L134 CoverageAnalysis]: Checked inductivity of 486 backedges. 0 proven. 482 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 06:20:51,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:20:51,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397292425] [2025-01-10 06:20:51,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397292425] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:20:51,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1073395978] [2025-01-10 06:20:51,585 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:20:51,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:20:51,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:20:51,587 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:20:51,588 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-10 06:20:51,924 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 334 statements into 1 equivalence classes. [2025-01-10 06:20:52,100 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 334 of 334 statements. [2025-01-10 06:20:52,101 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:20:52,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:20:52,108 INFO L256 TraceCheckSpWp]: Trace formula consists of 1716 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-01-10 06:20:52,113 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:20:52,571 INFO L134 CoverageAnalysis]: Checked inductivity of 486 backedges. 0 proven. 482 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 06:20:52,571 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:20:52,933 INFO L134 CoverageAnalysis]: Checked inductivity of 486 backedges. 0 proven. 482 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 06:20:52,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1073395978] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:20:52,934 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:20:52,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 27 [2025-01-10 06:20:52,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571168442] [2025-01-10 06:20:52,934 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:20:52,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-01-10 06:20:52,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:20:52,936 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-01-10 06:20:52,936 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=258, Invalid=498, Unknown=0, NotChecked=0, Total=756 [2025-01-10 06:20:52,936 INFO L87 Difference]: Start difference. First operand 1985 states and 2793 transitions. Second operand has 28 states, 27 states have (on average 24.74074074074074) internal successors, (668), 28 states have internal predecessors, (668), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-10 06:20:53,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:20:53,190 INFO L93 Difference]: Finished difference Result 1996 states and 2810 transitions. [2025-01-10 06:20:53,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-01-10 06:20:53,191 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 24.74074074074074) internal successors, (668), 28 states have internal predecessors, (668), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 334 [2025-01-10 06:20:53,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:20:53,197 INFO L225 Difference]: With dead ends: 1996 [2025-01-10 06:20:53,197 INFO L226 Difference]: Without dead ends: 1995 [2025-01-10 06:20:53,198 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 682 GetRequests, 651 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 380 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=338, Invalid=718, Unknown=0, NotChecked=0, Total=1056 [2025-01-10 06:20:53,198 INFO L435 NwaCegarLoop]: 414 mSDtfsCounter, 3831 mSDsluCounter, 4694 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3854 SdHoareTripleChecker+Valid, 5108 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 06:20:53,199 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3854 Valid, 5108 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 06:20:53,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1995 states. [2025-01-10 06:20:53,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1995 to 1986. [2025-01-10 06:20:53,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1986 states, 1951 states have (on average 1.398769861609431) internal successors, (2729), 1954 states have internal predecessors, (2729), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-01-10 06:20:53,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1986 states to 1986 states and 2789 transitions. [2025-01-10 06:20:53,236 INFO L78 Accepts]: Start accepts. Automaton has 1986 states and 2789 transitions. Word has length 334 [2025-01-10 06:20:53,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:20:53,236 INFO L471 AbstractCegarLoop]: Abstraction has 1986 states and 2789 transitions. [2025-01-10 06:20:53,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 24.74074074074074) internal successors, (668), 28 states have internal predecessors, (668), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-10 06:20:53,237 INFO L276 IsEmpty]: Start isEmpty. Operand 1986 states and 2789 transitions. [2025-01-10 06:20:53,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 567 [2025-01-10 06:20:53,245 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:20:53,245 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:20:53,254 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-01-10 06:20:53,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:20:53,449 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 06:20:53,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:20:53,449 INFO L85 PathProgramCache]: Analyzing trace with hash -1635728442, now seen corresponding path program 2 times [2025-01-10 06:20:53,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:20:53,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744334560] [2025-01-10 06:20:53,450 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:20:53,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:20:53,566 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 566 statements into 2 equivalence classes. [2025-01-10 06:20:53,758 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 566 of 566 statements. [2025-01-10 06:20:53,759 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 06:20:53,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:20:55,024 INFO L134 CoverageAnalysis]: Checked inductivity of 1637 backedges. 0 proven. 1633 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 06:20:55,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:20:55,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744334560] [2025-01-10 06:20:55,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744334560] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:20:55,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [708553879] [2025-01-10 06:20:55,025 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:20:55,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:20:55,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:20:55,027 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:20:55,028 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-01-10 06:20:55,474 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 566 statements into 2 equivalence classes. [2025-01-10 06:20:55,742 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 566 of 566 statements. [2025-01-10 06:20:55,742 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 06:20:55,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:20:55,754 INFO L256 TraceCheckSpWp]: Trace formula consists of 2814 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-10 06:20:55,760 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:20:56,195 INFO L134 CoverageAnalysis]: Checked inductivity of 1637 backedges. 0 proven. 1633 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 06:20:56,195 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:20:56,721 INFO L134 CoverageAnalysis]: Checked inductivity of 1637 backedges. 0 proven. 1633 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 06:20:56,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [708553879] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:20:56,721 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:20:56,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2025-01-10 06:20:56,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402867138] [2025-01-10 06:20:56,721 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:20:56,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-01-10 06:20:56,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:20:56,723 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-01-10 06:20:56,723 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2025-01-10 06:20:56,723 INFO L87 Difference]: Start difference. First operand 1986 states and 2789 transitions. Second operand has 23 states, 23 states have (on average 35.17391304347826) internal successors, (809), 23 states have internal predecessors, (809), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-01-10 06:20:56,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:20:56,891 INFO L93 Difference]: Finished difference Result 1991 states and 2794 transitions. [2025-01-10 06:20:56,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-01-10 06:20:56,891 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 35.17391304347826) internal successors, (809), 23 states have internal predecessors, (809), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 566 [2025-01-10 06:20:56,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:20:56,897 INFO L225 Difference]: With dead ends: 1991 [2025-01-10 06:20:56,898 INFO L226 Difference]: Without dead ends: 1986 [2025-01-10 06:20:56,898 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1147 GetRequests, 1115 SyntacticMatches, 11 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 310 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2025-01-10 06:20:56,898 INFO L435 NwaCegarLoop]: 329 mSDtfsCounter, 4377 mSDsluCounter, 3885 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4403 SdHoareTripleChecker+Valid, 4214 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 06:20:56,899 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4403 Valid, 4214 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 06:20:56,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1986 states. [2025-01-10 06:20:56,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1986 to 1986. [2025-01-10 06:20:56,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1986 states, 1951 states have (on average 1.3972321886212198) internal successors, (2726), 1954 states have internal predecessors, (2726), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-01-10 06:20:56,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1986 states to 1986 states and 2786 transitions. [2025-01-10 06:20:56,929 INFO L78 Accepts]: Start accepts. Automaton has 1986 states and 2786 transitions. Word has length 566 [2025-01-10 06:20:56,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:20:56,931 INFO L471 AbstractCegarLoop]: Abstraction has 1986 states and 2786 transitions. [2025-01-10 06:20:56,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 35.17391304347826) internal successors, (809), 23 states have internal predecessors, (809), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-01-10 06:20:56,932 INFO L276 IsEmpty]: Start isEmpty. Operand 1986 states and 2786 transitions. [2025-01-10 06:20:56,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 801 [2025-01-10 06:20:56,937 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:20:56,937 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:20:56,949 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-01-10 06:20:57,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-01-10 06:20:57,138 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 06:20:57,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:20:57,138 INFO L85 PathProgramCache]: Analyzing trace with hash -1785759143, now seen corresponding path program 3 times [2025-01-10 06:20:57,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:20:57,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958384641] [2025-01-10 06:20:57,138 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 06:20:57,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:20:57,302 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 800 statements into 12 equivalence classes. [2025-01-10 06:20:57,342 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 83 of 800 statements. [2025-01-10 06:20:57,345 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-10 06:20:57,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:20:57,514 INFO L134 CoverageAnalysis]: Checked inductivity of 3506 backedges. 638 proven. 0 refuted. 0 times theorem prover too weak. 2868 trivial. 0 not checked. [2025-01-10 06:20:57,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:20:57,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958384641] [2025-01-10 06:20:57,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958384641] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:20:57,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:20:57,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 06:20:57,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804872746] [2025-01-10 06:20:57,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:20:57,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 06:20:57,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:20:57,517 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 06:20:57,517 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-10 06:20:57,517 INFO L87 Difference]: Start difference. First operand 1986 states and 2786 transitions. Second operand has 6 states, 6 states have (on average 27.5) internal successors, (165), 6 states have internal predecessors, (165), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 06:20:57,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:20:57,948 INFO L93 Difference]: Finished difference Result 4221 states and 5893 transitions. [2025-01-10 06:20:57,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:20:57,948 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 27.5) internal successors, (165), 6 states have internal predecessors, (165), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 800 [2025-01-10 06:20:57,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:20:57,956 INFO L225 Difference]: With dead ends: 4221 [2025-01-10 06:20:57,956 INFO L226 Difference]: Without dead ends: 2326 [2025-01-10 06:20:57,959 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-10 06:20:57,961 INFO L435 NwaCegarLoop]: 276 mSDtfsCounter, 14 mSDsluCounter, 557 mSDsCounter, 0 mSdLazyCounter, 621 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 833 SdHoareTripleChecker+Invalid, 622 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 621 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-10 06:20:57,961 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 833 Invalid, 622 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 621 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-10 06:20:57,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2326 states. [2025-01-10 06:20:57,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2326 to 2276. [2025-01-10 06:20:57,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2276 states, 2241 states have (on average 1.3770638107987505) internal successors, (3086), 2244 states have internal predecessors, (3086), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-01-10 06:20:57,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2276 states to 2276 states and 3146 transitions. [2025-01-10 06:20:57,997 INFO L78 Accepts]: Start accepts. Automaton has 2276 states and 3146 transitions. Word has length 800 [2025-01-10 06:20:57,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:20:57,998 INFO L471 AbstractCegarLoop]: Abstraction has 2276 states and 3146 transitions. [2025-01-10 06:20:57,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.5) internal successors, (165), 6 states have internal predecessors, (165), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 06:20:57,998 INFO L276 IsEmpty]: Start isEmpty. Operand 2276 states and 3146 transitions. [2025-01-10 06:20:58,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 811 [2025-01-10 06:20:58,004 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:20:58,004 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:20:58,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-10 06:20:58,004 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 06:20:58,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:20:58,005 INFO L85 PathProgramCache]: Analyzing trace with hash -1531007699, now seen corresponding path program 1 times [2025-01-10 06:20:58,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:20:58,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526499910] [2025-01-10 06:20:58,005 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:20:58,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:20:58,203 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 810 statements into 1 equivalence classes. [2025-01-10 06:20:58,413 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 810 of 810 statements. [2025-01-10 06:20:58,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:20:58,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:20:59,106 INFO L134 CoverageAnalysis]: Checked inductivity of 3551 backedges. 343 proven. 0 refuted. 0 times theorem prover too weak. 3208 trivial. 0 not checked. [2025-01-10 06:20:59,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:20:59,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526499910] [2025-01-10 06:20:59,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526499910] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:20:59,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:20:59,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-10 06:20:59,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226204473] [2025-01-10 06:20:59,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:20:59,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 06:20:59,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:20:59,107 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 06:20:59,107 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-10 06:20:59,108 INFO L87 Difference]: Start difference. First operand 2276 states and 3146 transitions. Second operand has 7 states, 7 states have (on average 19.0) internal successors, (133), 7 states have internal predecessors, (133), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 06:20:59,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:20:59,501 INFO L93 Difference]: Finished difference Result 4557 states and 6329 transitions. [2025-01-10 06:20:59,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 06:20:59,501 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.0) internal successors, (133), 7 states have internal predecessors, (133), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 810 [2025-01-10 06:20:59,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:20:59,506 INFO L225 Difference]: With dead ends: 4557 [2025-01-10 06:20:59,506 INFO L226 Difference]: Without dead ends: 2406 [2025-01-10 06:20:59,509 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-10 06:20:59,510 INFO L435 NwaCegarLoop]: 269 mSDtfsCounter, 15 mSDsluCounter, 733 mSDsCounter, 0 mSdLazyCounter, 743 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 1002 SdHoareTripleChecker+Invalid, 744 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 743 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-10 06:20:59,510 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 1002 Invalid, 744 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 743 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-10 06:20:59,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2406 states. [2025-01-10 06:20:59,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2406 to 2376. [2025-01-10 06:20:59,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2376 states, 2341 states have (on average 1.382315249893208) internal successors, (3236), 2344 states have internal predecessors, (3236), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-01-10 06:20:59,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2376 states to 2376 states and 3296 transitions. [2025-01-10 06:20:59,573 INFO L78 Accepts]: Start accepts. Automaton has 2376 states and 3296 transitions. Word has length 810 [2025-01-10 06:20:59,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:20:59,574 INFO L471 AbstractCegarLoop]: Abstraction has 2376 states and 3296 transitions. [2025-01-10 06:20:59,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.0) internal successors, (133), 7 states have internal predecessors, (133), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 06:20:59,574 INFO L276 IsEmpty]: Start isEmpty. Operand 2376 states and 3296 transitions. [2025-01-10 06:20:59,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 811 [2025-01-10 06:20:59,579 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:20:59,580 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:20:59,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-10 06:20:59,580 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 06:20:59,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:20:59,581 INFO L85 PathProgramCache]: Analyzing trace with hash -1155215531, now seen corresponding path program 1 times [2025-01-10 06:20:59,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:20:59,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247335535] [2025-01-10 06:20:59,581 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:20:59,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:20:59,730 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 810 statements into 1 equivalence classes.