./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_BER_nondet_test4-3.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_BER_nondet_test4-3.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 87dd09ebbd7004650762949ef44f5f810b259dfe76e04f61193dc727167eb435 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 06:11:38,324 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 06:11:38,406 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:11:38,415 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 06:11:38,415 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 06:11:38,438 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 06:11:38,439 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 06:11:38,439 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 06:11:38,439 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 06:11:38,440 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 06:11:38,440 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 06:11:38,441 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 06:11:38,441 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 06:11:38,441 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 06:11:38,442 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 06:11:38,442 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 06:11:38,442 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 06:11:38,442 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 06:11:38,442 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 06:11:38,442 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 06:11:38,443 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 06:11:38,443 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 06:11:38,443 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 06:11:38,443 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 06:11:38,443 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 06:11:38,443 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 06:11:38,443 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 06:11:38,443 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 06:11:38,443 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 06:11:38,443 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 06:11:38,444 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 06:11:38,444 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 06:11:38,444 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 06:11:38,444 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 06:11:38,444 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:11:38,444 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 06:11:38,444 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 06:11:38,444 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 06:11:38,444 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 06:11:38,444 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:11:38,444 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 06:11:38,445 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 06:11:38,445 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 06:11:38,445 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 06:11:38,446 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 06:11:38,446 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 06:11:38,446 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 06:11:38,446 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 06:11:38,446 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 06:11:38,446 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 06:11:38,446 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 -> 87dd09ebbd7004650762949ef44f5f810b259dfe76e04f61193dc727167eb435 [2025-01-10 06:11:38,773 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 06:11:38,785 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 06:11:38,787 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 06:11:38,788 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 06:11:38,789 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 06:11:38,790 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_BER_nondet_test4-3.i [2025-01-10 06:11:40,057 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1746f19d0/907c0ef0c43b48e3a84614b154360c0a/FLAGf91778d5d [2025-01-10 06:11:40,451 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 06:11:40,452 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_nondet_test4-3.i [2025-01-10 06:11:40,468 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1746f19d0/907c0ef0c43b48e3a84614b154360c0a/FLAGf91778d5d [2025-01-10 06:11:40,483 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1746f19d0/907c0ef0c43b48e3a84614b154360c0a [2025-01-10 06:11:40,487 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 06:11:40,488 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 06:11:40,489 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 06:11:40,489 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 06:11:40,495 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 06:11:40,495 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:11:40" (1/1) ... [2025-01-10 06:11:40,496 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7382e96d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:11:40, skipping insertion in model container [2025-01-10 06:11:40,497 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:11:40" (1/1) ... [2025-01-10 06:11:40,537 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 06:11:40,946 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 06:11:40,961 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 06:11:41,080 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 06:11:41,111 INFO L204 MainTranslator]: Completed translation [2025-01-10 06:11:41,112 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:11:41 WrapperNode [2025-01-10 06:11:41,112 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 06:11:41,113 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 06:11:41,113 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 06:11:41,113 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 06:11:41,120 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:11:41" (1/1) ... [2025-01-10 06:11:41,148 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:11:41" (1/1) ... [2025-01-10 06:11:41,219 INFO L138 Inliner]: procedures = 176, calls = 425, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1813 [2025-01-10 06:11:41,219 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 06:11:41,220 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 06:11:41,220 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 06:11:41,220 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 06:11:41,228 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:11:41" (1/1) ... [2025-01-10 06:11:41,229 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:11:41" (1/1) ... [2025-01-10 06:11:41,253 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:11:41" (1/1) ... [2025-01-10 06:11:41,424 INFO L175 MemorySlicer]: Split 403 memory accesses to 2 slices as follows [2, 401]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 98 writes are split as follows [0, 98]. [2025-01-10 06:11:41,429 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:11:41" (1/1) ... [2025-01-10 06:11:41,429 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:11:41" (1/1) ... [2025-01-10 06:11:41,487 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:11:41" (1/1) ... [2025-01-10 06:11:41,494 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:11:41" (1/1) ... [2025-01-10 06:11:41,515 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:11:41" (1/1) ... [2025-01-10 06:11:41,522 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:11:41" (1/1) ... [2025-01-10 06:11:41,538 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:11:41" (1/1) ... [2025-01-10 06:11:41,556 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 06:11:41,558 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 06:11:41,558 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 06:11:41,559 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 06:11:41,560 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:11:41" (1/1) ... [2025-01-10 06:11:41,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:11:41,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:11:41,593 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:11:41,600 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:11:41,624 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 06:11:41,624 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-10 06:11:41,625 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 06:11:41,625 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-10 06:11:41,625 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-01-10 06:11:41,625 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-01-10 06:11:41,626 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-01-10 06:11:41,626 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-01-10 06:11:41,626 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-10 06:11:41,626 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 06:11:41,626 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-10 06:11:41,626 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-10 06:11:41,626 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-10 06:11:41,626 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-10 06:11:41,626 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-10 06:11:41,626 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 06:11:41,627 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 06:11:41,627 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 06:11:41,627 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 06:11:41,879 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 06:11:41,881 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 06:11:43,699 INFO L? ?]: Removed 421 outVars from TransFormulas that were not future-live. [2025-01-10 06:11:43,700 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 06:11:43,717 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 06:11:43,720 INFO L312 CfgBuilder]: Removed 36 assume(true) statements. [2025-01-10 06:11:43,721 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:11:43 BoogieIcfgContainer [2025-01-10 06:11:43,721 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 06:11:43,723 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 06:11:43,723 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 06:11:43,728 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 06:11:43,728 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 06:11:40" (1/3) ... [2025-01-10 06:11:43,729 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5bcab759 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:11:43, skipping insertion in model container [2025-01-10 06:11:43,729 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:11:41" (2/3) ... [2025-01-10 06:11:43,730 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5bcab759 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:11:43, skipping insertion in model container [2025-01-10 06:11:43,730 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:11:43" (3/3) ... [2025-01-10 06:11:43,731 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_BER_nondet_test4-3.i [2025-01-10 06:11:43,743 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 06:11:43,744 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_BER_nondet_test4-3.i that has 3 procedures, 471 locations, 1 initial locations, 45 loop locations, and 4 error locations. [2025-01-10 06:11:43,811 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 06:11:43,821 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;@2d4295ba, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 06:11:43,822 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-01-10 06:11:43,829 INFO L276 IsEmpty]: Start isEmpty. Operand has 467 states, 455 states have (on average 1.6131868131868132) internal successors, (734), 459 states have internal predecessors, (734), 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:11:43,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-01-10 06:11:43,833 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:11:43,834 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:11:43,834 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-01-10 06:11:43,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:11:43,840 INFO L85 PathProgramCache]: Analyzing trace with hash -699598054, now seen corresponding path program 1 times [2025-01-10 06:11:43,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:11:43,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272125741] [2025-01-10 06:11:43,848 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:11:43,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:11:43,934 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 06:11:43,952 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 06:11:43,952 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:11:43,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:11:44,004 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:11:44,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:11:44,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272125741] [2025-01-10 06:11:44,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272125741] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:11:44,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:11:44,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 06:11:44,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146258201] [2025-01-10 06:11:44,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:11:44,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-10 06:11:44,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:11:44,031 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-10 06:11:44,031 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-10 06:11:44,034 INFO L87 Difference]: Start difference. First operand has 467 states, 455 states have (on average 1.6131868131868132) internal successors, (734), 459 states have internal predecessors, (734), 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) Second operand has 2 states, 1 states have (on average 7.0) internal successors, (7), 2 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:11:44,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:11:44,136 INFO L93 Difference]: Finished difference Result 929 states and 1487 transitions. [2025-01-10 06:11:44,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-10 06:11:44,137 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 7.0) internal successors, (7), 2 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:11:44,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:11:44,149 INFO L225 Difference]: With dead ends: 929 [2025-01-10 06:11:44,150 INFO L226 Difference]: Without dead ends: 396 [2025-01-10 06:11:44,156 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-10 06:11:44,158 INFO L435 NwaCegarLoop]: 665 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 665 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 06:11:44,161 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 665 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:11:44,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2025-01-10 06:11:44,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 396. [2025-01-10 06:11:44,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 386 states have (on average 1.4455958549222798) internal successors, (558), 388 states have internal predecessors, (558), 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:11:44,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 570 transitions. [2025-01-10 06:11:44,237 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 570 transitions. Word has length 7 [2025-01-10 06:11:44,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:11:44,238 INFO L471 AbstractCegarLoop]: Abstraction has 396 states and 570 transitions. [2025-01-10 06:11:44,238 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 7.0) internal successors, (7), 2 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:11:44,238 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 570 transitions. [2025-01-10 06:11:44,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-01-10 06:11:44,239 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:11:44,239 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:11:44,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 06:11:44,240 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-01-10 06:11:44,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:11:44,241 INFO L85 PathProgramCache]: Analyzing trace with hash -212703126, now seen corresponding path program 1 times [2025-01-10 06:11:44,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:11:44,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995580358] [2025-01-10 06:11:44,241 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:11:44,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:11:44,260 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 06:11:44,279 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 06:11:44,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:11:44,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-10 06:11:44,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [327310707] [2025-01-10 06:11:44,286 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:11:44,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:11:44,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:11:44,289 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:11:44,291 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:11:44,486 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 06:11:44,499 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 06:11:44,499 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:11:44,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:11:44,502 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 06:11:44,507 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:11:44,530 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:11:44,531 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 06:11:44,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:11:44,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995580358] [2025-01-10 06:11:44,532 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-10 06:11:44,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [327310707] [2025-01-10 06:11:44,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [327310707] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:11:44,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:11:44,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:11:44,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085943676] [2025-01-10 06:11:44,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:11:44,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:11:44,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:11:44,534 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:11:44,534 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:11:44,534 INFO L87 Difference]: Start difference. First operand 396 states and 570 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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:11:44,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:11:44,615 INFO L93 Difference]: Finished difference Result 781 states and 1129 transitions. [2025-01-10 06:11:44,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:11:44,618 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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 8 [2025-01-10 06:11:44,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:11:44,622 INFO L225 Difference]: With dead ends: 781 [2025-01-10 06:11:44,622 INFO L226 Difference]: Without dead ends: 780 [2025-01-10 06:11:44,623 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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:11:44,623 INFO L435 NwaCegarLoop]: 655 mSDtfsCounter, 541 mSDsluCounter, 561 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 547 SdHoareTripleChecker+Valid, 1216 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 06:11:44,624 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [547 Valid, 1216 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:11:44,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 780 states. [2025-01-10 06:11:44,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 780 to 401. [2025-01-10 06:11:44,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 401 states, 391 states have (on average 1.4398976982097187) internal successors, (563), 393 states have internal predecessors, (563), 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:11:44,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 575 transitions. [2025-01-10 06:11:44,660 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 575 transitions. Word has length 8 [2025-01-10 06:11:44,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:11:44,660 INFO L471 AbstractCegarLoop]: Abstraction has 401 states and 575 transitions. [2025-01-10 06:11:44,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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:11:44,661 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 575 transitions. [2025-01-10 06:11:44,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-01-10 06:11:44,666 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:11:44,666 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11:44,674 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:11:44,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:11:44,868 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-01-10 06:11:44,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:11:44,869 INFO L85 PathProgramCache]: Analyzing trace with hash -1546571738, now seen corresponding path program 1 times [2025-01-10 06:11:44,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:11:44,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238609774] [2025-01-10 06:11:44,869 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:11:44,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:11:44,979 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-01-10 06:11:45,008 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-01-10 06:11:45,011 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:11:45,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:11:45,655 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:11:45,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:11:45,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238609774] [2025-01-10 06:11:45,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238609774] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:11:45,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:11:45,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 06:11:45,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024606611] [2025-01-10 06:11:45,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:11:45,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:11:45,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:11:45,657 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:11:45,657 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:11:45,657 INFO L87 Difference]: Start difference. First operand 401 states and 575 transitions. Second operand has 4 states, 4 states have (on average 37.5) internal successors, (150), 4 states have internal predecessors, (150), 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:11:45,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:11:45,755 INFO L93 Difference]: Finished difference Result 797 states and 1145 transitions. [2025-01-10 06:11:45,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:11:45,756 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 37.5) internal successors, (150), 4 states have internal predecessors, (150), 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 150 [2025-01-10 06:11:45,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:11:45,758 INFO L225 Difference]: With dead ends: 797 [2025-01-10 06:11:45,758 INFO L226 Difference]: Without dead ends: 404 [2025-01-10 06:11:45,759 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:11:45,759 INFO L435 NwaCegarLoop]: 543 mSDtfsCounter, 105 mSDsluCounter, 993 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 1536 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:11:45,760 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 1536 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 06:11:45,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2025-01-10 06:11:45,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 401. [2025-01-10 06:11:45,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 401 states, 391 states have (on average 1.421994884910486) internal successors, (556), 393 states have internal predecessors, (556), 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:11:45,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 568 transitions. [2025-01-10 06:11:45,773 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 568 transitions. Word has length 150 [2025-01-10 06:11:45,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:11:45,774 INFO L471 AbstractCegarLoop]: Abstraction has 401 states and 568 transitions. [2025-01-10 06:11:45,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.5) internal successors, (150), 4 states have internal predecessors, (150), 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:11:45,774 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 568 transitions. [2025-01-10 06:11:45,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-01-10 06:11:45,777 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:11:45,777 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11:45,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 06:11:45,778 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-01-10 06:11:45,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:11:45,778 INFO L85 PathProgramCache]: Analyzing trace with hash -926309222, now seen corresponding path program 1 times [2025-01-10 06:11:45,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:11:45,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343646803] [2025-01-10 06:11:45,778 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:11:45,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:11:45,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-01-10 06:11:45,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-01-10 06:11:45,905 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:11:45,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:11:46,103 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:11:46,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:11:46,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343646803] [2025-01-10 06:11:46,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343646803] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:11:46,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:11:46,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:11:46,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732200192] [2025-01-10 06:11:46,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:11:46,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:11:46,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:11:46,107 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:11:46,107 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:11:46,108 INFO L87 Difference]: Start difference. First operand 401 states and 568 transitions. Second operand has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 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:11:46,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:11:46,173 INFO L93 Difference]: Finished difference Result 920 states and 1314 transitions. [2025-01-10 06:11:46,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:11:46,176 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 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 150 [2025-01-10 06:11:46,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:11:46,181 INFO L225 Difference]: With dead ends: 920 [2025-01-10 06:11:46,181 INFO L226 Difference]: Without dead ends: 527 [2025-01-10 06:11:46,182 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:11:46,183 INFO L435 NwaCegarLoop]: 562 mSDtfsCounter, 134 mSDsluCounter, 554 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 1116 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 06:11:46,185 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 1116 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:11:46,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2025-01-10 06:11:46,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 527. [2025-01-10 06:11:46,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 527 states, 517 states have (on average 1.4332688588007736) internal successors, (741), 519 states have internal predecessors, (741), 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:11:46,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 753 transitions. [2025-01-10 06:11:46,211 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 753 transitions. Word has length 150 [2025-01-10 06:11:46,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:11:46,211 INFO L471 AbstractCegarLoop]: Abstraction has 527 states and 753 transitions. [2025-01-10 06:11:46,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 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:11:46,211 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 753 transitions. [2025-01-10 06:11:46,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-01-10 06:11:46,218 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:11:46,219 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11:46,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 06:11:46,220 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-01-10 06:11:46,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:11:46,220 INFO L85 PathProgramCache]: Analyzing trace with hash 1947826921, now seen corresponding path program 1 times [2025-01-10 06:11:46,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:11:46,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807836176] [2025-01-10 06:11:46,221 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:11:46,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:11:46,321 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-01-10 06:11:46,362 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-01-10 06:11:46,366 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:11:46,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:11:46,630 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:11:46,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:11:46,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807836176] [2025-01-10 06:11:46,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807836176] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:11:46,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:11:46,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:11:46,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688001070] [2025-01-10 06:11:46,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:11:46,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:11:46,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:11:46,635 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:11:46,637 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:11:46,637 INFO L87 Difference]: Start difference. First operand 527 states and 753 transitions. Second operand has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 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:11:46,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:11:46,735 INFO L93 Difference]: Finished difference Result 940 states and 1343 transitions. [2025-01-10 06:11:46,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:11:46,735 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 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 165 [2025-01-10 06:11:46,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:11:46,738 INFO L225 Difference]: With dead ends: 940 [2025-01-10 06:11:46,743 INFO L226 Difference]: Without dead ends: 547 [2025-01-10 06:11:46,744 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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:11:46,744 INFO L435 NwaCegarLoop]: 543 mSDtfsCounter, 8 mSDsluCounter, 528 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 1071 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 06:11:46,747 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 1071 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 06:11:46,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2025-01-10 06:11:46,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 547. [2025-01-10 06:11:46,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 547 states, 537 states have (on average 1.4171322160148976) internal successors, (761), 539 states have internal predecessors, (761), 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:11:46,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 773 transitions. [2025-01-10 06:11:46,793 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 773 transitions. Word has length 165 [2025-01-10 06:11:46,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:11:46,794 INFO L471 AbstractCegarLoop]: Abstraction has 547 states and 773 transitions. [2025-01-10 06:11:46,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 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:11:46,794 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 773 transitions. [2025-01-10 06:11:46,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-01-10 06:11:46,796 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:11:46,796 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11:46,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 06:11:46,797 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-01-10 06:11:46,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:11:46,798 INFO L85 PathProgramCache]: Analyzing trace with hash -1811667219, now seen corresponding path program 1 times [2025-01-10 06:11:46,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:11:46,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730738049] [2025-01-10 06:11:46,798 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:11:46,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:11:46,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-01-10 06:11:46,897 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-01-10 06:11:46,897 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:11:46,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:11:47,197 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:11:47,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:11:47,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730738049] [2025-01-10 06:11:47,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730738049] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:11:47,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:11:47,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 06:11:47,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997040809] [2025-01-10 06:11:47,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:11:47,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:11:47,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:11:47,200 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:11:47,200 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:11:47,200 INFO L87 Difference]: Start difference. First operand 547 states and 773 transitions. Second operand has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 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:11:47,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:11:47,288 INFO L93 Difference]: Finished difference Result 898 states and 1264 transitions. [2025-01-10 06:11:47,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 06:11:47,289 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 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 165 [2025-01-10 06:11:47,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:11:47,292 INFO L225 Difference]: With dead ends: 898 [2025-01-10 06:11:47,292 INFO L226 Difference]: Without dead ends: 485 [2025-01-10 06:11:47,293 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:11:47,293 INFO L435 NwaCegarLoop]: 459 mSDtfsCounter, 32 mSDsluCounter, 904 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 1363 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 06:11:47,294 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 1363 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 06:11:47,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2025-01-10 06:11:47,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 485. [2025-01-10 06:11:47,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 485 states, 475 states have (on average 1.391578947368421) internal successors, (661), 477 states have internal predecessors, (661), 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:11:47,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 673 transitions. [2025-01-10 06:11:47,311 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 673 transitions. Word has length 165 [2025-01-10 06:11:47,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:11:47,311 INFO L471 AbstractCegarLoop]: Abstraction has 485 states and 673 transitions. [2025-01-10 06:11:47,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 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:11:47,312 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 673 transitions. [2025-01-10 06:11:47,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-01-10 06:11:47,313 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:11:47,314 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11:47,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 06:11:47,314 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-01-10 06:11:47,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:11:47,315 INFO L85 PathProgramCache]: Analyzing trace with hash -288587361, now seen corresponding path program 1 times [2025-01-10 06:11:47,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:11:47,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005949190] [2025-01-10 06:11:47,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:11:47,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:11:47,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-01-10 06:11:47,437 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-01-10 06:11:47,438 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:11:47,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:11:47,633 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:11:47,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:11:47,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005949190] [2025-01-10 06:11:47,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005949190] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:11:47,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:11:47,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:11:47,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250381749] [2025-01-10 06:11:47,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:11:47,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:11:47,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:11:47,634 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:11:47,637 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:11:47,637 INFO L87 Difference]: Start difference. First operand 485 states and 673 transitions. Second operand has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 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:11:47,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:11:47,691 INFO L93 Difference]: Finished difference Result 981 states and 1347 transitions. [2025-01-10 06:11:47,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:11:47,693 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 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 165 [2025-01-10 06:11:47,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:11:47,698 INFO L225 Difference]: With dead ends: 981 [2025-01-10 06:11:47,699 INFO L226 Difference]: Without dead ends: 630 [2025-01-10 06:11:47,700 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:11:47,701 INFO L435 NwaCegarLoop]: 479 mSDtfsCounter, 243 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 950 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 06:11:47,702 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [244 Valid, 950 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:11:47,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2025-01-10 06:11:47,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 630. [2025-01-10 06:11:47,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 630 states, 617 states have (on average 1.3743922204213939) internal successors, (848), 619 states have internal predecessors, (848), 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:11:47,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 630 states and 866 transitions. [2025-01-10 06:11:47,730 INFO L78 Accepts]: Start accepts. Automaton has 630 states and 866 transitions. Word has length 165 [2025-01-10 06:11:47,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:11:47,731 INFO L471 AbstractCegarLoop]: Abstraction has 630 states and 866 transitions. [2025-01-10 06:11:47,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 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:11:47,732 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 866 transitions. [2025-01-10 06:11:47,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-01-10 06:11:47,733 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:11:47,734 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11:47,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 06:11:47,734 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-01-10 06:11:47,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:11:47,735 INFO L85 PathProgramCache]: Analyzing trace with hash -981800990, now seen corresponding path program 1 times [2025-01-10 06:11:47,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:11:47,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990662929] [2025-01-10 06:11:47,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:11:47,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:11:47,829 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-01-10 06:11:47,875 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-01-10 06:11:47,875 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:11:47,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:11:48,147 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-10 06:11:48,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:11:48,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990662929] [2025-01-10 06:11:48,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990662929] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:11:48,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:11:48,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:11:48,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752124457] [2025-01-10 06:11:48,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:11:48,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:11:48,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:11:48,149 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:11:48,149 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:11:48,150 INFO L87 Difference]: Start difference. First operand 630 states and 866 transitions. Second operand has 4 states, 3 states have (on average 54.333333333333336) internal successors, (163), 4 states have internal predecessors, (163), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-10 06:11:48,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:11:48,201 INFO L93 Difference]: Finished difference Result 696 states and 952 transitions. [2025-01-10 06:11:48,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:11:48,202 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 54.333333333333336) internal successors, (163), 4 states have internal predecessors, (163), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 180 [2025-01-10 06:11:48,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:11:48,206 INFO L225 Difference]: With dead ends: 696 [2025-01-10 06:11:48,206 INFO L226 Difference]: Without dead ends: 694 [2025-01-10 06:11:48,207 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:11:48,207 INFO L435 NwaCegarLoop]: 516 mSDtfsCounter, 295 mSDsluCounter, 983 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 297 SdHoareTripleChecker+Valid, 1499 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 06:11:48,207 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [297 Valid, 1499 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:11:48,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 694 states. [2025-01-10 06:11:48,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 694 to 694. [2025-01-10 06:11:48,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 694 states, 678 states have (on average 1.3657817109144543) internal successors, (926), 680 states have internal predecessors, (926), 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:11:48,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 694 states to 694 states and 950 transitions. [2025-01-10 06:11:48,228 INFO L78 Accepts]: Start accepts. Automaton has 694 states and 950 transitions. Word has length 180 [2025-01-10 06:11:48,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:11:48,229 INFO L471 AbstractCegarLoop]: Abstraction has 694 states and 950 transitions. [2025-01-10 06:11:48,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 54.333333333333336) internal successors, (163), 4 states have internal predecessors, (163), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-10 06:11:48,229 INFO L276 IsEmpty]: Start isEmpty. Operand 694 states and 950 transitions. [2025-01-10 06:11:48,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2025-01-10 06:11:48,231 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:11:48,231 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11:48,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 06:11:48,232 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-01-10 06:11:48,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:11:48,232 INFO L85 PathProgramCache]: Analyzing trace with hash -470442647, now seen corresponding path program 1 times [2025-01-10 06:11:48,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:11:48,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21586984] [2025-01-10 06:11:48,232 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:11:48,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:11:48,304 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-01-10 06:11:48,984 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-01-10 06:11:48,984 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:11:48,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:11:49,321 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-10 06:11:49,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:11:49,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21586984] [2025-01-10 06:11:49,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21586984] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:11:49,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1787071393] [2025-01-10 06:11:49,322 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:11:49,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:11:49,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:11:49,325 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:11:49,327 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:11:49,727 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-01-10 06:11:50,027 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-01-10 06:11:50,027 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:11:50,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:11:50,034 INFO L256 TraceCheckSpWp]: Trace formula consists of 1038 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-01-10 06:11:50,044 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:11:50,085 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-10 06:11:50,122 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2025-01-10 06:11:51,126 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-10 06:11:51,126 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 06:11:51,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1787071393] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:11:51,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 06:11:51,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [4] total 14 [2025-01-10 06:11:51,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901275989] [2025-01-10 06:11:51,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:11:51,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-10 06:11:51,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:11:51,129 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-10 06:11:51,130 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2025-01-10 06:11:51,130 INFO L87 Difference]: Start difference. First operand 694 states and 950 transitions. Second operand has 12 states, 12 states have (on average 14.083333333333334) internal successors, (169), 12 states have internal predecessors, (169), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-10 06:11:54,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:11:54,433 INFO L93 Difference]: Finished difference Result 1349 states and 1840 transitions. [2025-01-10 06:11:54,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-10 06:11:54,434 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 14.083333333333334) internal successors, (169), 12 states have internal predecessors, (169), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 186 [2025-01-10 06:11:54,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:11:54,438 INFO L225 Difference]: With dead ends: 1349 [2025-01-10 06:11:54,438 INFO L226 Difference]: Without dead ends: 742 [2025-01-10 06:11:54,440 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=110, Invalid=352, Unknown=0, NotChecked=0, Total=462 [2025-01-10 06:11:54,440 INFO L435 NwaCegarLoop]: 474 mSDtfsCounter, 719 mSDsluCounter, 2475 mSDsCounter, 0 mSdLazyCounter, 1005 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 724 SdHoareTripleChecker+Valid, 2949 SdHoareTripleChecker+Invalid, 1013 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1005 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2025-01-10 06:11:54,441 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [724 Valid, 2949 Invalid, 1013 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1005 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2025-01-10 06:11:54,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 742 states. [2025-01-10 06:11:54,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 742 to 719. [2025-01-10 06:11:54,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 719 states, 703 states have (on average 1.3598862019914653) internal successors, (956), 705 states have internal predecessors, (956), 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:11:54,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 719 states to 719 states and 980 transitions. [2025-01-10 06:11:54,464 INFO L78 Accepts]: Start accepts. Automaton has 719 states and 980 transitions. Word has length 186 [2025-01-10 06:11:54,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:11:54,464 INFO L471 AbstractCegarLoop]: Abstraction has 719 states and 980 transitions. [2025-01-10 06:11:54,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 14.083333333333334) internal successors, (169), 12 states have internal predecessors, (169), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-10 06:11:54,465 INFO L276 IsEmpty]: Start isEmpty. Operand 719 states and 980 transitions. [2025-01-10 06:11:54,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2025-01-10 06:11:54,469 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:11:54,470 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11:54,483 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-10 06:11:54,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:11:54,670 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-01-10 06:11:54,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:11:54,671 INFO L85 PathProgramCache]: Analyzing trace with hash -1818276197, now seen corresponding path program 1 times [2025-01-10 06:11:54,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:11:54,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489965777] [2025-01-10 06:11:54,671 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:11:54,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:11:54,746 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-01-10 06:11:55,249 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-01-10 06:11:55,250 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:11:55,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:11:55,518 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-10 06:11:55,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:11:55,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489965777] [2025-01-10 06:11:55,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489965777] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:11:55,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [446929858] [2025-01-10 06:11:55,519 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:11:55,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:11:55,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:11:55,523 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:11:55,525 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:11:55,865 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-01-10 06:11:56,197 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-01-10 06:11:56,197 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:11:56,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:11:56,206 INFO L256 TraceCheckSpWp]: Trace formula consists of 1039 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-01-10 06:11:56,216 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:11:56,280 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-10 06:11:56,281 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 06:11:56,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [446929858] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:11:56,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 06:11:56,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-01-10 06:11:56,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25684805] [2025-01-10 06:11:56,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:11:56,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:11:56,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:11:56,282 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:11:56,282 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-10 06:11:56,282 INFO L87 Difference]: Start difference. First operand 719 states and 980 transitions. Second operand has 4 states, 4 states have (on average 42.5) internal successors, (170), 4 states have internal predecessors, (170), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-10 06:11:56,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:11:56,536 INFO L93 Difference]: Finished difference Result 1369 states and 1867 transitions. [2025-01-10 06:11:56,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:11:56,537 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 42.5) internal successors, (170), 4 states have internal predecessors, (170), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 187 [2025-01-10 06:11:56,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:11:56,541 INFO L225 Difference]: With dead ends: 1369 [2025-01-10 06:11:56,542 INFO L226 Difference]: Without dead ends: 762 [2025-01-10 06:11:56,543 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-10 06:11:56,543 INFO L435 NwaCegarLoop]: 471 mSDtfsCounter, 17 mSDsluCounter, 752 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 1223 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-10 06:11:56,544 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 1223 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-10 06:11:56,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 762 states. [2025-01-10 06:11:56,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 762 to 746. [2025-01-10 06:11:56,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 746 states, 730 states have (on average 1.3547945205479452) internal successors, (989), 732 states have internal predecessors, (989), 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:11:56,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 746 states to 746 states and 1013 transitions. [2025-01-10 06:11:56,567 INFO L78 Accepts]: Start accepts. Automaton has 746 states and 1013 transitions. Word has length 187 [2025-01-10 06:11:56,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:11:56,567 INFO L471 AbstractCegarLoop]: Abstraction has 746 states and 1013 transitions. [2025-01-10 06:11:56,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 42.5) internal successors, (170), 4 states have internal predecessors, (170), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-10 06:11:56,567 INFO L276 IsEmpty]: Start isEmpty. Operand 746 states and 1013 transitions. [2025-01-10 06:11:56,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2025-01-10 06:11:56,569 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:11:56,570 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11:56,583 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:11:56,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:11:56,774 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-01-10 06:11:56,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:11:56,775 INFO L85 PathProgramCache]: Analyzing trace with hash -1329958418, now seen corresponding path program 1 times [2025-01-10 06:11:56,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:11:56,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473056545] [2025-01-10 06:11:56,776 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:11:56,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:11:56,845 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-01-10 06:11:56,886 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-01-10 06:11:56,886 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:11:56,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:11:57,280 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-10 06:11:57,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:11:57,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473056545] [2025-01-10 06:11:57,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473056545] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:11:57,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:11:57,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 06:11:57,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255566823] [2025-01-10 06:11:57,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:11:57,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 06:11:57,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:11:57,282 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 06:11:57,283 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-10 06:11:57,283 INFO L87 Difference]: Start difference. First operand 746 states and 1013 transitions. Second operand has 6 states, 6 states have (on average 28.5) internal successors, (171), 6 states have internal predecessors, (171), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-10 06:11:57,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:11:57,791 INFO L93 Difference]: Finished difference Result 1388 states and 1886 transitions. [2025-01-10 06:11:57,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:11:57,793 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 28.5) internal successors, (171), 6 states have internal predecessors, (171), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 188 [2025-01-10 06:11:57,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:11:57,797 INFO L225 Difference]: With dead ends: 1388 [2025-01-10 06:11:57,798 INFO L226 Difference]: Without dead ends: 758 [2025-01-10 06:11:57,799 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-10 06:11:57,800 INFO L435 NwaCegarLoop]: 470 mSDtfsCounter, 8 mSDsluCounter, 1337 mSDsCounter, 0 mSdLazyCounter, 596 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 1807 SdHoareTripleChecker+Invalid, 597 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 596 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-10 06:11:57,800 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 1807 Invalid, 597 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 596 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-10 06:11:57,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 758 states. [2025-01-10 06:11:57,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 758 to 754. [2025-01-10 06:11:57,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 754 states, 738 states have (on average 1.353658536585366) internal successors, (999), 740 states have internal predecessors, (999), 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:11:57,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 1023 transitions. [2025-01-10 06:11:57,827 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 1023 transitions. Word has length 188 [2025-01-10 06:11:57,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:11:57,827 INFO L471 AbstractCegarLoop]: Abstraction has 754 states and 1023 transitions. [2025-01-10 06:11:57,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.5) internal successors, (171), 6 states have internal predecessors, (171), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-10 06:11:57,827 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 1023 transitions. [2025-01-10 06:11:57,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2025-01-10 06:11:57,830 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:11:57,830 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11:57,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-10 06:11:57,831 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-01-10 06:11:57,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:11:57,831 INFO L85 PathProgramCache]: Analyzing trace with hash -845637086, now seen corresponding path program 1 times [2025-01-10 06:11:57,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:11:57,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115196059] [2025-01-10 06:11:57,832 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:11:57,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:11:57,911 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 189 statements into 1 equivalence classes. [2025-01-10 06:11:57,955 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 189 of 189 statements. [2025-01-10 06:11:57,955 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:11:57,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:11:58,318 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-10 06:11:58,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:11:58,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115196059] [2025-01-10 06:11:58,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115196059] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:11:58,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:11:58,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-10 06:11:58,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678647423] [2025-01-10 06:11:58,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:11:58,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 06:11:58,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:11:58,322 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 06:11:58,322 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-10 06:11:58,323 INFO L87 Difference]: Start difference. First operand 754 states and 1023 transitions. Second operand has 7 states, 7 states have (on average 24.571428571428573) internal successors, (172), 7 states have internal predecessors, (172), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-10 06:11:58,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:11:58,928 INFO L93 Difference]: Finished difference Result 1403 states and 1906 transitions. [2025-01-10 06:11:58,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 06:11:58,929 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.571428571428573) internal successors, (172), 7 states have internal predecessors, (172), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 189 [2025-01-10 06:11:58,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:11:58,933 INFO L225 Difference]: With dead ends: 1403 [2025-01-10 06:11:58,933 INFO L226 Difference]: Without dead ends: 776 [2025-01-10 06:11:58,935 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:11:58,935 INFO L435 NwaCegarLoop]: 460 mSDtfsCounter, 12 mSDsluCounter, 1678 mSDsCounter, 0 mSdLazyCounter, 746 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 2138 SdHoareTripleChecker+Invalid, 747 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 746 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-10 06:11:58,935 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 2138 Invalid, 747 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 746 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-10 06:11:58,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 776 states. [2025-01-10 06:11:58,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 776 to 770. [2025-01-10 06:11:58,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 770 states, 754 states have (on average 1.3541114058355437) internal successors, (1021), 756 states have internal predecessors, (1021), 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:11:58,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 770 states to 770 states and 1045 transitions. [2025-01-10 06:11:58,967 INFO L78 Accepts]: Start accepts. Automaton has 770 states and 1045 transitions. Word has length 189 [2025-01-10 06:11:58,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:11:58,967 INFO L471 AbstractCegarLoop]: Abstraction has 770 states and 1045 transitions. [2025-01-10 06:11:58,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.571428571428573) internal successors, (172), 7 states have internal predecessors, (172), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-10 06:11:58,968 INFO L276 IsEmpty]: Start isEmpty. Operand 770 states and 1045 transitions. [2025-01-10 06:11:58,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2025-01-10 06:11:58,971 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:11:58,971 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11:58,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-10 06:11:58,971 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-01-10 06:11:58,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:11:58,972 INFO L85 PathProgramCache]: Analyzing trace with hash -1202105154, now seen corresponding path program 1 times [2025-01-10 06:11:58,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:11:58,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537388747] [2025-01-10 06:11:58,972 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:11:58,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:11:59,045 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 189 statements into 1 equivalence classes. [2025-01-10 06:11:59,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 189 of 189 statements. [2025-01-10 06:11:59,672 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:11:59,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:11:59,895 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-10 06:11:59,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:11:59,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537388747] [2025-01-10 06:11:59,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537388747] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:11:59,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1074513804] [2025-01-10 06:11:59,895 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:11:59,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:11:59,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:11:59,898 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:11:59,900 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:12:00,295 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 189 statements into 1 equivalence classes. [2025-01-10 06:12:00,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 189 of 189 statements. [2025-01-10 06:12:00,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:12:00,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:12:00,573 INFO L256 TraceCheckSpWp]: Trace formula consists of 1038 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-10 06:12:00,581 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:12:02,326 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-10 06:12:02,326 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 06:12:02,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1074513804] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:12:02,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 06:12:02,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [4] total 9 [2025-01-10 06:12:02,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655335476] [2025-01-10 06:12:02,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:12:02,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 06:12:02,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:12:02,329 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 06:12:02,329 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-10 06:12:02,329 INFO L87 Difference]: Start difference. First operand 770 states and 1045 transitions. Second operand has 7 states, 7 states have (on average 24.571428571428573) internal successors, (172), 7 states have internal predecessors, (172), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-10 06:12:02,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:12:02,888 INFO L93 Difference]: Finished difference Result 1419 states and 1927 transitions. [2025-01-10 06:12:02,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 06:12:02,889 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.571428571428573) internal successors, (172), 7 states have internal predecessors, (172), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 189 [2025-01-10 06:12:02,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:12:02,892 INFO L225 Difference]: With dead ends: 1419 [2025-01-10 06:12:02,892 INFO L226 Difference]: Without dead ends: 784 [2025-01-10 06:12:02,893 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-10 06:12:02,895 INFO L435 NwaCegarLoop]: 466 mSDtfsCounter, 12 mSDsluCounter, 1679 mSDsCounter, 0 mSdLazyCounter, 771 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 2145 SdHoareTripleChecker+Invalid, 772 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 771 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-10 06:12:02,895 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 2145 Invalid, 772 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 771 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-10 06:12:02,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 784 states. [2025-01-10 06:12:02,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 784 to 770. [2025-01-10 06:12:02,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 770 states, 754 states have (on average 1.3541114058355437) internal successors, (1021), 756 states have internal predecessors, (1021), 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:12:02,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 770 states to 770 states and 1045 transitions. [2025-01-10 06:12:02,918 INFO L78 Accepts]: Start accepts. Automaton has 770 states and 1045 transitions. Word has length 189 [2025-01-10 06:12:02,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:12:02,920 INFO L471 AbstractCegarLoop]: Abstraction has 770 states and 1045 transitions. [2025-01-10 06:12:02,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.571428571428573) internal successors, (172), 7 states have internal predecessors, (172), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-10 06:12:02,920 INFO L276 IsEmpty]: Start isEmpty. Operand 770 states and 1045 transitions. [2025-01-10 06:12:02,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2025-01-10 06:12:02,922 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:12:02,923 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:02,937 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-10 06:12:03,124 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,SelfDestructingSolverStorable12 [2025-01-10 06:12:03,124 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-01-10 06:12:03,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:12:03,125 INFO L85 PathProgramCache]: Analyzing trace with hash -287837478, now seen corresponding path program 1 times [2025-01-10 06:12:03,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:12:03,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327360002] [2025-01-10 06:12:03,125 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:12:03,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:12:03,190 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-01-10 06:12:03,228 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-01-10 06:12:03,228 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:12:03,228 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:12:03,626 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-10 06:12:03,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:12:03,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327360002] [2025-01-10 06:12:03,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327360002] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:12:03,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:12:03,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-10 06:12:03,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010004085] [2025-01-10 06:12:03,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:12:03,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-10 06:12:03,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:12:03,629 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-10 06:12:03,629 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-01-10 06:12:03,630 INFO L87 Difference]: Start difference. First operand 770 states and 1045 transitions. Second operand has 9 states, 9 states have (on average 19.22222222222222) internal successors, (173), 9 states have internal predecessors, (173), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-10 06:12:04,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:12:04,219 INFO L93 Difference]: Finished difference Result 1426 states and 1933 transitions. [2025-01-10 06:12:04,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 06:12:04,220 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 19.22222222222222) internal successors, (173), 9 states have internal predecessors, (173), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 190 [2025-01-10 06:12:04,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:12:04,224 INFO L225 Difference]: With dead ends: 1426 [2025-01-10 06:12:04,224 INFO L226 Difference]: Without dead ends: 796 [2025-01-10 06:12:04,225 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-01-10 06:12:04,226 INFO L435 NwaCegarLoop]: 460 mSDtfsCounter, 20 mSDsluCounter, 2172 mSDsCounter, 0 mSdLazyCounter, 775 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 2632 SdHoareTripleChecker+Invalid, 776 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 775 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-10 06:12:04,227 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 2632 Invalid, 776 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 775 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-10 06:12:04,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 796 states. [2025-01-10 06:12:04,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 796 to 784. [2025-01-10 06:12:04,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 784 states, 768 states have (on average 1.3528645833333333) internal successors, (1039), 770 states have internal predecessors, (1039), 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:12:04,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 1063 transitions. [2025-01-10 06:12:04,248 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 1063 transitions. Word has length 190 [2025-01-10 06:12:04,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:12:04,248 INFO L471 AbstractCegarLoop]: Abstraction has 784 states and 1063 transitions. [2025-01-10 06:12:04,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 19.22222222222222) internal successors, (173), 9 states have internal predecessors, (173), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-10 06:12:04,249 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 1063 transitions. [2025-01-10 06:12:04,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2025-01-10 06:12:04,251 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:12:04,251 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:04,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-10 06:12:04,251 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-01-10 06:12:04,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:12:04,251 INFO L85 PathProgramCache]: Analyzing trace with hash 1546554302, now seen corresponding path program 1 times [2025-01-10 06:12:04,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:12:04,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916164731] [2025-01-10 06:12:04,252 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:12:04,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:12:04,316 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-01-10 06:12:04,873 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-01-10 06:12:04,874 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:12:04,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:12:05,126 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-10 06:12:05,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:12:05,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916164731] [2025-01-10 06:12:05,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916164731] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:12:05,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1913296719] [2025-01-10 06:12:05,127 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:12:05,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:12:05,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:12:05,134 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:12:05,147 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:12:05,567 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-01-10 06:12:05,769 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-01-10 06:12:05,769 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:12:05,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:12:05,787 INFO L256 TraceCheckSpWp]: Trace formula consists of 1039 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-01-10 06:12:05,799 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:12:06,002 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-10 06:12:06,005 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 06:12:06,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1913296719] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:12:06,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 06:12:06,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [4] total 10 [2025-01-10 06:12:06,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625282864] [2025-01-10 06:12:06,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:12:06,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-10 06:12:06,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:12:06,008 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-10 06:12:06,008 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-01-10 06:12:06,008 INFO L87 Difference]: Start difference. First operand 784 states and 1063 transitions. Second operand has 8 states, 8 states have (on average 21.625) internal successors, (173), 8 states have internal predecessors, (173), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-10 06:12:06,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:12:06,685 INFO L93 Difference]: Finished difference Result 1447 states and 1960 transitions. [2025-01-10 06:12:06,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 06:12:06,686 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 21.625) internal successors, (173), 8 states have internal predecessors, (173), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 190 [2025-01-10 06:12:06,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:12:06,690 INFO L225 Difference]: With dead ends: 1447 [2025-01-10 06:12:06,690 INFO L226 Difference]: Without dead ends: 810 [2025-01-10 06:12:06,691 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-01-10 06:12:06,692 INFO L435 NwaCegarLoop]: 470 mSDtfsCounter, 17 mSDsluCounter, 2053 mSDsCounter, 0 mSdLazyCounter, 917 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 2523 SdHoareTripleChecker+Invalid, 917 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 917 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-10 06:12:06,692 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 2523 Invalid, 917 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 917 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-10 06:12:06,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 810 states. [2025-01-10 06:12:06,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 810 to 794. [2025-01-10 06:12:06,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 794 states, 778 states have (on average 1.3508997429305913) internal successors, (1051), 780 states have internal predecessors, (1051), 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:12:06,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 1075 transitions. [2025-01-10 06:12:06,714 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 1075 transitions. Word has length 190 [2025-01-10 06:12:06,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:12:06,714 INFO L471 AbstractCegarLoop]: Abstraction has 794 states and 1075 transitions. [2025-01-10 06:12:06,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 21.625) internal successors, (173), 8 states have internal predecessors, (173), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-10 06:12:06,715 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 1075 transitions. [2025-01-10 06:12:06,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2025-01-10 06:12:06,717 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:12:06,717 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:06,730 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-01-10 06:12:06,918 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,SelfDestructingSolverStorable14 [2025-01-10 06:12:06,918 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-01-10 06:12:06,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:12:06,918 INFO L85 PathProgramCache]: Analyzing trace with hash -1706043762, now seen corresponding path program 1 times [2025-01-10 06:12:06,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:12:06,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207146607] [2025-01-10 06:12:06,919 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:12:06,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:12:06,983 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-01-10 06:12:07,019 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-01-10 06:12:07,020 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:12:07,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:12:07,514 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-10 06:12:07,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:12:07,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207146607] [2025-01-10 06:12:07,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207146607] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:12:07,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:12:07,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-10 06:12:07,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523849965] [2025-01-10 06:12:07,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:12:07,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-10 06:12:07,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:12:07,516 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-10 06:12:07,517 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-01-10 06:12:07,517 INFO L87 Difference]: Start difference. First operand 794 states and 1075 transitions. Second operand has 10 states, 10 states have (on average 17.4) internal successors, (174), 10 states have internal predecessors, (174), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-10 06:12:08,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:12:08,319 INFO L93 Difference]: Finished difference Result 1459 states and 1976 transitions. [2025-01-10 06:12:08,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 06:12:08,320 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 17.4) internal successors, (174), 10 states have internal predecessors, (174), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 191 [2025-01-10 06:12:08,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:12:08,323 INFO L225 Difference]: With dead ends: 1459 [2025-01-10 06:12:08,323 INFO L226 Difference]: Without dead ends: 812 [2025-01-10 06:12:08,324 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-01-10 06:12:08,325 INFO L435 NwaCegarLoop]: 467 mSDtfsCounter, 23 mSDsluCounter, 2748 mSDsCounter, 0 mSdLazyCounter, 1239 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 3215 SdHoareTripleChecker+Invalid, 1240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-10 06:12:08,326 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 3215 Invalid, 1240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1239 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-10 06:12:08,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 812 states. [2025-01-10 06:12:08,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 812 to 800. [2025-01-10 06:12:08,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 800 states, 784 states have (on average 1.3482142857142858) internal successors, (1057), 786 states have internal predecessors, (1057), 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:12:08,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 1081 transitions. [2025-01-10 06:12:08,347 INFO L78 Accepts]: Start accepts. Automaton has 800 states and 1081 transitions. Word has length 191 [2025-01-10 06:12:08,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:12:08,347 INFO L471 AbstractCegarLoop]: Abstraction has 800 states and 1081 transitions. [2025-01-10 06:12:08,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 17.4) internal successors, (174), 10 states have internal predecessors, (174), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-10 06:12:08,348 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 1081 transitions. [2025-01-10 06:12:08,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2025-01-10 06:12:08,350 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:12:08,350 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:08,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-10 06:12:08,351 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-01-10 06:12:08,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:12:08,352 INFO L85 PathProgramCache]: Analyzing trace with hash -674473430, now seen corresponding path program 1 times [2025-01-10 06:12:08,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:12:08,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638698435] [2025-01-10 06:12:08,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:12:08,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:12:08,416 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-01-10 06:12:08,814 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-01-10 06:12:08,814 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:12:08,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:12:09,036 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-10 06:12:09,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:12:09,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638698435] [2025-01-10 06:12:09,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638698435] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:12:09,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [750620263] [2025-01-10 06:12:09,038 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:12:09,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:12:09,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:12:09,040 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:12:09,042 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:12:09,482 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-01-10 06:12:09,731 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-01-10 06:12:09,731 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:12:09,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:12:09,736 INFO L256 TraceCheckSpWp]: Trace formula consists of 1040 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-10 06:12:09,740 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:12:09,778 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-10 06:12:09,779 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 06:12:09,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [750620263] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:12:09,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 06:12:09,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [4] total 6 [2025-01-10 06:12:09,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825679853] [2025-01-10 06:12:09,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:12:09,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 06:12:09,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:12:09,780 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 06:12:09,780 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-10 06:12:09,780 INFO L87 Difference]: Start difference. First operand 800 states and 1081 transitions. Second operand has 5 states, 5 states have (on average 35.4) internal successors, (177), 5 states have internal predecessors, (177), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-10 06:12:09,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:12:09,864 INFO L93 Difference]: Finished difference Result 1413 states and 1915 transitions. [2025-01-10 06:12:09,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 06:12:09,864 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 35.4) internal successors, (177), 5 states have internal predecessors, (177), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 191 [2025-01-10 06:12:09,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:12:09,869 INFO L225 Difference]: With dead ends: 1413 [2025-01-10 06:12:09,869 INFO L226 Difference]: Without dead ends: 803 [2025-01-10 06:12:09,871 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-10 06:12:09,871 INFO L435 NwaCegarLoop]: 513 mSDtfsCounter, 449 mSDsluCounter, 1486 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 457 SdHoareTripleChecker+Valid, 1999 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 06:12:09,871 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [457 Valid, 1999 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 06:12:09,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 803 states. [2025-01-10 06:12:09,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 803 to 803. [2025-01-10 06:12:09,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 803 states, 786 states have (on average 1.3486005089058524) internal successors, (1060), 789 states have internal predecessors, (1060), 12 states have call successors, (12), 1 states have call predecessors, (12), 2 states have return successors, (16), 12 states have call predecessors, (16), 12 states have call successors, (16) [2025-01-10 06:12:09,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 803 states and 1088 transitions. [2025-01-10 06:12:09,896 INFO L78 Accepts]: Start accepts. Automaton has 803 states and 1088 transitions. Word has length 191 [2025-01-10 06:12:09,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:12:09,896 INFO L471 AbstractCegarLoop]: Abstraction has 803 states and 1088 transitions. [2025-01-10 06:12:09,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 35.4) internal successors, (177), 5 states have internal predecessors, (177), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-10 06:12:09,897 INFO L276 IsEmpty]: Start isEmpty. Operand 803 states and 1088 transitions. [2025-01-10 06:12:09,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2025-01-10 06:12:09,898 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:12:09,898 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:09,913 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-01-10 06:12:10,099 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,SelfDestructingSolverStorable16 [2025-01-10 06:12:10,099 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-01-10 06:12:10,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:12:10,100 INFO L85 PathProgramCache]: Analyzing trace with hash 390723882, now seen corresponding path program 1 times [2025-01-10 06:12:10,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:12:10,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085461710] [2025-01-10 06:12:10,100 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:12:10,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:12:10,152 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-01-10 06:12:10,606 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-01-10 06:12:10,606 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:12:10,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:12:10,969 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-01-10 06:12:10,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:12:10,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085461710] [2025-01-10 06:12:10,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085461710] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:12:10,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1698784030] [2025-01-10 06:12:10,970 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:12:10,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:12:10,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:12:10,972 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:12:10,975 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:12:11,531 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-01-10 06:12:12,247 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-01-10 06:12:12,247 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:12:12,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:12:12,254 INFO L256 TraceCheckSpWp]: Trace formula consists of 1100 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-01-10 06:12:12,260 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:12:12,604 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-01-10 06:12:12,605 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 06:12:12,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1698784030] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:12:12,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 06:12:12,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [5] total 13 [2025-01-10 06:12:12,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238466491] [2025-01-10 06:12:12,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:12:12,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-10 06:12:12,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:12:12,609 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-10 06:12:12,609 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2025-01-10 06:12:12,610 INFO L87 Difference]: Start difference. First operand 803 states and 1088 transitions. Second operand has 10 states, 10 states have (on average 17.5) internal successors, (175), 10 states have internal predecessors, (175), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-10 06:12:13,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:12:13,588 INFO L93 Difference]: Finished difference Result 1480 states and 2010 transitions. [2025-01-10 06:12:13,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 06:12:13,589 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 17.5) internal successors, (175), 10 states have internal predecessors, (175), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 195 [2025-01-10 06:12:13,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:12:13,593 INFO L225 Difference]: With dead ends: 1480 [2025-01-10 06:12:13,593 INFO L226 Difference]: Without dead ends: 827 [2025-01-10 06:12:13,594 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2025-01-10 06:12:13,595 INFO L435 NwaCegarLoop]: 467 mSDtfsCounter, 17 mSDsluCounter, 2680 mSDsCounter, 0 mSdLazyCounter, 1337 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 3147 SdHoareTripleChecker+Invalid, 1339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-10 06:12:13,595 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 3147 Invalid, 1339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1337 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-10 06:12:13,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 827 states. [2025-01-10 06:12:13,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 827 to 817. [2025-01-10 06:12:13,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 817 states, 800 states have (on average 1.3475) internal successors, (1078), 803 states have internal predecessors, (1078), 12 states have call successors, (12), 1 states have call predecessors, (12), 2 states have return successors, (16), 12 states have call predecessors, (16), 12 states have call successors, (16) [2025-01-10 06:12:13,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 817 states to 817 states and 1106 transitions. [2025-01-10 06:12:13,642 INFO L78 Accepts]: Start accepts. Automaton has 817 states and 1106 transitions. Word has length 195 [2025-01-10 06:12:13,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:12:13,643 INFO L471 AbstractCegarLoop]: Abstraction has 817 states and 1106 transitions. [2025-01-10 06:12:13,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 17.5) internal successors, (175), 10 states have internal predecessors, (175), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-10 06:12:13,643 INFO L276 IsEmpty]: Start isEmpty. Operand 817 states and 1106 transitions. [2025-01-10 06:12:13,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2025-01-10 06:12:13,644 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:12:13,645 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:13,665 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:12:13,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:12:13,846 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-01-10 06:12:13,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:12:13,846 INFO L85 PathProgramCache]: Analyzing trace with hash -1393082198, now seen corresponding path program 1 times [2025-01-10 06:12:13,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:12:13,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033800555] [2025-01-10 06:12:13,847 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:12:13,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:12:13,910 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-01-10 06:12:14,789 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-01-10 06:12:14,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:12:14,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:12:15,138 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-01-10 06:12:15,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:12:15,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033800555] [2025-01-10 06:12:15,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033800555] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:12:15,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1715229793] [2025-01-10 06:12:15,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:12:15,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:12:15,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:12:15,142 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:12:15,144 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:12:15,638 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-01-10 06:12:15,866 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-01-10 06:12:15,866 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:12:15,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:12:15,872 INFO L256 TraceCheckSpWp]: Trace formula consists of 1100 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-01-10 06:12:15,875 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:12:15,951 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-01-10 06:12:15,951 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 06:12:15,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1715229793] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:12:15,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 06:12:15,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [5] total 10 [2025-01-10 06:12:15,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240509291] [2025-01-10 06:12:15,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:12:15,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 06:12:15,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:12:15,952 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 06:12:15,952 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-01-10 06:12:15,953 INFO L87 Difference]: Start difference. First operand 817 states and 1106 transitions. Second operand has 7 states, 7 states have (on average 25.0) internal successors, (175), 7 states have internal predecessors, (175), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-10 06:12:16,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:12:16,314 INFO L93 Difference]: Finished difference Result 1500 states and 2034 transitions. [2025-01-10 06:12:16,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 06:12:16,315 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 25.0) internal successors, (175), 7 states have internal predecessors, (175), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 195 [2025-01-10 06:12:16,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:12:16,317 INFO L225 Difference]: With dead ends: 1500 [2025-01-10 06:12:16,317 INFO L226 Difference]: Without dead ends: 845 [2025-01-10 06:12:16,318 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-01-10 06:12:16,319 INFO L435 NwaCegarLoop]: 455 mSDtfsCounter, 39 mSDsluCounter, 1775 mSDsCounter, 0 mSdLazyCounter, 662 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 2230 SdHoareTripleChecker+Invalid, 666 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 662 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-10 06:12:16,319 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 2230 Invalid, 666 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 662 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-10 06:12:16,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 845 states. [2025-01-10 06:12:16,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 845 to 831. [2025-01-10 06:12:16,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 831 states, 814 states have (on average 1.348894348894349) internal successors, (1098), 817 states have internal predecessors, (1098), 12 states have call successors, (12), 1 states have call predecessors, (12), 2 states have return successors, (16), 12 states have call predecessors, (16), 12 states have call successors, (16) [2025-01-10 06:12:16,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 831 states to 831 states and 1126 transitions. [2025-01-10 06:12:16,339 INFO L78 Accepts]: Start accepts. Automaton has 831 states and 1126 transitions. Word has length 195 [2025-01-10 06:12:16,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:12:16,339 INFO L471 AbstractCegarLoop]: Abstraction has 831 states and 1126 transitions. [2025-01-10 06:12:16,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.0) internal successors, (175), 7 states have internal predecessors, (175), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-10 06:12:16,340 INFO L276 IsEmpty]: Start isEmpty. Operand 831 states and 1126 transitions. [2025-01-10 06:12:16,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2025-01-10 06:12:16,341 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:12:16,342 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:16,355 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-01-10 06:12:16,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:12:16,542 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-01-10 06:12:16,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:12:16,543 INFO L85 PathProgramCache]: Analyzing trace with hash 1746275651, now seen corresponding path program 1 times [2025-01-10 06:12:16,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:12:16,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702870219] [2025-01-10 06:12:16,543 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:12:16,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:12:16,589 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-01-10 06:12:17,189 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-01-10 06:12:17,190 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:12:17,190 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:12:17,574 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-01-10 06:12:17,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:12:17,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702870219] [2025-01-10 06:12:17,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702870219] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:12:17,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [516689437] [2025-01-10 06:12:17,575 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:12:17,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:12:17,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:12:17,577 INFO L229 MonitoredProcess]: Starting monitored process 10 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:12:17,580 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-01-10 06:12:18,062 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-01-10 06:12:18,403 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-01-10 06:12:18,403 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:12:18,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:12:18,410 INFO L256 TraceCheckSpWp]: Trace formula consists of 1100 conjuncts, 167 conjuncts are in the unsatisfiable core [2025-01-10 06:12:18,421 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:12:18,444 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-01-10 06:12:18,487 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-10 06:12:18,859 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 11 [2025-01-10 06:12:18,881 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 11 [2025-01-10 06:12:18,890 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-10 06:12:18,896 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-01-10 06:12:18,903 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-10 06:12:18,923 INFO L349 Elim1Store]: treesize reduction 26, result has 35.0 percent of original size [2025-01-10 06:12:18,923 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 29 [2025-01-10 06:12:19,016 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2025-01-10 06:12:19,020 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-01-10 06:12:19,025 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-01-10 06:12:19,196 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 43 [2025-01-10 06:12:19,201 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2025-01-10 06:12:19,207 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11