./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/busybox-1.22.0/du-2.i --full-output --architecture 64bit -------------------------------------------------------------------------------- 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/busybox-1.22.0/du-2.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-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 64bit --witnessprinter.graph.data.programhash 346a1df1af8d017aad802aadc8d149a7a67e764b593bc1f05b05c788fbe74a6f --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 06:00:54,469 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 06:00:54,537 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-01-10 06:00:54,544 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 06:00:54,544 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 06:00:54,572 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 06:00:54,573 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 06:00:54,573 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 06:00:54,574 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 06:00:54,574 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 06:00:54,575 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 06:00:54,575 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 06:00:54,575 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 06:00:54,575 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 06:00:54,576 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 06:00:54,576 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 06:00:54,576 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 06:00:54,576 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 06:00:54,576 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 06:00:54,576 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 06:00:54,576 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 06:00:54,576 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 06:00:54,576 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 06:00:54,577 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 06:00:54,577 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 06:00:54,577 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 06:00:54,577 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 06:00:54,577 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 06:00:54,577 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 06:00:54,577 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 06:00:54,577 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 06:00:54,577 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:00:54,578 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 06:00:54,578 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 06:00:54,578 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 06:00:54,578 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 06:00:54,578 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:00:54,578 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 06:00:54,578 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 06:00:54,578 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 06:00:54,578 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 06:00:54,578 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 06:00:54,578 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 06:00:54,578 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 06:00:54,578 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 06:00:54,578 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 06:00:54,578 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 06:00:54,578 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 346a1df1af8d017aad802aadc8d149a7a67e764b593bc1f05b05c788fbe74a6f [2025-01-10 06:00:54,843 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 06:00:54,848 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 06:00:54,851 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 06:00:54,852 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 06:00:54,852 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 06:00:54,853 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/busybox-1.22.0/du-2.i [2025-01-10 06:00:56,096 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e7bc20305/9a9696aeadc949dd8444079c27c3488a/FLAGf823896aa [2025-01-10 06:00:56,651 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 06:00:56,652 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/du-2.i [2025-01-10 06:00:56,686 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e7bc20305/9a9696aeadc949dd8444079c27c3488a/FLAGf823896aa [2025-01-10 06:00:57,172 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e7bc20305/9a9696aeadc949dd8444079c27c3488a [2025-01-10 06:00:57,174 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 06:00:57,175 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 06:00:57,176 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 06:00:57,176 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 06:00:57,179 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 06:00:57,180 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:00:57" (1/1) ... [2025-01-10 06:00:57,180 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40123b01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:00:57, skipping insertion in model container [2025-01-10 06:00:57,180 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:00:57" (1/1) ... [2025-01-10 06:00:57,227 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 06:00:58,502 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 06:00:58,674 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 06:00:58,803 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 06:00:59,314 WARN L1212 FunctionHandler]: The following functions are not defined or handled internally: vasprintf [2025-01-10 06:00:59,330 INFO L204 MainTranslator]: Completed translation [2025-01-10 06:00:59,335 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:00:59 WrapperNode [2025-01-10 06:00:59,335 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 06:00:59,336 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 06:00:59,336 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 06:00:59,337 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 06:00:59,350 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:00:59" (1/1) ... [2025-01-10 06:00:59,494 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:00:59" (1/1) ... [2025-01-10 06:00:59,841 INFO L138 Inliner]: procedures = 670, calls = 9382, calls flagged for inlining = 35, calls inlined = 33, statements flattened = 11043 [2025-01-10 06:00:59,842 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 06:00:59,843 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 06:00:59,844 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 06:00:59,844 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 06:00:59,852 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:00:59" (1/1) ... [2025-01-10 06:00:59,852 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:00:59" (1/1) ... [2025-01-10 06:00:59,903 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:00:59" (1/1) ... [2025-01-10 06:00:59,916 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-01-10 06:00:59,917 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:00:59" (1/1) ... [2025-01-10 06:00:59,917 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:00:59" (1/1) ... [2025-01-10 06:01:00,086 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:00:59" (1/1) ... [2025-01-10 06:01:00,108 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:00:59" (1/1) ... [2025-01-10 06:01:00,122 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:00:59" (1/1) ... [2025-01-10 06:01:00,152 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:00:59" (1/1) ... [2025-01-10 06:01:00,169 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:00:59" (1/1) ... [2025-01-10 06:01:00,216 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 06:01:00,217 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 06:01:00,217 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 06:01:00,217 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 06:01:00,218 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:00:59" (1/1) ... [2025-01-10 06:01:00,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:01:00,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:01:00,253 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:01:00,258 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:01:00,278 INFO L130 BoogieDeclarations]: Found specification of procedure vasprintf [2025-01-10 06:01:00,279 INFO L138 BoogieDeclarations]: Found implementation of procedure vasprintf [2025-01-10 06:01:00,279 INFO L130 BoogieDeclarations]: Found specification of procedure du [2025-01-10 06:01:00,279 INFO L138 BoogieDeclarations]: Found implementation of procedure du [2025-01-10 06:01:00,279 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-10 06:01:00,279 INFO L130 BoogieDeclarations]: Found specification of procedure xzalloc [2025-01-10 06:01:00,279 INFO L138 BoogieDeclarations]: Found implementation of procedure xzalloc [2025-01-10 06:01:00,279 INFO L130 BoogieDeclarations]: Found specification of procedure print [2025-01-10 06:01:00,279 INFO L138 BoogieDeclarations]: Found implementation of procedure print [2025-01-10 06:01:00,279 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2025-01-10 06:01:00,279 INFO L130 BoogieDeclarations]: Found specification of procedure bb_verror_msg [2025-01-10 06:01:00,279 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_verror_msg [2025-01-10 06:01:00,280 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-01-10 06:01:00,280 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-01-10 06:01:00,280 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-10 06:01:00,280 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 06:01:00,280 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-01-10 06:01:00,280 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 06:01:00,280 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 06:01:00,282 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy [2025-01-10 06:01:00,282 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy [2025-01-10 06:01:00,282 INFO L130 BoogieDeclarations]: Found specification of procedure xmalloc [2025-01-10 06:01:00,282 INFO L138 BoogieDeclarations]: Found implementation of procedure xmalloc [2025-01-10 06:01:00,282 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2025-01-10 06:01:00,282 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2025-01-10 06:01:00,282 INFO L130 BoogieDeclarations]: Found specification of procedure bb_simple_perror_msg [2025-01-10 06:01:00,282 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_simple_perror_msg [2025-01-10 06:01:00,282 INFO L130 BoogieDeclarations]: Found specification of procedure stat [2025-01-10 06:01:00,282 INFO L138 BoogieDeclarations]: Found implementation of procedure stat [2025-01-10 06:01:00,282 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2025-01-10 06:01:00,282 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2025-01-10 06:01:00,282 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-10 06:01:00,282 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-10 06:01:00,282 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-10 06:01:00,282 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-01-10 06:01:00,282 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-01-10 06:01:00,282 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-01-10 06:01:00,282 INFO L130 BoogieDeclarations]: Found specification of procedure bb_perror_msg [2025-01-10 06:01:00,282 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_perror_msg [2025-01-10 06:01:00,282 INFO L130 BoogieDeclarations]: Found specification of procedure bb_error_msg_and_die [2025-01-10 06:01:00,282 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_error_msg_and_die [2025-01-10 06:01:00,282 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-10 06:01:00,681 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 06:01:00,683 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 06:01:22,915 INFO L? ?]: Removed 754 outVars from TransFormulas that were not future-live. [2025-01-10 06:01:22,915 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 06:01:22,941 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 06:01:22,943 INFO L312 CfgBuilder]: Removed 32 assume(true) statements. [2025-01-10 06:01:22,943 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:01:22 BoogieIcfgContainer [2025-01-10 06:01:22,944 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 06:01:22,945 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 06:01:22,945 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 06:01:22,949 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 06:01:22,949 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 06:00:57" (1/3) ... [2025-01-10 06:01:22,950 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61cca717 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:01:22, skipping insertion in model container [2025-01-10 06:01:22,950 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:00:59" (2/3) ... [2025-01-10 06:01:22,950 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61cca717 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:01:22, skipping insertion in model container [2025-01-10 06:01:22,950 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:01:22" (3/3) ... [2025-01-10 06:01:22,951 INFO L128 eAbstractionObserver]: Analyzing ICFG du-2.i [2025-01-10 06:01:22,961 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 06:01:22,964 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG du-2.i that has 14 procedures, 702 locations, 1 initial locations, 39 loop locations, and 77 error locations. [2025-01-10 06:01:23,062 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 06:01:23,070 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;@667c7f8c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 06:01:23,070 INFO L334 AbstractCegarLoop]: Starting to check reachability of 77 error locations. [2025-01-10 06:01:23,074 INFO L276 IsEmpty]: Start isEmpty. Operand has 702 states, 570 states have (on average 1.6333333333333333) internal successors, (931), 653 states have internal predecessors, (931), 41 states have call successors, (41), 13 states have call predecessors, (41), 13 states have return successors, (41), 41 states have call predecessors, (41), 41 states have call successors, (41) [2025-01-10 06:01:23,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-01-10 06:01:23,078 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:01:23,078 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-01-10 06:01:23,078 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [duErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, duErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, duErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, duErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 73 more)] === [2025-01-10 06:01:23,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:01:23,082 INFO L85 PathProgramCache]: Analyzing trace with hash 23767364, now seen corresponding path program 1 times [2025-01-10 06:01:23,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:01:23,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680433990] [2025-01-10 06:01:23,087 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:01:23,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:01:25,770 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 06:01:26,256 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 06:01:26,257 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:01:26,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:01:27,699 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:01:27,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:01:27,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680433990] [2025-01-10 06:01:27,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680433990] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:01:27,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:01:27,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:01:27,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873512852] [2025-01-10 06:01:27,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:01:27,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:01:27,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:01:27,727 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:01:27,728 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:01:27,733 INFO L87 Difference]: Start difference. First operand has 702 states, 570 states have (on average 1.6333333333333333) internal successors, (931), 653 states have internal predecessors, (931), 41 states have call successors, (41), 13 states have call predecessors, (41), 13 states have return successors, (41), 41 states have call predecessors, (41), 41 states have call successors, (41) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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:01:27,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:01:27,884 INFO L93 Difference]: Finished difference Result 1286 states and 1912 transitions. [2025-01-10 06:01:27,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:01:27,887 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 4 [2025-01-10 06:01:27,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:01:27,897 INFO L225 Difference]: With dead ends: 1286 [2025-01-10 06:01:27,897 INFO L226 Difference]: Without dead ends: 588 [2025-01-10 06:01:27,907 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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:01:27,910 INFO L435 NwaCegarLoop]: 830 mSDtfsCounter, 1 mSDsluCounter, 826 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1656 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 06:01:27,911 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1656 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:01:27,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2025-01-10 06:01:27,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 588. [2025-01-10 06:01:27,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 588 states, 493 states have (on average 1.561866125760649) internal successors, (770), 548 states have internal predecessors, (770), 36 states have call successors, (36), 13 states have call predecessors, (36), 11 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2025-01-10 06:01:28,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 835 transitions. [2025-01-10 06:01:28,010 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 835 transitions. Word has length 4 [2025-01-10 06:01:28,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:01:28,010 INFO L471 AbstractCegarLoop]: Abstraction has 588 states and 835 transitions. [2025-01-10 06:01:28,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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:01:28,011 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 835 transitions. [2025-01-10 06:01:28,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-01-10 06:01:28,011 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:01:28,011 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2025-01-10 06:01:28,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 06:01:28,011 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [duErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, duErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, duErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, duErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 73 more)] === [2025-01-10 06:01:28,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:01:28,012 INFO L85 PathProgramCache]: Analyzing trace with hash -615286516, now seen corresponding path program 1 times [2025-01-10 06:01:28,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:01:28,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69938355] [2025-01-10 06:01:28,012 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:01:28,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:01:31,103 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 06:01:31,351 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 06:01:31,351 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:01:31,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:01:32,379 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:01:32,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:01:32,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69938355] [2025-01-10 06:01:32,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69938355] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:01:32,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1548880190] [2025-01-10 06:01:32,380 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:01:32,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:01:32,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:01:32,383 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:01:32,385 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:01:35,108 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 06:01:37,518 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 06:01:37,518 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:01:37,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:01:37,610 INFO L256 TraceCheckSpWp]: Trace formula consists of 18366 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 06:01:37,623 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:01:37,648 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:01:37,648 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 06:01:37,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1548880190] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:01:37,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 06:01:37,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2025-01-10 06:01:37,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210868781] [2025-01-10 06:01:37,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:01:37,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:01:37,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:01:37,650 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:01:37,650 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:01:37,650 INFO L87 Difference]: Start difference. First operand 588 states and 835 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:01:37,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:01:37,705 INFO L93 Difference]: Finished difference Result 588 states and 835 transitions. [2025-01-10 06:01:37,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:01:37,705 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-01-10 06:01:37,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:01:37,708 INFO L225 Difference]: With dead ends: 588 [2025-01-10 06:01:37,708 INFO L226 Difference]: Without dead ends: 587 [2025-01-10 06:01:37,709 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 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:01:37,709 INFO L435 NwaCegarLoop]: 826 mSDtfsCounter, 1 mSDsluCounter, 1650 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2476 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 06:01:37,709 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2476 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:01:37,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2025-01-10 06:01:37,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 587. [2025-01-10 06:01:37,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 587 states, 493 states have (on average 1.5598377281947262) internal successors, (769), 547 states have internal predecessors, (769), 36 states have call successors, (36), 13 states have call predecessors, (36), 11 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2025-01-10 06:01:37,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 834 transitions. [2025-01-10 06:01:37,735 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 834 transitions. Word has length 7 [2025-01-10 06:01:37,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:01:37,736 INFO L471 AbstractCegarLoop]: Abstraction has 587 states and 834 transitions. [2025-01-10 06:01:37,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:01:37,736 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 834 transitions. [2025-01-10 06:01:37,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-01-10 06:01:37,736 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:01:37,736 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2025-01-10 06:01:37,783 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:01:37,942 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:01:37,942 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [duErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, duErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, duErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, duErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 73 more)] === [2025-01-10 06:01:37,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:01:37,943 INFO L85 PathProgramCache]: Analyzing trace with hash -1894012030, now seen corresponding path program 1 times [2025-01-10 06:01:37,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:01:37,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465126136] [2025-01-10 06:01:37,943 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:01:37,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:01:40,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 06:01:40,268 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 06:01:40,269 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:01:40,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:01:40,863 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 06:01:40,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:01:40,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465126136] [2025-01-10 06:01:40,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465126136] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:01:40,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:01:40,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:01:40,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57898990] [2025-01-10 06:01:40,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:01:40,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:01:40,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:01:40,864 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:01:40,864 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:01:40,865 INFO L87 Difference]: Start difference. First operand 587 states and 834 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:01:40,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:01:40,893 INFO L93 Difference]: Finished difference Result 587 states and 834 transitions. [2025-01-10 06:01:40,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:01:40,894 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:01:40,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:01:40,896 INFO L225 Difference]: With dead ends: 587 [2025-01-10 06:01:40,896 INFO L226 Difference]: Without dead ends: 586 [2025-01-10 06:01:40,896 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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:01:40,897 INFO L435 NwaCegarLoop]: 827 mSDtfsCounter, 0 mSDsluCounter, 825 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1652 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 06:01:40,897 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1652 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:01:40,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2025-01-10 06:01:40,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 584. [2025-01-10 06:01:40,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 584 states, 491 states have (on average 1.560081466395112) internal successors, (766), 544 states have internal predecessors, (766), 36 states have call successors, (36), 13 states have call predecessors, (36), 11 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2025-01-10 06:01:40,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 831 transitions. [2025-01-10 06:01:40,914 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 831 transitions. Word has length 8 [2025-01-10 06:01:40,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:01:40,914 INFO L471 AbstractCegarLoop]: Abstraction has 584 states and 831 transitions. [2025-01-10 06:01:40,914 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:01:40,914 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 831 transitions. [2025-01-10 06:01:40,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-01-10 06:01:40,914 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:01:40,915 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:01:40,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 06:01:40,915 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [duErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, duErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, duErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, duErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 73 more)] === [2025-01-10 06:01:40,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:01:40,915 INFO L85 PathProgramCache]: Analyzing trace with hash 1299610412, now seen corresponding path program 1 times [2025-01-10 06:01:40,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:01:40,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657281364] [2025-01-10 06:01:40,915 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:01:40,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:01:43,107 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 06:01:43,258 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 06:01:43,258 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:01:43,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:01:44,244 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:01:44,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:01:44,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657281364] [2025-01-10 06:01:44,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657281364] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:01:44,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1107900009] [2025-01-10 06:01:44,245 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:01:44,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:01:44,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:01:44,250 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:01:44,251 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:01:46,613 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 06:01:48,453 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 06:01:48,454 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:01:48,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:01:48,527 INFO L256 TraceCheckSpWp]: Trace formula consists of 18383 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 06:01:48,536 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:01:48,559 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 06:01:48,559 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 06:01:48,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1107900009] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:01:48,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 06:01:48,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-01-10 06:01:48,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117403123] [2025-01-10 06:01:48,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:01:48,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:01:48,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:01:48,560 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:01:48,560 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:01:48,560 INFO L87 Difference]: Start difference. First operand 584 states and 831 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 06:01:48,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:01:48,622 INFO L93 Difference]: Finished difference Result 584 states and 831 transitions. [2025-01-10 06:01:48,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:01:48,626 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2025-01-10 06:01:48,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:01:48,631 INFO L225 Difference]: With dead ends: 584 [2025-01-10 06:01:48,631 INFO L226 Difference]: Without dead ends: 582 [2025-01-10 06:01:48,634 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:01:48,634 INFO L435 NwaCegarLoop]: 820 mSDtfsCounter, 525 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 533 SdHoareTripleChecker+Valid, 1110 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 06:01:48,635 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [533 Valid, 1110 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:01:48,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2025-01-10 06:01:48,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 582. [2025-01-10 06:01:48,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 582 states, 491 states have (on average 1.5560081466395113) internal successors, (764), 542 states have internal predecessors, (764), 36 states have call successors, (36), 13 states have call predecessors, (36), 11 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2025-01-10 06:01:48,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 829 transitions. [2025-01-10 06:01:48,659 INFO L78 Accepts]: Start accepts. Automaton has 582 states and 829 transitions. Word has length 12 [2025-01-10 06:01:48,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:01:48,660 INFO L471 AbstractCegarLoop]: Abstraction has 582 states and 829 transitions. [2025-01-10 06:01:48,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 06:01:48,660 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 829 transitions. [2025-01-10 06:01:48,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-01-10 06:01:48,660 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:01:48,660 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:01:48,700 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:01:48,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:01:48,861 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [duErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, duErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, duErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, duErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 73 more)] === [2025-01-10 06:01:48,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:01:48,862 INFO L85 PathProgramCache]: Analyzing trace with hash 1633217897, now seen corresponding path program 1 times [2025-01-10 06:01:48,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:01:48,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806195547] [2025-01-10 06:01:48,862 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:01:48,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:01:51,085 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 06:01:51,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 06:01:51,211 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:01:51,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:01:52,049 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:01:52,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:01:52,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806195547] [2025-01-10 06:01:52,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806195547] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:01:52,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [161489073] [2025-01-10 06:01:52,050 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:01:52,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:01:52,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:01:52,053 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:01:52,054 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:01:54,593 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 06:01:56,687 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 06:01:56,688 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:01:56,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:01:56,774 INFO L256 TraceCheckSpWp]: Trace formula consists of 18384 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 06:01:56,785 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:01:56,800 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:01:56,801 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:01:56,833 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:01:56,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [161489073] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:01:56,833 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:01:56,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-01-10 06:01:56,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383950148] [2025-01-10 06:01:56,834 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:01:56,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 06:01:56,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:01:56,835 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 06:01:56,835 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-10 06:01:56,835 INFO L87 Difference]: Start difference. First operand 582 states and 829 transitions. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 06:01:56,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:01:56,888 INFO L93 Difference]: Finished difference Result 1167 states and 1663 transitions. [2025-01-10 06:01:56,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:01:56,889 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 13 [2025-01-10 06:01:56,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:01:56,891 INFO L225 Difference]: With dead ends: 1167 [2025-01-10 06:01:56,891 INFO L226 Difference]: Without dead ends: 591 [2025-01-10 06:01:56,892 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-10 06:01:56,894 INFO L435 NwaCegarLoop]: 825 mSDtfsCounter, 4 mSDsluCounter, 1646 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2471 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 06:01:56,894 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2471 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:01:56,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2025-01-10 06:01:56,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 591. [2025-01-10 06:01:56,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 591 states, 500 states have (on average 1.546) internal successors, (773), 551 states have internal predecessors, (773), 36 states have call successors, (36), 13 states have call predecessors, (36), 11 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2025-01-10 06:01:56,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 838 transitions. [2025-01-10 06:01:56,909 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 838 transitions. Word has length 13 [2025-01-10 06:01:56,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:01:56,909 INFO L471 AbstractCegarLoop]: Abstraction has 591 states and 838 transitions. [2025-01-10 06:01:56,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 06:01:56,909 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 838 transitions. [2025-01-10 06:01:56,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-01-10 06:01:56,909 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:01:56,909 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:01:56,954 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:01:57,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:01:57,110 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [duErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, duErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, duErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, duErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 73 more)] === [2025-01-10 06:01:57,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:01:57,111 INFO L85 PathProgramCache]: Analyzing trace with hash 876964257, now seen corresponding path program 2 times [2025-01-10 06:01:57,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:01:57,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561213894] [2025-01-10 06:01:57,111 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:01:57,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:01:59,194 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-01-10 06:01:59,446 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 10 of 22 statements. [2025-01-10 06:01:59,446 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 06:01:59,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:02:00,879 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-01-10 06:02:00,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:02:00,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561213894] [2025-01-10 06:02:00,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561213894] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:02:00,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:02:00,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 06:02:00,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347363800] [2025-01-10 06:02:00,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:02:00,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 06:02:00,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:02:00,881 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 06:02:00,881 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:02:00,881 INFO L87 Difference]: Start difference. First operand 591 states and 838 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 06:02:00,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:02:00,969 INFO L93 Difference]: Finished difference Result 591 states and 838 transitions. [2025-01-10 06:02:00,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 06:02:00,970 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2025-01-10 06:02:00,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:02:00,972 INFO L225 Difference]: With dead ends: 591 [2025-01-10 06:02:00,972 INFO L226 Difference]: Without dead ends: 589 [2025-01-10 06:02:00,972 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:02:00,973 INFO L435 NwaCegarLoop]: 812 mSDtfsCounter, 524 mSDsluCounter, 1891 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 532 SdHoareTripleChecker+Valid, 2703 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 06:02:00,973 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [532 Valid, 2703 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 06:02:00,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2025-01-10 06:02:00,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 589. [2025-01-10 06:02:00,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 589 states, 500 states have (on average 1.542) internal successors, (771), 549 states have internal predecessors, (771), 36 states have call successors, (36), 13 states have call predecessors, (36), 11 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2025-01-10 06:02:00,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 836 transitions. [2025-01-10 06:02:00,986 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 836 transitions. Word has length 22 [2025-01-10 06:02:00,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:02:00,987 INFO L471 AbstractCegarLoop]: Abstraction has 589 states and 836 transitions. [2025-01-10 06:02:00,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 06:02:00,987 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 836 transitions. [2025-01-10 06:02:00,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-01-10 06:02:00,987 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:02:00,987 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:02:00,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 06:02:00,988 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [duErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, duErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, duErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, duErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 73 more)] === [2025-01-10 06:02:00,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:02:00,988 INFO L85 PathProgramCache]: Analyzing trace with hash 460300508, now seen corresponding path program 1 times [2025-01-10 06:02:00,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:02:00,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365332898] [2025-01-10 06:02:00,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:02:00,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:02:03,236 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-10 06:02:03,409 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-10 06:02:03,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:02:03,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:02:04,257 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-01-10 06:02:04,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:02:04,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365332898] [2025-01-10 06:02:04,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365332898] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:02:04,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:02:04,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:02:04,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280967055] [2025-01-10 06:02:04,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:02:04,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:02:04,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:02:04,259 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:02:04,259 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:02:04,259 INFO L87 Difference]: Start difference. First operand 589 states and 836 transitions. Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 06:02:04,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:02:04,291 INFO L93 Difference]: Finished difference Result 1161 states and 1656 transitions. [2025-01-10 06:02:04,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:02:04,292 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2025-01-10 06:02:04,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:02:04,294 INFO L225 Difference]: With dead ends: 1161 [2025-01-10 06:02:04,294 INFO L226 Difference]: Without dead ends: 592 [2025-01-10 06:02:04,295 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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:02:04,296 INFO L435 NwaCegarLoop]: 823 mSDtfsCounter, 1 mSDsluCounter, 818 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1641 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 06:02:04,296 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1641 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:02:04,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2025-01-10 06:02:04,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 592. [2025-01-10 06:02:04,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 592 states, 503 states have (on average 1.5387673956262427) internal successors, (774), 552 states have internal predecessors, (774), 36 states have call successors, (36), 13 states have call predecessors, (36), 11 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2025-01-10 06:02:04,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 839 transitions. [2025-01-10 06:02:04,309 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 839 transitions. Word has length 27 [2025-01-10 06:02:04,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:02:04,309 INFO L471 AbstractCegarLoop]: Abstraction has 592 states and 839 transitions. [2025-01-10 06:02:04,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 06:02:04,310 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 839 transitions. [2025-01-10 06:02:04,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-01-10 06:02:04,310 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:02:04,310 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:02:04,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 06:02:04,310 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [duErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, duErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, duErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, duErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 73 more)] === [2025-01-10 06:02:04,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:02:04,311 INFO L85 PathProgramCache]: Analyzing trace with hash -1017343061, now seen corresponding path program 1 times [2025-01-10 06:02:04,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:02:04,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220233550] [2025-01-10 06:02:04,311 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:02:04,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:02:06,486 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-10 06:02:06,655 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-10 06:02:06,655 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:02:06,655 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:02:07,729 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-01-10 06:02:07,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:02:07,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220233550] [2025-01-10 06:02:07,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220233550] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:02:07,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [725010847] [2025-01-10 06:02:07,730 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:02:07,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:02:07,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:02:07,735 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:02:07,738 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:02:10,086 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-10 06:02:12,004 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-10 06:02:12,004 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:02:12,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:02:12,081 INFO L256 TraceCheckSpWp]: Trace formula consists of 18569 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-10 06:02:12,092 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:02:12,158 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 06:02:12,159 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:02:12,256 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 06:02:12,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [725010847] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:02:12,256 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:02:12,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 7, 7] total 14 [2025-01-10 06:02:12,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884722995] [2025-01-10 06:02:12,256 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:02:12,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-10 06:02:12,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:02:12,258 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-10 06:02:12,258 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2025-01-10 06:02:12,258 INFO L87 Difference]: Start difference. First operand 592 states and 839 transitions. Second operand has 14 states, 14 states have (on average 4.214285714285714) internal successors, (59), 14 states have internal predecessors, (59), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-10 06:02:12,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:02:12,392 INFO L93 Difference]: Finished difference Result 1186 states and 1686 transitions. [2025-01-10 06:02:12,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-10 06:02:12,392 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.214285714285714) internal successors, (59), 14 states have internal predecessors, (59), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 30 [2025-01-10 06:02:12,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:02:12,395 INFO L225 Difference]: With dead ends: 1186 [2025-01-10 06:02:12,395 INFO L226 Difference]: Without dead ends: 609 [2025-01-10 06:02:12,396 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2025-01-10 06:02:12,396 INFO L435 NwaCegarLoop]: 817 mSDtfsCounter, 5 mSDsluCounter, 4890 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 5707 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 06:02:12,397 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 5707 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 06:02:12,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2025-01-10 06:02:12,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 609. [2025-01-10 06:02:12,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 609 states, 521 states have (on average 1.5182341650671785) internal successors, (791), 569 states have internal predecessors, (791), 36 states have call successors, (36), 13 states have call predecessors, (36), 11 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2025-01-10 06:02:12,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 609 states to 609 states and 856 transitions. [2025-01-10 06:02:12,409 INFO L78 Accepts]: Start accepts. Automaton has 609 states and 856 transitions. Word has length 30 [2025-01-10 06:02:12,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:02:12,410 INFO L471 AbstractCegarLoop]: Abstraction has 609 states and 856 transitions. [2025-01-10 06:02:12,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.214285714285714) internal successors, (59), 14 states have internal predecessors, (59), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-10 06:02:12,410 INFO L276 IsEmpty]: Start isEmpty. Operand 609 states and 856 transitions. [2025-01-10 06:02:12,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-01-10 06:02:12,410 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:02:12,411 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:02:12,463 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-10 06:02:12,614 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,SelfDestructingSolverStorable7 [2025-01-10 06:02:12,615 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [duErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, duErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, duErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, duErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 73 more)] === [2025-01-10 06:02:12,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:02:12,615 INFO L85 PathProgramCache]: Analyzing trace with hash -517589653, now seen corresponding path program 1 times [2025-01-10 06:02:12,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:02:12,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356043515] [2025-01-10 06:02:12,616 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:02:12,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:02:14,793 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-01-10 06:02:14,932 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-01-10 06:02:14,932 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:02:14,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:02:15,651 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2025-01-10 06:02:15,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:02:15,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356043515] [2025-01-10 06:02:15,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356043515] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:02:15,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:02:15,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:02:15,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327118189] [2025-01-10 06:02:15,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:02:15,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:02:15,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:02:15,653 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:02:15,653 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:02:15,653 INFO L87 Difference]: Start difference. First operand 609 states and 856 transitions. Second operand has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 06:02:15,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:02:15,688 INFO L93 Difference]: Finished difference Result 621 states and 870 transitions. [2025-01-10 06:02:15,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:02:15,689 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 48 [2025-01-10 06:02:15,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:02:15,691 INFO L225 Difference]: With dead ends: 621 [2025-01-10 06:02:15,691 INFO L226 Difference]: Without dead ends: 619 [2025-01-10 06:02:15,692 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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:02:15,692 INFO L435 NwaCegarLoop]: 820 mSDtfsCounter, 2 mSDsluCounter, 816 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1636 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 06:02:15,692 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1636 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:02:15,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2025-01-10 06:02:15,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 618. [2025-01-10 06:02:15,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 618 states, 530 states have (on average 1.5150943396226415) internal successors, (803), 578 states have internal predecessors, (803), 36 states have call successors, (36), 13 states have call predecessors, (36), 11 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2025-01-10 06:02:15,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 868 transitions. [2025-01-10 06:02:15,704 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 868 transitions. Word has length 48 [2025-01-10 06:02:15,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:02:15,704 INFO L471 AbstractCegarLoop]: Abstraction has 618 states and 868 transitions. [2025-01-10 06:02:15,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 06:02:15,705 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 868 transitions. [2025-01-10 06:02:15,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-01-10 06:02:15,705 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:02:15,705 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:02:15,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-10 06:02:15,705 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [duErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, duErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, duErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, duErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 73 more)] === [2025-01-10 06:02:15,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:02:15,706 INFO L85 PathProgramCache]: Analyzing trace with hash 1134584794, now seen corresponding path program 1 times [2025-01-10 06:02:15,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:02:15,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956172866] [2025-01-10 06:02:15,706 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:02:15,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:02:17,899 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-01-10 06:02:18,061 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-01-10 06:02:18,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:02:18,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:02:18,686 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2025-01-10 06:02:18,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:02:18,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956172866] [2025-01-10 06:02:18,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956172866] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:02:18,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:02:18,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:02:18,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776928721] [2025-01-10 06:02:18,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:02:18,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:02:18,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:02:18,687 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:02:18,687 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:02:18,688 INFO L87 Difference]: Start difference. First operand 618 states and 868 transitions. Second operand has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 06:02:18,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:02:18,708 INFO L93 Difference]: Finished difference Result 618 states and 868 transitions. [2025-01-10 06:02:18,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:02:18,709 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 49 [2025-01-10 06:02:18,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:02:18,711 INFO L225 Difference]: With dead ends: 618 [2025-01-10 06:02:18,711 INFO L226 Difference]: Without dead ends: 617 [2025-01-10 06:02:18,711 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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:02:18,712 INFO L435 NwaCegarLoop]: 821 mSDtfsCounter, 0 mSDsluCounter, 818 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1639 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 06:02:18,712 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1639 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:02:18,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2025-01-10 06:02:18,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 613. [2025-01-10 06:02:18,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 613 states, 526 states have (on average 1.515209125475285) internal successors, (797), 573 states have internal predecessors, (797), 36 states have call successors, (36), 13 states have call predecessors, (36), 11 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2025-01-10 06:02:18,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 613 states and 862 transitions. [2025-01-10 06:02:18,724 INFO L78 Accepts]: Start accepts. Automaton has 613 states and 862 transitions. Word has length 49 [2025-01-10 06:02:18,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:02:18,725 INFO L471 AbstractCegarLoop]: Abstraction has 613 states and 862 transitions. [2025-01-10 06:02:18,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 06:02:18,725 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 862 transitions. [2025-01-10 06:02:18,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-01-10 06:02:18,725 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:02:18,725 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:02:18,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-10 06:02:18,725 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [duErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, duErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, duErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, duErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 73 more)] === [2025-01-10 06:02:18,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:02:18,726 INFO L85 PathProgramCache]: Analyzing trace with hash -435639982, now seen corresponding path program 1 times [2025-01-10 06:02:18,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:02:18,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830004678] [2025-01-10 06:02:18,726 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:02:18,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:02:21,003 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-01-10 06:02:21,205 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-01-10 06:02:21,205 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:02:21,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:02:22,460 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-10 06:02:22,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:02:22,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830004678] [2025-01-10 06:02:22,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830004678] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:02:22,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:02:22,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 06:02:22,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561526958] [2025-01-10 06:02:22,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:02:22,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:02:22,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:02:22,462 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:02:22,462 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:02:22,462 INFO L87 Difference]: Start difference. First operand 613 states and 862 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 06:02:22,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:02:22,492 INFO L93 Difference]: Finished difference Result 1171 states and 1662 transitions. [2025-01-10 06:02:22,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:02:22,493 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 50 [2025-01-10 06:02:22,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:02:22,496 INFO L225 Difference]: With dead ends: 1171 [2025-01-10 06:02:22,496 INFO L226 Difference]: Without dead ends: 615 [2025-01-10 06:02:22,497 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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:02:22,499 INFO L435 NwaCegarLoop]: 822 mSDtfsCounter, 0 mSDsluCounter, 1639 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2461 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 06:02:22,499 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2461 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:02:22,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2025-01-10 06:02:22,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 615. [2025-01-10 06:02:22,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 615 states, 528 states have (on average 1.5132575757575757) internal successors, (799), 575 states have internal predecessors, (799), 36 states have call successors, (36), 13 states have call predecessors, (36), 11 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2025-01-10 06:02:22,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 615 states to 615 states and 864 transitions. [2025-01-10 06:02:22,514 INFO L78 Accepts]: Start accepts. Automaton has 615 states and 864 transitions. Word has length 50 [2025-01-10 06:02:22,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:02:22,514 INFO L471 AbstractCegarLoop]: Abstraction has 615 states and 864 transitions. [2025-01-10 06:02:22,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 06:02:22,514 INFO L276 IsEmpty]: Start isEmpty. Operand 615 states and 864 transitions. [2025-01-10 06:02:22,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-01-10 06:02:22,517 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:02:22,517 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:02:22,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-10 06:02:22,517 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [duErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, duErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, duErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, duErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 73 more)] === [2025-01-10 06:02:22,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:02:22,518 INFO L85 PathProgramCache]: Analyzing trace with hash -433792940, now seen corresponding path program 1 times [2025-01-10 06:02:22,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:02:22,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271265648] [2025-01-10 06:02:22,518 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:02:22,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:02:24,862 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-01-10 06:02:25,019 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-01-10 06:02:25,019 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:02:25,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:02:25,780 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-10 06:02:25,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:02:25,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271265648] [2025-01-10 06:02:25,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271265648] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:02:25,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:02:25,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:02:25,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625062061] [2025-01-10 06:02:25,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:02:25,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:02:25,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:02:25,784 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:02:25,784 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:02:25,784 INFO L87 Difference]: Start difference. First operand 615 states and 864 transitions. Second operand has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 06:02:25,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:02:25,823 INFO L93 Difference]: Finished difference Result 917 states and 1305 transitions. [2025-01-10 06:02:25,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:02:25,823 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 50 [2025-01-10 06:02:25,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:02:25,827 INFO L225 Difference]: With dead ends: 917 [2025-01-10 06:02:25,827 INFO L226 Difference]: Without dead ends: 915 [2025-01-10 06:02:25,827 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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:02:25,828 INFO L435 NwaCegarLoop]: 819 mSDtfsCounter, 417 mSDsluCounter, 808 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 423 SdHoareTripleChecker+Valid, 1627 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 06:02:25,828 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [423 Valid, 1627 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:02:25,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 915 states. [2025-01-10 06:02:25,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 915 to 619. [2025-01-10 06:02:25,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 619 states, 532 states have (on average 1.5112781954887218) internal successors, (804), 579 states have internal predecessors, (804), 36 states have call successors, (36), 13 states have call predecessors, (36), 11 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2025-01-10 06:02:25,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 619 states to 619 states and 869 transitions. [2025-01-10 06:02:25,843 INFO L78 Accepts]: Start accepts. Automaton has 619 states and 869 transitions. Word has length 50 [2025-01-10 06:02:25,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:02:25,844 INFO L471 AbstractCegarLoop]: Abstraction has 619 states and 869 transitions. [2025-01-10 06:02:25,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 06:02:25,844 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 869 transitions. [2025-01-10 06:02:25,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-01-10 06:02:25,845 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:02:25,845 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:02:25,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-10 06:02:25,846 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [duErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, duErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, duErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, duErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 73 more)] === [2025-01-10 06:02:25,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:02:25,846 INFO L85 PathProgramCache]: Analyzing trace with hash 505639471, now seen corresponding path program 1 times [2025-01-10 06:02:25,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:02:25,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111385516] [2025-01-10 06:02:25,846 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:02:25,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms