./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/list-simple/sll2n_update_all.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/list-simple/sll2n_update_all.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1fd0aba5d9be2820550e57012fb4e12f76fe291bb253443319d08539e5b2ba1a --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 01:42:34,355 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 01:42:34,414 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-01-10 01:42:34,420 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 01:42:34,420 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 01:42:34,441 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 01:42:34,442 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 01:42:34,442 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 01:42:34,443 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 01:42:34,443 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 01:42:34,443 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 01:42:34,444 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 01:42:34,444 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 01:42:34,444 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 01:42:34,445 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 01:42:34,445 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 01:42:34,445 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 01:42:34,445 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 01:42:34,445 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 01:42:34,445 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 01:42:34,445 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 01:42:34,445 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 01:42:34,445 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 01:42:34,445 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 01:42:34,445 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 01:42:34,445 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 01:42:34,446 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 01:42:34,446 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 01:42:34,446 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 01:42:34,446 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 01:42:34,446 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 01:42:34,446 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:42:34,446 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:42:34,447 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:42:34,447 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:42:34,447 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 01:42:34,447 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:42:34,447 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:42:34,447 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:42:34,447 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:42:34,447 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 01:42:34,447 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 01:42:34,447 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 01:42:34,447 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 01:42:34,447 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 01:42:34,448 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 01:42:34,448 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 01:42:34,448 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 01:42:34,448 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 01:42:34,448 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 01:42:34,448 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1fd0aba5d9be2820550e57012fb4e12f76fe291bb253443319d08539e5b2ba1a [2025-01-10 01:42:34,682 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 01:42:34,689 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 01:42:34,692 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 01:42:34,693 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 01:42:34,693 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 01:42:34,694 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/sll2n_update_all.i [2025-01-10 01:42:35,882 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/03443942c/1e2d580448104e3a84d1535858bd0063/FLAGa7cf6a64e [2025-01-10 01:42:36,158 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 01:42:36,160 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/list-simple/sll2n_update_all.i [2025-01-10 01:42:36,170 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/03443942c/1e2d580448104e3a84d1535858bd0063/FLAGa7cf6a64e [2025-01-10 01:42:36,457 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/03443942c/1e2d580448104e3a84d1535858bd0063 [2025-01-10 01:42:36,458 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 01:42:36,459 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 01:42:36,460 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 01:42:36,460 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 01:42:36,473 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 01:42:36,473 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:42:36" (1/1) ... [2025-01-10 01:42:36,474 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@172ec293 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:42:36, skipping insertion in model container [2025-01-10 01:42:36,474 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:42:36" (1/1) ... [2025-01-10 01:42:36,517 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 01:42:36,823 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:42:36,829 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 01:42:36,856 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:42:36,877 INFO L204 MainTranslator]: Completed translation [2025-01-10 01:42:36,878 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:42:36 WrapperNode [2025-01-10 01:42:36,879 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 01:42:36,880 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 01:42:36,880 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 01:42:36,880 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 01:42:36,884 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:42:36" (1/1) ... [2025-01-10 01:42:36,890 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:42:36" (1/1) ... [2025-01-10 01:42:36,901 INFO L138 Inliner]: procedures = 126, calls = 23, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 120 [2025-01-10 01:42:36,901 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 01:42:36,902 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 01:42:36,902 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 01:42:36,902 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 01:42:36,906 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:42:36" (1/1) ... [2025-01-10 01:42:36,907 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:42:36" (1/1) ... [2025-01-10 01:42:36,908 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:42:36" (1/1) ... [2025-01-10 01:42:36,917 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 4 writes are split as follows [0, 4]. [2025-01-10 01:42:36,917 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:42:36" (1/1) ... [2025-01-10 01:42:36,917 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:42:36" (1/1) ... [2025-01-10 01:42:36,921 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:42:36" (1/1) ... [2025-01-10 01:42:36,921 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:42:36" (1/1) ... [2025-01-10 01:42:36,923 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:42:36" (1/1) ... [2025-01-10 01:42:36,924 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:42:36" (1/1) ... [2025-01-10 01:42:36,924 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:42:36" (1/1) ... [2025-01-10 01:42:36,925 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 01:42:36,926 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 01:42:36,926 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 01:42:36,926 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 01:42:36,927 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:42:36" (1/1) ... [2025-01-10 01:42:36,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:42:36,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:42:36,948 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 01:42:36,950 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 01:42:36,964 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 01:42:36,965 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-10 01:42:36,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 01:42:36,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-10 01:42:36,965 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-10 01:42:36,965 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 01:42:36,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-10 01:42:36,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-10 01:42:36,965 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-10 01:42:36,965 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-10 01:42:36,965 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-10 01:42:36,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 01:42:36,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 01:42:36,965 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 01:42:36,965 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 01:42:37,112 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 01:42:37,120 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 01:42:37,326 INFO L? ?]: Removed 68 outVars from TransFormulas that were not future-live. [2025-01-10 01:42:37,326 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 01:42:37,335 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 01:42:37,335 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 01:42:37,335 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:42:37 BoogieIcfgContainer [2025-01-10 01:42:37,336 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 01:42:37,339 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 01:42:37,339 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 01:42:37,341 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 01:42:37,342 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 01:42:36" (1/3) ... [2025-01-10 01:42:37,342 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11beae0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:42:37, skipping insertion in model container [2025-01-10 01:42:37,342 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:42:36" (2/3) ... [2025-01-10 01:42:37,342 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11beae0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:42:37, skipping insertion in model container [2025-01-10 01:42:37,343 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:42:37" (3/3) ... [2025-01-10 01:42:37,343 INFO L128 eAbstractionObserver]: Analyzing ICFG sll2n_update_all.i [2025-01-10 01:42:37,352 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 01:42:37,353 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sll2n_update_all.i that has 1 procedures, 51 locations, 1 initial locations, 6 loop locations, and 14 error locations. [2025-01-10 01:42:37,390 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 01:42:37,399 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;@2b21cb82, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 01:42:37,399 INFO L334 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2025-01-10 01:42:37,402 INFO L276 IsEmpty]: Start isEmpty. Operand has 51 states, 36 states have (on average 1.6388888888888888) internal successors, (59), 50 states have internal predecessors, (59), 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 01:42:37,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-01-10 01:42:37,406 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:42:37,407 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-01-10 01:42:37,407 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-01-10 01:42:37,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:42:37,413 INFO L85 PathProgramCache]: Analyzing trace with hash 890030086, now seen corresponding path program 1 times [2025-01-10 01:42:37,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:42:37,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121844079] [2025-01-10 01:42:37,418 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:42:37,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:42:37,477 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 01:42:37,490 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 01:42:37,492 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:42:37,492 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:42:37,585 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 01:42:37,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:42:37,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121844079] [2025-01-10 01:42:37,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121844079] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:42:37,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:42:37,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:42:37,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138180061] [2025-01-10 01:42:37,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:42:37,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:42:37,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:42:37,600 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:42:37,600 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:42:37,601 INFO L87 Difference]: Start difference. First operand has 51 states, 36 states have (on average 1.6388888888888888) internal successors, (59), 50 states have internal predecessors, (59), 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) Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:42:37,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:42:37,633 INFO L93 Difference]: Finished difference Result 95 states and 111 transitions. [2025-01-10 01:42:37,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:42:37,635 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-01-10 01:42:37,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:42:37,639 INFO L225 Difference]: With dead ends: 95 [2025-01-10 01:42:37,639 INFO L226 Difference]: Without dead ends: 46 [2025-01-10 01:42:37,642 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:42:37,644 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 5 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:42:37,644 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 104 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:42:37,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2025-01-10 01:42:37,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 43. [2025-01-10 01:42:37,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 29 states have (on average 1.6206896551724137) internal successors, (47), 42 states have internal predecessors, (47), 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 01:42:37,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2025-01-10 01:42:37,671 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 6 [2025-01-10 01:42:37,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:42:37,673 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2025-01-10 01:42:37,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:42:37,673 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2025-01-10 01:42:37,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-01-10 01:42:37,673 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:42:37,673 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:42:37,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 01:42:37,674 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-01-10 01:42:37,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:42:37,674 INFO L85 PathProgramCache]: Analyzing trace with hash 1805981222, now seen corresponding path program 1 times [2025-01-10 01:42:37,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:42:37,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738802036] [2025-01-10 01:42:37,675 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:42:37,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:42:37,684 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 01:42:37,692 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 01:42:37,693 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:42:37,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:42:37,813 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 01:42:37,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:42:37,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738802036] [2025-01-10 01:42:37,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738802036] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:42:37,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:42:37,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:42:37,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075754427] [2025-01-10 01:42:37,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:42:37,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:42:37,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:42:37,815 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:42:37,817 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:42:37,817 INFO L87 Difference]: Start difference. First operand 43 states and 47 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 01:42:37,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:42:37,845 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2025-01-10 01:42:37,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:42:37,845 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 01:42:37,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:42:37,846 INFO L225 Difference]: With dead ends: 50 [2025-01-10 01:42:37,846 INFO L226 Difference]: Without dead ends: 48 [2025-01-10 01:42:37,846 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:42:37,847 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 1 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:42:37,847 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 119 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:42:37,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-01-10 01:42:37,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2025-01-10 01:42:37,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 34 states have (on average 1.5294117647058822) internal successors, (52), 47 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:42:37,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2025-01-10 01:42:37,856 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 7 [2025-01-10 01:42:37,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:42:37,856 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2025-01-10 01:42:37,856 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 01:42:37,856 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2025-01-10 01:42:37,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-01-10 01:42:37,857 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:42:37,858 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:42:37,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 01:42:37,858 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-01-10 01:42:37,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:42:37,858 INFO L85 PathProgramCache]: Analyzing trace with hash -506864112, now seen corresponding path program 1 times [2025-01-10 01:42:37,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:42:37,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903885908] [2025-01-10 01:42:37,858 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:42:37,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:42:37,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 01:42:37,902 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 01:42:37,902 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:42:37,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:42:37,965 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 01:42:37,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:42:37,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903885908] [2025-01-10 01:42:37,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903885908] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:42:37,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [836150366] [2025-01-10 01:42:37,966 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:42:37,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:42:37,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:42:37,969 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 01:42:37,970 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 01:42:38,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 01:42:38,042 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 01:42:38,043 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:42:38,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:42:38,044 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-10 01:42:38,046 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:42:38,082 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 01:42:38,082 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:42:38,124 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 01:42:38,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [836150366] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:42:38,124 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:42:38,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2025-01-10 01:42:38,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232221030] [2025-01-10 01:42:38,124 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:42:38,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 01:42:38,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:42:38,128 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 01:42:38,128 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-10 01:42:38,129 INFO L87 Difference]: Start difference. First operand 48 states and 52 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 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 01:42:38,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:42:38,165 INFO L93 Difference]: Finished difference Result 81 states and 89 transitions. [2025-01-10 01:42:38,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:42:38,166 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 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 12 [2025-01-10 01:42:38,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:42:38,167 INFO L225 Difference]: With dead ends: 81 [2025-01-10 01:42:38,167 INFO L226 Difference]: Without dead ends: 49 [2025-01-10 01:42:38,167 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 20 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-10 01:42:38,168 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 3 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 156 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 01:42:38,168 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 156 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:42:38,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-01-10 01:42:38,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2025-01-10 01:42:38,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 35 states have (on average 1.5142857142857142) internal successors, (53), 48 states have internal predecessors, (53), 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 01:42:38,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2025-01-10 01:42:38,173 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 12 [2025-01-10 01:42:38,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:42:38,174 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2025-01-10 01:42:38,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 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 01:42:38,174 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2025-01-10 01:42:38,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-01-10 01:42:38,174 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:42:38,174 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1] [2025-01-10 01:42:38,181 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 01:42:38,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:42:38,375 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-01-10 01:42:38,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:42:38,375 INFO L85 PathProgramCache]: Analyzing trace with hash 1451934044, now seen corresponding path program 1 times [2025-01-10 01:42:38,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:42:38,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373627124] [2025-01-10 01:42:38,376 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:42:38,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:42:38,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 01:42:38,391 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 01:42:38,391 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:42:38,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:42:38,424 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:42:38,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:42:38,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373627124] [2025-01-10 01:42:38,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373627124] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:42:38,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:42:38,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:42:38,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136047000] [2025-01-10 01:42:38,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:42:38,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:42:38,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:42:38,425 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:42:38,425 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:42:38,425 INFO L87 Difference]: Start difference. First operand 49 states and 53 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:42:38,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:42:38,444 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2025-01-10 01:42:38,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:42:38,444 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2025-01-10 01:42:38,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:42:38,445 INFO L225 Difference]: With dead ends: 49 [2025-01-10 01:42:38,445 INFO L226 Difference]: Without dead ends: 48 [2025-01-10 01:42:38,445 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:42:38,445 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 1 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:42:38,446 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 113 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:42:38,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-01-10 01:42:38,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2025-01-10 01:42:38,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 35 states have (on average 1.4857142857142858) internal successors, (52), 47 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:42:38,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2025-01-10 01:42:38,451 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 13 [2025-01-10 01:42:38,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:42:38,451 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2025-01-10 01:42:38,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:42:38,451 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2025-01-10 01:42:38,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-01-10 01:42:38,452 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:42:38,452 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1] [2025-01-10 01:42:38,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 01:42:38,452 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-01-10 01:42:38,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:42:38,452 INFO L85 PathProgramCache]: Analyzing trace with hash 2060282454, now seen corresponding path program 1 times [2025-01-10 01:42:38,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:42:38,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087570446] [2025-01-10 01:42:38,453 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:42:38,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:42:38,465 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-10 01:42:38,475 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 01:42:38,478 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:42:38,478 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:42:38,579 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:42:38,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:42:38,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087570446] [2025-01-10 01:42:38,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087570446] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:42:38,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [960032159] [2025-01-10 01:42:38,580 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:42:38,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:42:38,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:42:38,582 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 01:42:38,584 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 01:42:38,642 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-10 01:42:38,661 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 01:42:38,661 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:42:38,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:42:38,662 INFO L256 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-10 01:42:38,663 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:42:38,710 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:42:38,710 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 01:42:38,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [960032159] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:42:38,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 01:42:38,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2025-01-10 01:42:38,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538060432] [2025-01-10 01:42:38,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:42:38,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 01:42:38,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:42:38,711 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 01:42:38,712 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-10 01:42:38,712 INFO L87 Difference]: Start difference. First operand 48 states and 52 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 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 01:42:38,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:42:38,733 INFO L93 Difference]: Finished difference Result 48 states and 52 transitions. [2025-01-10 01:42:38,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 01:42:38,734 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 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 14 [2025-01-10 01:42:38,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:42:38,734 INFO L225 Difference]: With dead ends: 48 [2025-01-10 01:42:38,734 INFO L226 Difference]: Without dead ends: 47 [2025-01-10 01:42:38,734 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-10 01:42:38,735 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 0 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:42:38,735 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 152 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:42:38,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2025-01-10 01:42:38,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2025-01-10 01:42:38,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 35 states have (on average 1.457142857142857) internal successors, (51), 46 states have internal predecessors, (51), 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 01:42:38,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2025-01-10 01:42:38,737 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 14 [2025-01-10 01:42:38,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:42:38,738 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2025-01-10 01:42:38,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 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 01:42:38,738 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2025-01-10 01:42:38,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-01-10 01:42:38,738 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:42:38,738 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-01-10 01:42:38,746 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-10 01:42:38,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:42:38,943 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-01-10 01:42:38,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:42:38,944 INFO L85 PathProgramCache]: Analyzing trace with hash 652002458, now seen corresponding path program 2 times [2025-01-10 01:42:38,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:42:38,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722208991] [2025-01-10 01:42:38,944 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:42:38,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:42:38,954 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-01-10 01:42:38,955 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 18 statements. [2025-01-10 01:42:38,955 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 01:42:38,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:42:38,969 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-10 01:42:38,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:42:38,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722208991] [2025-01-10 01:42:38,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722208991] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:42:38,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:42:38,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:42:38,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040968505] [2025-01-10 01:42:38,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:42:38,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:42:38,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:42:38,970 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:42:38,970 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:42:38,970 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 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 01:42:39,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:42:39,003 INFO L93 Difference]: Finished difference Result 68 states and 77 transitions. [2025-01-10 01:42:39,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:42:39,003 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 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 18 [2025-01-10 01:42:39,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:42:39,004 INFO L225 Difference]: With dead ends: 68 [2025-01-10 01:42:39,004 INFO L226 Difference]: Without dead ends: 66 [2025-01-10 01:42:39,004 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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 01:42:39,004 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 71 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:42:39,004 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 59 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:42:39,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2025-01-10 01:42:39,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 51. [2025-01-10 01:42:39,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 39 states have (on average 1.435897435897436) internal successors, (56), 50 states have internal predecessors, (56), 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 01:42:39,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 56 transitions. [2025-01-10 01:42:39,012 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 56 transitions. Word has length 18 [2025-01-10 01:42:39,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:42:39,012 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 56 transitions. [2025-01-10 01:42:39,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 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 01:42:39,013 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2025-01-10 01:42:39,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-01-10 01:42:39,013 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:42:39,013 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:42:39,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 01:42:39,013 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-01-10 01:42:39,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:42:39,014 INFO L85 PathProgramCache]: Analyzing trace with hash -1262760220, now seen corresponding path program 1 times [2025-01-10 01:42:39,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:42:39,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933297487] [2025-01-10 01:42:39,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:42:39,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:42:39,023 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-10 01:42:39,027 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-10 01:42:39,027 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:42:39,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:42:39,072 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-10 01:42:39,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:42:39,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933297487] [2025-01-10 01:42:39,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933297487] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:42:39,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:42:39,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:42:39,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038197930] [2025-01-10 01:42:39,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:42:39,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:42:39,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:42:39,073 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:42:39,073 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:42:39,073 INFO L87 Difference]: Start difference. First operand 51 states and 56 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:42:39,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:42:39,103 INFO L93 Difference]: Finished difference Result 85 states and 94 transitions. [2025-01-10 01:42:39,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:42:39,103 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-01-10 01:42:39,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:42:39,104 INFO L225 Difference]: With dead ends: 85 [2025-01-10 01:42:39,104 INFO L226 Difference]: Without dead ends: 66 [2025-01-10 01:42:39,104 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:42:39,105 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 48 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:42:39,105 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 59 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:42:39,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2025-01-10 01:42:39,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 53. [2025-01-10 01:42:39,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 41 states have (on average 1.3902439024390243) internal successors, (57), 52 states have internal predecessors, (57), 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 01:42:39,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 57 transitions. [2025-01-10 01:42:39,108 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 57 transitions. Word has length 19 [2025-01-10 01:42:39,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:42:39,109 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 57 transitions. [2025-01-10 01:42:39,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:42:39,109 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2025-01-10 01:42:39,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-01-10 01:42:39,109 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:42:39,109 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:42:39,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 01:42:39,110 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-01-10 01:42:39,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:42:39,110 INFO L85 PathProgramCache]: Analyzing trace with hash 1963175462, now seen corresponding path program 1 times [2025-01-10 01:42:39,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:42:39,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122792518] [2025-01-10 01:42:39,110 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:42:39,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:42:39,120 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-10 01:42:39,124 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-10 01:42:39,124 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:42:39,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:42:39,164 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-10 01:42:39,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:42:39,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122792518] [2025-01-10 01:42:39,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122792518] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:42:39,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:42:39,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 01:42:39,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475514457] [2025-01-10 01:42:39,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:42:39,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:42:39,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:42:39,165 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:42:39,165 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:42:39,166 INFO L87 Difference]: Start difference. First operand 53 states and 57 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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 01:42:39,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:42:39,199 INFO L93 Difference]: Finished difference Result 96 states and 105 transitions. [2025-01-10 01:42:39,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:42:39,200 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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 21 [2025-01-10 01:42:39,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:42:39,200 INFO L225 Difference]: With dead ends: 96 [2025-01-10 01:42:39,200 INFO L226 Difference]: Without dead ends: 62 [2025-01-10 01:42:39,200 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:42:39,201 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 12 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:42:39,201 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 95 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:42:39,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2025-01-10 01:42:39,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 54. [2025-01-10 01:42:39,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 42 states have (on average 1.380952380952381) internal successors, (58), 53 states have internal predecessors, (58), 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 01:42:39,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2025-01-10 01:42:39,206 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 21 [2025-01-10 01:42:39,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:42:39,206 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2025-01-10 01:42:39,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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 01:42:39,206 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2025-01-10 01:42:39,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-01-10 01:42:39,206 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:42:39,206 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:42:39,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 01:42:39,207 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-01-10 01:42:39,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:42:39,207 INFO L85 PathProgramCache]: Analyzing trace with hash 728903206, now seen corresponding path program 1 times [2025-01-10 01:42:39,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:42:39,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983343900] [2025-01-10 01:42:39,207 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:42:39,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:42:39,220 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-10 01:42:39,225 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-10 01:42:39,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:42:39,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:42:39,274 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-10 01:42:39,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:42:39,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983343900] [2025-01-10 01:42:39,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983343900] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:42:39,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:42:39,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:42:39,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331503012] [2025-01-10 01:42:39,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:42:39,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:42:39,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:42:39,275 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:42:39,275 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:42:39,276 INFO L87 Difference]: Start difference. First operand 54 states and 58 transitions. Second operand has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 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 01:42:39,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:42:39,306 INFO L93 Difference]: Finished difference Result 66 states and 71 transitions. [2025-01-10 01:42:39,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:42:39,306 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 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 22 [2025-01-10 01:42:39,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:42:39,307 INFO L225 Difference]: With dead ends: 66 [2025-01-10 01:42:39,307 INFO L226 Difference]: Without dead ends: 64 [2025-01-10 01:42:39,307 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:42:39,308 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 11 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:42:39,308 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 91 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:42:39,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2025-01-10 01:42:39,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 57. [2025-01-10 01:42:39,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 45 states have (on average 1.3555555555555556) internal successors, (61), 56 states have internal predecessors, (61), 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 01:42:39,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 61 transitions. [2025-01-10 01:42:39,311 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 61 transitions. Word has length 22 [2025-01-10 01:42:39,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:42:39,311 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 61 transitions. [2025-01-10 01:42:39,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 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 01:42:39,312 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2025-01-10 01:42:39,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-01-10 01:42:39,312 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:42:39,312 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:42:39,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-10 01:42:39,312 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-01-10 01:42:39,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:42:39,313 INFO L85 PathProgramCache]: Analyzing trace with hash -599161814, now seen corresponding path program 1 times [2025-01-10 01:42:39,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:42:39,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021740673] [2025-01-10 01:42:39,313 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:42:39,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:42:39,323 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-10 01:42:39,327 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-10 01:42:39,328 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:42:39,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:42:39,429 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-10 01:42:39,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:42:39,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021740673] [2025-01-10 01:42:39,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021740673] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:42:39,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1656054262] [2025-01-10 01:42:39,430 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:42:39,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:42:39,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:42:39,436 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 01:42:39,438 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 01:42:39,501 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-10 01:42:39,527 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-10 01:42:39,527 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:42:39,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:42:39,528 INFO L256 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 01:42:39,529 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:42:39,601 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-10 01:42:39,601 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 01:42:39,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1656054262] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:42:39,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 01:42:39,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 9 [2025-01-10 01:42:39,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031709119] [2025-01-10 01:42:39,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:42:39,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 01:42:39,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:42:39,602 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 01:42:39,603 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2025-01-10 01:42:39,603 INFO L87 Difference]: Start difference. First operand 57 states and 61 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 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 01:42:39,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:42:39,640 INFO L93 Difference]: Finished difference Result 64 states and 69 transitions. [2025-01-10 01:42:39,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 01:42:39,640 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 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 25 [2025-01-10 01:42:39,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:42:39,640 INFO L225 Difference]: With dead ends: 64 [2025-01-10 01:42:39,641 INFO L226 Difference]: Without dead ends: 62 [2025-01-10 01:42:39,641 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2025-01-10 01:42:39,641 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 40 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:42:39,642 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 82 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:42:39,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2025-01-10 01:42:39,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 55. [2025-01-10 01:42:39,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 45 states have (on average 1.3111111111111111) internal successors, (59), 54 states have internal predecessors, (59), 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 01:42:39,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2025-01-10 01:42:39,648 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 25 [2025-01-10 01:42:39,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:42:39,650 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions. [2025-01-10 01:42:39,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 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 01:42:39,650 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2025-01-10 01:42:39,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-01-10 01:42:39,650 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:42:39,650 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:42:39,661 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-10 01:42:39,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:42:39,851 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-01-10 01:42:39,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:42:39,852 INFO L85 PathProgramCache]: Analyzing trace with hash -1394146988, now seen corresponding path program 1 times [2025-01-10 01:42:39,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:42:39,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330800182] [2025-01-10 01:42:39,852 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:42:39,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:42:39,864 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-10 01:42:39,871 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-10 01:42:39,872 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:42:39,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:42:40,007 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 01:42:40,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:42:40,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330800182] [2025-01-10 01:42:40,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330800182] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:42:40,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1860425034] [2025-01-10 01:42:40,007 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:42:40,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:42:40,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:42:40,014 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 01:42:40,020 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 01:42:40,091 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-10 01:42:40,112 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-10 01:42:40,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:42:40,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:42:40,113 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 01:42:40,114 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:42:40,178 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-10 01:42:40,179 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:42:40,238 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-10 01:42:40,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1860425034] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:42:40,238 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:42:40,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 13 [2025-01-10 01:42:40,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596751619] [2025-01-10 01:42:40,238 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:42:40,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-10 01:42:40,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:42:40,239 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-10 01:42:40,239 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2025-01-10 01:42:40,239 INFO L87 Difference]: Start difference. First operand 55 states and 59 transitions. Second operand has 14 states, 13 states have (on average 4.230769230769231) internal successors, (55), 14 states have internal predecessors, (55), 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 01:42:40,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:42:40,315 INFO L93 Difference]: Finished difference Result 63 states and 69 transitions. [2025-01-10 01:42:40,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 01:42:40,315 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.230769230769231) internal successors, (55), 14 states have internal predecessors, (55), 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 26 [2025-01-10 01:42:40,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:42:40,315 INFO L225 Difference]: With dead ends: 63 [2025-01-10 01:42:40,315 INFO L226 Difference]: Without dead ends: 61 [2025-01-10 01:42:40,316 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2025-01-10 01:42:40,316 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 56 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:42:40,316 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 127 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:42:40,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2025-01-10 01:42:40,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 52. [2025-01-10 01:42:40,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 44 states have (on average 1.2727272727272727) internal successors, (56), 51 states have internal predecessors, (56), 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 01:42:40,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2025-01-10 01:42:40,319 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 26 [2025-01-10 01:42:40,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:42:40,320 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2025-01-10 01:42:40,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.230769230769231) internal successors, (55), 14 states have internal predecessors, (55), 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 01:42:40,320 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2025-01-10 01:42:40,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-01-10 01:42:40,320 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:42:40,320 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:42:40,327 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-10 01:42:40,521 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,SelfDestructingSolverStorable10 [2025-01-10 01:42:40,521 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-01-10 01:42:40,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:42:40,522 INFO L85 PathProgramCache]: Analyzing trace with hash 254542998, now seen corresponding path program 1 times [2025-01-10 01:42:40,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:42:40,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185371250] [2025-01-10 01:42:40,522 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:42:40,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:42:40,532 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-10 01:42:40,537 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-10 01:42:40,537 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:42:40,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:42:40,562 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-10 01:42:40,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:42:40,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185371250] [2025-01-10 01:42:40,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185371250] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:42:40,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:42:40,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:42:40,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824910680] [2025-01-10 01:42:40,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:42:40,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:42:40,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:42:40,563 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:42:40,563 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:42:40,564 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 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 01:42:40,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:42:40,570 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2025-01-10 01:42:40,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:42:40,571 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), 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 28 [2025-01-10 01:42:40,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:42:40,571 INFO L225 Difference]: With dead ends: 52 [2025-01-10 01:42:40,571 INFO L226 Difference]: Without dead ends: 51 [2025-01-10 01:42:40,571 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 01:42:40,572 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 1 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:42:40,572 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 69 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:42:40,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-01-10 01:42:40,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2025-01-10 01:42:40,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 44 states have (on average 1.25) internal successors, (55), 50 states have internal predecessors, (55), 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 01:42:40,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2025-01-10 01:42:40,575 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 28 [2025-01-10 01:42:40,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:42:40,575 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2025-01-10 01:42:40,575 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), 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 01:42:40,575 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2025-01-10 01:42:40,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-01-10 01:42:40,576 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:42:40,576 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:42:40,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-10 01:42:40,576 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-01-10 01:42:40,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:42:40,576 INFO L85 PathProgramCache]: Analyzing trace with hash -46358864, now seen corresponding path program 1 times [2025-01-10 01:42:40,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:42:40,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844597982] [2025-01-10 01:42:40,577 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:42:40,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:42:40,585 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-10 01:42:40,589 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-10 01:42:40,589 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:42:40,589 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:42:40,633 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-10 01:42:40,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:42:40,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844597982] [2025-01-10 01:42:40,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844597982] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:42:40,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:42:40,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 01:42:40,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484104846] [2025-01-10 01:42:40,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:42:40,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:42:40,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:42:40,634 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:42:40,634 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:42:40,635 INFO L87 Difference]: Start difference. First operand 51 states and 55 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 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 01:42:40,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:42:40,664 INFO L93 Difference]: Finished difference Result 70 states and 76 transitions. [2025-01-10 01:42:40,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:42:40,664 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 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 29 [2025-01-10 01:42:40,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:42:40,665 INFO L225 Difference]: With dead ends: 70 [2025-01-10 01:42:40,665 INFO L226 Difference]: Without dead ends: 55 [2025-01-10 01:42:40,665 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:42:40,665 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 7 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:42:40,666 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 82 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:42:40,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2025-01-10 01:42:40,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 53. [2025-01-10 01:42:40,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 46 states have (on average 1.2391304347826086) internal successors, (57), 52 states have internal predecessors, (57), 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 01:42:40,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 57 transitions. [2025-01-10 01:42:40,673 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 57 transitions. Word has length 29 [2025-01-10 01:42:40,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:42:40,673 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 57 transitions. [2025-01-10 01:42:40,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 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 01:42:40,673 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2025-01-10 01:42:40,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-01-10 01:42:40,674 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:42:40,674 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:42:40,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-10 01:42:40,674 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-01-10 01:42:40,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:42:40,674 INFO L85 PathProgramCache]: Analyzing trace with hash -699101584, now seen corresponding path program 1 times [2025-01-10 01:42:40,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:42:40,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732379649] [2025-01-10 01:42:40,674 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:42:40,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:42:40,685 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-10 01:42:40,690 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-10 01:42:40,690 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:42:40,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:42:40,749 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-10 01:42:40,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:42:40,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732379649] [2025-01-10 01:42:40,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732379649] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:42:40,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1293993516] [2025-01-10 01:42:40,749 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:42:40,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:42:40,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:42:40,753 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:42:40,754 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-10 01:42:40,825 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-10 01:42:40,849 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-10 01:42:40,849 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:42:40,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:42:40,850 INFO L256 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-10 01:42:40,851 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:42:40,877 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-10 01:42:40,878 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:42:40,932 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-10 01:42:40,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1293993516] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:42:40,933 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:42:40,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2025-01-10 01:42:40,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132342788] [2025-01-10 01:42:40,933 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:42:40,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-10 01:42:40,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:42:40,934 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-10 01:42:40,934 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2025-01-10 01:42:40,934 INFO L87 Difference]: Start difference. First operand 53 states and 57 transitions. Second operand has 14 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 14 states have internal predecessors, (45), 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 01:42:41,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:42:41,040 INFO L93 Difference]: Finished difference Result 62 states and 69 transitions. [2025-01-10 01:42:41,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-10 01:42:41,040 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 14 states have internal predecessors, (45), 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 29 [2025-01-10 01:42:41,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:42:41,040 INFO L225 Difference]: With dead ends: 62 [2025-01-10 01:42:41,040 INFO L226 Difference]: Without dead ends: 61 [2025-01-10 01:42:41,041 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2025-01-10 01:42:41,041 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 49 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:42:41,041 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 142 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:42:41,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2025-01-10 01:42:41,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 52. [2025-01-10 01:42:41,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 46 states have (on average 1.2173913043478262) internal successors, (56), 51 states have internal predecessors, (56), 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 01:42:41,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2025-01-10 01:42:41,044 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 29 [2025-01-10 01:42:41,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:42:41,045 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2025-01-10 01:42:41,045 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 14 states have internal predecessors, (45), 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 01:42:41,045 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2025-01-10 01:42:41,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-01-10 01:42:41,045 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:42:41,045 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-01-10 01:42:41,051 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-01-10 01:42:41,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-01-10 01:42:41,250 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-01-10 01:42:41,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:42:41,251 INFO L85 PathProgramCache]: Analyzing trace with hash -197127848, now seen corresponding path program 1 times [2025-01-10 01:42:41,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:42:41,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653759928] [2025-01-10 01:42:41,251 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:42:41,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:42:41,273 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-10 01:42:41,277 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-10 01:42:41,277 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:42:41,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:42:41,338 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-01-10 01:42:41,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:42:41,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653759928] [2025-01-10 01:42:41,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653759928] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:42:41,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:42:41,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 01:42:41,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692175314] [2025-01-10 01:42:41,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:42:41,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:42:41,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:42:41,340 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:42:41,340 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:42:41,340 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 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 01:42:41,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:42:41,386 INFO L93 Difference]: Finished difference Result 59 states and 64 transitions. [2025-01-10 01:42:41,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 01:42:41,387 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 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 30 [2025-01-10 01:42:41,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:42:41,387 INFO L225 Difference]: With dead ends: 59 [2025-01-10 01:42:41,387 INFO L226 Difference]: Without dead ends: 58 [2025-01-10 01:42:41,387 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-10 01:42:41,388 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 8 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:42:41,388 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 92 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:42:41,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2025-01-10 01:42:41,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 53. [2025-01-10 01:42:41,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 47 states have (on average 1.2340425531914894) internal successors, (58), 52 states have internal predecessors, (58), 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 01:42:41,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 58 transitions. [2025-01-10 01:42:41,392 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 58 transitions. Word has length 30 [2025-01-10 01:42:41,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:42:41,392 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 58 transitions. [2025-01-10 01:42:41,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 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 01:42:41,393 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 58 transitions. [2025-01-10 01:42:41,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-01-10 01:42:41,393 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:42:41,393 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:42:41,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-10 01:42:41,393 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-01-10 01:42:41,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:42:41,394 INFO L85 PathProgramCache]: Analyzing trace with hash -1601007470, now seen corresponding path program 1 times [2025-01-10 01:42:41,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:42:41,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633655701] [2025-01-10 01:42:41,394 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:42:41,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:42:41,407 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-01-10 01:42:41,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-10 01:42:41,412 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:42:41,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:42:41,463 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-10 01:42:41,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:42:41,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633655701] [2025-01-10 01:42:41,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633655701] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:42:41,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:42:41,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:42:41,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727269785] [2025-01-10 01:42:41,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:42:41,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:42:41,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:42:41,465 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:42:41,465 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:42:41,465 INFO L87 Difference]: Start difference. First operand 53 states and 58 transitions. Second operand has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 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 01:42:41,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:42:41,497 INFO L93 Difference]: Finished difference Result 60 states and 65 transitions. [2025-01-10 01:42:41,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:42:41,497 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 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 31 [2025-01-10 01:42:41,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:42:41,498 INFO L225 Difference]: With dead ends: 60 [2025-01-10 01:42:41,498 INFO L226 Difference]: Without dead ends: 58 [2025-01-10 01:42:41,498 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:42:41,498 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 5 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:42:41,499 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 76 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:42:41,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2025-01-10 01:42:41,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 57. [2025-01-10 01:42:41,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 51 states have (on average 1.2156862745098038) internal successors, (62), 56 states have internal predecessors, (62), 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 01:42:41,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 62 transitions. [2025-01-10 01:42:41,503 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 62 transitions. Word has length 31 [2025-01-10 01:42:41,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:42:41,504 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 62 transitions. [2025-01-10 01:42:41,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 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 01:42:41,504 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 62 transitions. [2025-01-10 01:42:41,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-01-10 01:42:41,504 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:42:41,504 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:42:41,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-10 01:42:41,505 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-01-10 01:42:41,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:42:41,505 INFO L85 PathProgramCache]: Analyzing trace with hash 1672065140, now seen corresponding path program 1 times [2025-01-10 01:42:41,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:42:41,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691085623] [2025-01-10 01:42:41,505 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:42:41,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:42:41,515 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-01-10 01:42:41,521 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-01-10 01:42:41,521 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:42:41,521 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:42:41,615 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-10 01:42:41,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:42:41,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691085623] [2025-01-10 01:42:41,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691085623] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:42:41,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [720780947] [2025-01-10 01:42:41,616 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:42:41,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:42:41,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:42:41,618 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:42:41,619 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-10 01:42:41,705 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-01-10 01:42:41,728 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-01-10 01:42:41,728 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:42:41,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:42:41,729 INFO L256 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 01:42:41,730 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:42:41,758 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-10 01:42:41,758 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:42:41,793 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-10 01:42:41,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [720780947] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:42:41,793 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:42:41,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 12 [2025-01-10 01:42:41,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725570548] [2025-01-10 01:42:41,793 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:42:41,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-10 01:42:41,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:42:41,794 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-10 01:42:41,794 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2025-01-10 01:42:41,794 INFO L87 Difference]: Start difference. First operand 57 states and 62 transitions. Second operand has 13 states, 12 states have (on average 4.583333333333333) internal successors, (55), 13 states have internal predecessors, (55), 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 01:42:41,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:42:41,863 INFO L93 Difference]: Finished difference Result 100 states and 116 transitions. [2025-01-10 01:42:41,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-10 01:42:41,863 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 4.583333333333333) internal successors, (55), 13 states have internal predecessors, (55), 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 33 [2025-01-10 01:42:41,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:42:41,864 INFO L225 Difference]: With dead ends: 100 [2025-01-10 01:42:41,864 INFO L226 Difference]: Without dead ends: 99 [2025-01-10 01:42:41,865 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2025-01-10 01:42:41,865 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 23 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:42:41,865 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 104 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:42:41,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-01-10 01:42:41,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 85. [2025-01-10 01:42:41,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 79 states have (on average 1.2278481012658229) internal successors, (97), 84 states have internal predecessors, (97), 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 01:42:41,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 97 transitions. [2025-01-10 01:42:41,870 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 97 transitions. Word has length 33 [2025-01-10 01:42:41,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:42:41,871 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 97 transitions. [2025-01-10 01:42:41,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 4.583333333333333) internal successors, (55), 13 states have internal predecessors, (55), 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 01:42:41,871 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 97 transitions. [2025-01-10 01:42:41,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-01-10 01:42:41,871 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:42:41,871 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:42:41,877 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-01-10 01:42:42,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-01-10 01:42:42,072 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-01-10 01:42:42,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:42:42,072 INFO L85 PathProgramCache]: Analyzing trace with hash -1609251, now seen corresponding path program 1 times [2025-01-10 01:42:42,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:42:42,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387699325] [2025-01-10 01:42:42,073 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:42:42,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:42:42,081 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-01-10 01:42:42,086 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-10 01:42:42,086 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:42:42,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:42:42,145 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-10 01:42:42,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:42:42,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387699325] [2025-01-10 01:42:42,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387699325] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:42:42,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1543066985] [2025-01-10 01:42:42,145 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:42:42,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:42:42,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:42:42,149 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:42:42,150 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-10 01:42:42,232 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-01-10 01:42:42,257 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-10 01:42:42,257 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:42:42,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:42:42,258 INFO L256 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 01:42:42,260 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:42:42,319 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-10 01:42:42,321 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:42:42,363 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-10 01:42:42,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1543066985] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:42:42,363 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:42:42,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2025-01-10 01:42:42,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448140254] [2025-01-10 01:42:42,363 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:42:42,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-10 01:42:42,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:42:42,363 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-10 01:42:42,364 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2025-01-10 01:42:42,364 INFO L87 Difference]: Start difference. First operand 85 states and 97 transitions. Second operand has 13 states, 13 states have (on average 4.076923076923077) internal successors, (53), 13 states have internal predecessors, (53), 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 01:42:42,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:42:42,418 INFO L93 Difference]: Finished difference Result 112 states and 126 transitions. [2025-01-10 01:42:42,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 01:42:42,418 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.076923076923077) internal successors, (53), 13 states have internal predecessors, (53), 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 34 [2025-01-10 01:42:42,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:42:42,418 INFO L225 Difference]: With dead ends: 112 [2025-01-10 01:42:42,419 INFO L226 Difference]: Without dead ends: 89 [2025-01-10 01:42:42,419 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2025-01-10 01:42:42,419 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 120 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:42:42,419 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 131 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:42:42,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2025-01-10 01:42:42,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2025-01-10 01:42:42,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 83 states have (on average 1.216867469879518) internal successors, (101), 88 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:42:42,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 101 transitions. [2025-01-10 01:42:42,425 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 101 transitions. Word has length 34 [2025-01-10 01:42:42,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:42:42,425 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 101 transitions. [2025-01-10 01:42:42,425 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.076923076923077) internal successors, (53), 13 states have internal predecessors, (53), 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 01:42:42,426 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 101 transitions. [2025-01-10 01:42:42,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-01-10 01:42:42,427 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:42:42,427 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:42:42,434 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-01-10 01:42:42,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:42:42,628 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-01-10 01:42:42,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:42:42,629 INFO L85 PathProgramCache]: Analyzing trace with hash 2038632813, now seen corresponding path program 2 times [2025-01-10 01:42:42,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:42:42,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367915907] [2025-01-10 01:42:42,629 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:42:42,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:42:42,657 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 41 statements into 2 equivalence classes. [2025-01-10 01:42:42,665 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 41 of 41 statements. [2025-01-10 01:42:42,665 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:42:42,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:42:42,798 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-01-10 01:42:42,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:42:42,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367915907] [2025-01-10 01:42:42,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367915907] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:42:42,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [915153413] [2025-01-10 01:42:42,798 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:42:42,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:42:42,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:42:42,802 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:42:42,803 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-01-10 01:42:42,899 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 41 statements into 2 equivalence classes. [2025-01-10 01:42:42,926 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 41 of 41 statements. [2025-01-10 01:42:42,926 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:42:42,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:42:42,928 INFO L256 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-10 01:42:42,932 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:42:42,971 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-10 01:42:42,971 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:42:43,008 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-10 01:42:43,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [915153413] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:42:43,009 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:42:43,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 10 [2025-01-10 01:42:43,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517586304] [2025-01-10 01:42:43,009 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:42:43,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-10 01:42:43,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:42:43,010 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-10 01:42:43,010 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-01-10 01:42:43,010 INFO L87 Difference]: Start difference. First operand 89 states and 101 transitions. Second operand has 10 states, 10 states have (on average 6.1) internal successors, (61), 10 states have internal predecessors, (61), 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 01:42:43,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:42:43,106 INFO L93 Difference]: Finished difference Result 162 states and 188 transitions. [2025-01-10 01:42:43,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 01:42:43,107 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.1) internal successors, (61), 10 states have internal predecessors, (61), 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 41 [2025-01-10 01:42:43,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:42:43,107 INFO L225 Difference]: With dead ends: 162 [2025-01-10 01:42:43,107 INFO L226 Difference]: Without dead ends: 97 [2025-01-10 01:42:43,108 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 73 SyntacticMatches, 4 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2025-01-10 01:42:43,108 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 51 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:42:43,108 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 149 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:42:43,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2025-01-10 01:42:43,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 89. [2025-01-10 01:42:43,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 83 states have (on average 1.180722891566265) internal successors, (98), 88 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:42:43,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 98 transitions. [2025-01-10 01:42:43,113 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 98 transitions. Word has length 41 [2025-01-10 01:42:43,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:42:43,113 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 98 transitions. [2025-01-10 01:42:43,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.1) internal successors, (61), 10 states have internal predecessors, (61), 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 01:42:43,113 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 98 transitions. [2025-01-10 01:42:43,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-01-10 01:42:43,113 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:42:43,114 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:42:43,121 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-01-10 01:42:43,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:42:43,314 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-01-10 01:42:43,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:42:43,315 INFO L85 PathProgramCache]: Analyzing trace with hash 1513172841, now seen corresponding path program 1 times [2025-01-10 01:42:43,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:42:43,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770598134] [2025-01-10 01:42:43,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:42:43,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:42:43,327 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-01-10 01:42:43,333 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-01-10 01:42:43,333 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:42:43,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:42:43,360 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-01-10 01:42:43,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:42:43,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770598134] [2025-01-10 01:42:43,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770598134] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:42:43,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:42:43,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:42:43,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811716792] [2025-01-10 01:42:43,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:42:43,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:42:43,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:42:43,361 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:42:43,361 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:42:43,361 INFO L87 Difference]: Start difference. First operand 89 states and 98 transitions. Second operand has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 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 01:42:43,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:42:43,372 INFO L93 Difference]: Finished difference Result 89 states and 98 transitions. [2025-01-10 01:42:43,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:42:43,373 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 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 47 [2025-01-10 01:42:43,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:42:43,373 INFO L225 Difference]: With dead ends: 89 [2025-01-10 01:42:43,373 INFO L226 Difference]: Without dead ends: 88 [2025-01-10 01:42:43,373 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 01:42:43,374 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 1 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:42:43,374 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 65 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:42:43,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2025-01-10 01:42:43,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2025-01-10 01:42:43,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 83 states have (on average 1.1686746987951808) internal successors, (97), 87 states have internal predecessors, (97), 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 01:42:43,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 97 transitions. [2025-01-10 01:42:43,378 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 97 transitions. Word has length 47 [2025-01-10 01:42:43,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:42:43,378 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 97 transitions. [2025-01-10 01:42:43,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 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 01:42:43,378 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 97 transitions. [2025-01-10 01:42:43,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-01-10 01:42:43,378 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:42:43,379 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:42:43,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-10 01:42:43,379 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-01-10 01:42:43,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:42:43,379 INFO L85 PathProgramCache]: Analyzing trace with hash -336282089, now seen corresponding path program 1 times [2025-01-10 01:42:43,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:42:43,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902931191] [2025-01-10 01:42:43,379 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:42:43,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:42:43,401 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-01-10 01:42:43,406 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-01-10 01:42:43,406 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:42:43,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:42:43,471 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-01-10 01:42:43,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:42:43,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902931191] [2025-01-10 01:42:43,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902931191] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:42:43,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [50075802] [2025-01-10 01:42:43,472 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:42:43,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:42:43,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:42:43,474 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:42:43,475 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-01-10 01:42:43,570 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-01-10 01:42:43,598 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-01-10 01:42:43,598 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:42:43,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:42:43,600 INFO L256 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-10 01:42:43,601 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:42:43,630 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-01-10 01:42:43,630 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:42:43,683 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-01-10 01:42:43,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [50075802] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:42:43,683 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:42:43,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2025-01-10 01:42:43,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536574651] [2025-01-10 01:42:43,684 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:42:43,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-10 01:42:43,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:42:43,684 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-10 01:42:43,684 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2025-01-10 01:42:43,685 INFO L87 Difference]: Start difference. First operand 88 states and 97 transitions. Second operand has 14 states, 13 states have (on average 4.538461538461538) internal successors, (59), 14 states have internal predecessors, (59), 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 01:42:43,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:42:43,804 INFO L93 Difference]: Finished difference Result 94 states and 105 transitions. [2025-01-10 01:42:43,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-10 01:42:43,804 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.538461538461538) internal successors, (59), 14 states have internal predecessors, (59), 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 48 [2025-01-10 01:42:43,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:42:43,805 INFO L225 Difference]: With dead ends: 94 [2025-01-10 01:42:43,805 INFO L226 Difference]: Without dead ends: 93 [2025-01-10 01:42:43,805 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2025-01-10 01:42:43,806 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 33 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:42:43,806 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 131 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:42:43,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2025-01-10 01:42:43,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 87. [2025-01-10 01:42:43,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 83 states have (on average 1.1566265060240963) internal successors, (96), 86 states have internal predecessors, (96), 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 01:42:43,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 96 transitions. [2025-01-10 01:42:43,810 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 96 transitions. Word has length 48 [2025-01-10 01:42:43,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:42:43,810 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 96 transitions. [2025-01-10 01:42:43,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.538461538461538) internal successors, (59), 14 states have internal predecessors, (59), 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 01:42:43,810 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 96 transitions. [2025-01-10 01:42:43,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-01-10 01:42:43,811 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:42:43,811 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:42:43,817 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-01-10 01:42:44,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:42:44,015 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-01-10 01:42:44,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:42:44,016 INFO L85 PathProgramCache]: Analyzing trace with hash -1834625269, now seen corresponding path program 1 times [2025-01-10 01:42:44,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:42:44,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999756756] [2025-01-10 01:42:44,016 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:42:44,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:42:44,030 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-01-10 01:42:44,035 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-01-10 01:42:44,035 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:42:44,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:42:44,102 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-01-10 01:42:44,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:42:44,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999756756] [2025-01-10 01:42:44,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1999756756] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:42:44,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [542820081] [2025-01-10 01:42:44,102 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:42:44,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:42:44,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:42:44,104 INFO L229 MonitoredProcess]: Starting monitored process 11 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 01:42:44,106 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-01-10 01:42:44,214 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-01-10 01:42:44,245 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-01-10 01:42:44,245 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:42:44,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:42:44,247 INFO L256 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-10 01:42:44,248 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:42:44,282 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-01-10 01:42:44,283 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:42:44,316 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-01-10 01:42:44,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [542820081] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:42:44,317 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:42:44,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 8 [2025-01-10 01:42:44,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905830952] [2025-01-10 01:42:44,318 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:42:44,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-10 01:42:44,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:42:44,318 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-10 01:42:44,318 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-01-10 01:42:44,318 INFO L87 Difference]: Start difference. First operand 87 states and 96 transitions. Second operand has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 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 01:42:44,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:42:44,389 INFO L93 Difference]: Finished difference Result 100 states and 112 transitions. [2025-01-10 01:42:44,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 01:42:44,389 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 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 49 [2025-01-10 01:42:44,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:42:44,390 INFO L225 Difference]: With dead ends: 100 [2025-01-10 01:42:44,390 INFO L226 Difference]: Without dead ends: 87 [2025-01-10 01:42:44,390 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 92 SyntacticMatches, 4 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-01-10 01:42:44,391 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 11 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:42:44,391 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 114 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:42:44,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2025-01-10 01:42:44,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2025-01-10 01:42:44,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 84 states have (on average 1.1428571428571428) internal successors, (96), 86 states have internal predecessors, (96), 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 01:42:44,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 96 transitions. [2025-01-10 01:42:44,400 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 96 transitions. Word has length 49 [2025-01-10 01:42:44,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:42:44,400 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 96 transitions. [2025-01-10 01:42:44,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 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 01:42:44,400 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 96 transitions. [2025-01-10 01:42:44,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-01-10 01:42:44,401 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:42:44,401 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:42:44,407 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-01-10 01:42:44,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:42:44,602 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-01-10 01:42:44,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:42:44,602 INFO L85 PathProgramCache]: Analyzing trace with hash -769293230, now seen corresponding path program 1 times [2025-01-10 01:42:44,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:42:44,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8873799] [2025-01-10 01:42:44,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:42:44,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:42:44,616 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-01-10 01:42:44,624 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-01-10 01:42:44,624 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:42:44,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:42:44,674 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-01-10 01:42:44,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:42:44,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8873799] [2025-01-10 01:42:44,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8873799] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:42:44,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [899662224] [2025-01-10 01:42:44,674 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:42:44,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:42:44,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:42:44,677 INFO L229 MonitoredProcess]: Starting monitored process 12 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 01:42:44,680 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-01-10 01:42:44,784 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-01-10 01:42:44,812 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-01-10 01:42:44,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:42:44,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:42:44,813 INFO L256 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 01:42:44,816 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:42:44,844 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-01-10 01:42:44,845 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:42:44,904 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-01-10 01:42:44,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [899662224] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:42:44,905 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:42:44,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-01-10 01:42:44,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194598726] [2025-01-10 01:42:44,905 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:42:44,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-10 01:42:44,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:42:44,905 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-10 01:42:44,906 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-01-10 01:42:44,906 INFO L87 Difference]: Start difference. First operand 87 states and 96 transitions. Second operand has 12 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 12 states have internal predecessors, (69), 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 01:42:44,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:42:44,996 INFO L93 Difference]: Finished difference Result 119 states and 135 transitions. [2025-01-10 01:42:44,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 01:42:44,997 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 12 states have internal predecessors, (69), 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 53 [2025-01-10 01:42:44,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:42:44,997 INFO L225 Difference]: With dead ends: 119 [2025-01-10 01:42:44,997 INFO L226 Difference]: Without dead ends: 118 [2025-01-10 01:42:44,997 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-01-10 01:42:44,998 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 7 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:42:44,998 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 138 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:42:44,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2025-01-10 01:42:45,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2025-01-10 01:42:45,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 115 states have (on average 1.1478260869565218) internal successors, (132), 117 states have internal predecessors, (132), 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 01:42:45,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 132 transitions. [2025-01-10 01:42:45,004 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 132 transitions. Word has length 53 [2025-01-10 01:42:45,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:42:45,004 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 132 transitions. [2025-01-10 01:42:45,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 12 states have internal predecessors, (69), 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 01:42:45,004 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 132 transitions. [2025-01-10 01:42:45,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-01-10 01:42:45,005 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:42:45,005 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:42:45,011 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-01-10 01:42:45,205 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-01-10 01:42:45,205 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-01-10 01:42:45,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:42:45,206 INFO L85 PathProgramCache]: Analyzing trace with hash -556416428, now seen corresponding path program 1 times [2025-01-10 01:42:45,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:42:45,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036581339] [2025-01-10 01:42:45,207 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:42:45,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:42:45,219 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-01-10 01:42:45,228 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-01-10 01:42:45,228 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:42:45,228 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:42:45,310 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-01-10 01:42:45,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:42:45,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036581339] [2025-01-10 01:42:45,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036581339] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:42:45,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [203635038] [2025-01-10 01:42:45,311 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:42:45,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:42:45,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:42:45,312 INFO L229 MonitoredProcess]: Starting monitored process 13 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 01:42:45,315 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-01-10 01:42:45,424 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-01-10 01:42:45,457 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-01-10 01:42:45,457 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:42:45,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:42:45,460 INFO L256 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-10 01:42:45,461 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:42:45,599 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-01-10 01:42:45,599 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 01:42:45,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [203635038] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:42:45,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 01:42:45,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [6] total 13 [2025-01-10 01:42:45,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256894253] [2025-01-10 01:42:45,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:42:45,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-10 01:42:45,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:42:45,600 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-10 01:42:45,600 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2025-01-10 01:42:45,600 INFO L87 Difference]: Start difference. First operand 118 states and 132 transitions. Second operand has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 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 01:42:45,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:42:45,641 INFO L93 Difference]: Finished difference Result 118 states and 132 transitions. [2025-01-10 01:42:45,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 01:42:45,642 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 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 55 [2025-01-10 01:42:45,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:42:45,642 INFO L225 Difference]: With dead ends: 118 [2025-01-10 01:42:45,642 INFO L226 Difference]: Without dead ends: 64 [2025-01-10 01:42:45,642 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2025-01-10 01:42:45,642 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 5 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:42:45,643 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 106 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:42:45,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2025-01-10 01:42:45,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2025-01-10 01:42:45,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 63 states have (on average 1.0952380952380953) internal successors, (69), 63 states have internal predecessors, (69), 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 01:42:45,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 69 transitions. [2025-01-10 01:42:45,645 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 69 transitions. Word has length 55 [2025-01-10 01:42:45,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:42:45,649 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 69 transitions. [2025-01-10 01:42:45,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 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 01:42:45,649 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 69 transitions. [2025-01-10 01:42:45,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-01-10 01:42:45,649 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:42:45,650 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2025-01-10 01:42:45,659 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-01-10 01:42:45,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:42:45,850 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-01-10 01:42:45,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:42:45,850 INFO L85 PathProgramCache]: Analyzing trace with hash -1842478312, now seen corresponding path program 2 times [2025-01-10 01:42:45,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:42:45,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3405116] [2025-01-10 01:42:45,851 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:42:45,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:42:45,866 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 63 statements into 2 equivalence classes. [2025-01-10 01:42:45,882 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 11 of 63 statements. [2025-01-10 01:42:45,883 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 01:42:45,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:42:45,904 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 8 proven. 32 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2025-01-10 01:42:45,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:42:45,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3405116] [2025-01-10 01:42:45,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3405116] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:42:45,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1998910867] [2025-01-10 01:42:45,906 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:42:45,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:42:45,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:42:45,911 INFO L229 MonitoredProcess]: Starting monitored process 14 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 01:42:45,916 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-01-10 01:42:46,077 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 63 statements into 2 equivalence classes. [2025-01-10 01:42:46,085 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 11 of 63 statements. [2025-01-10 01:42:46,085 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 01:42:46,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:42:46,085 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 01:42:46,086 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:42:46,185 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2025-01-10 01:42:46,186 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:42:46,283 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2025-01-10 01:42:46,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1998910867] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:42:46,284 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:42:46,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 9 [2025-01-10 01:42:46,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073003090] [2025-01-10 01:42:46,285 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:42:46,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-10 01:42:46,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:42:46,285 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-10 01:42:46,286 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-01-10 01:42:46,286 INFO L87 Difference]: Start difference. First operand 64 states and 69 transitions. Second operand has 10 states, 9 states have (on average 9.0) internal successors, (81), 10 states have internal predecessors, (81), 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 01:42:46,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:42:46,309 INFO L93 Difference]: Finished difference Result 64 states and 69 transitions. [2025-01-10 01:42:46,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 01:42:46,309 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 9.0) internal successors, (81), 10 states have internal predecessors, (81), 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 63 [2025-01-10 01:42:46,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:42:46,309 INFO L225 Difference]: With dead ends: 64 [2025-01-10 01:42:46,309 INFO L226 Difference]: Without dead ends: 0 [2025-01-10 01:42:46,310 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-01-10 01:42:46,310 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 5 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:42:46,310 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 45 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:42:46,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-01-10 01:42:46,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-01-10 01:42:46,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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 01:42:46,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-01-10 01:42:46,312 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 63 [2025-01-10 01:42:46,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:42:46,313 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-10 01:42:46,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 9.0) internal successors, (81), 10 states have internal predecessors, (81), 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 01:42:46,313 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-01-10 01:42:46,313 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-01-10 01:42:46,315 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 14 remaining) [2025-01-10 01:42:46,315 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 14 remaining) [2025-01-10 01:42:46,315 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 14 remaining) [2025-01-10 01:42:46,319 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 14 remaining) [2025-01-10 01:42:46,319 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 14 remaining) [2025-01-10 01:42:46,320 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 14 remaining) [2025-01-10 01:42:46,320 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 14 remaining) [2025-01-10 01:42:46,320 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 14 remaining) [2025-01-10 01:42:46,320 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 14 remaining) [2025-01-10 01:42:46,320 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 14 remaining) [2025-01-10 01:42:46,320 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 14 remaining) [2025-01-10 01:42:46,320 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 14 remaining) [2025-01-10 01:42:46,320 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 14 remaining) [2025-01-10 01:42:46,320 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 14 remaining) [2025-01-10 01:42:46,331 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-01-10 01:42:46,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:42:46,523 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:42:46,524 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-01-10 01:42:46,662 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-10 01:42:46,673 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~i~0 [2025-01-10 01:42:46,673 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~len~0 [2025-01-10 01:42:46,674 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~i~0 [2025-01-10 01:42:46,674 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~len~0 [2025-01-10 01:42:46,674 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~i~0 [2025-01-10 01:42:46,674 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~len~0 [2025-01-10 01:42:46,674 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~i~0 [2025-01-10 01:42:46,674 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~len~0 [2025-01-10 01:42:46,675 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 01:42:46 BoogieIcfgContainer [2025-01-10 01:42:46,675 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-10 01:42:46,675 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-10 01:42:46,675 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-10 01:42:46,675 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-10 01:42:46,676 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:42:37" (3/4) ... [2025-01-10 01:42:46,677 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-10 01:42:46,683 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2025-01-10 01:42:46,683 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2025-01-10 01:42:46,684 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-10 01:42:46,684 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-10 01:42:46,736 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-10 01:42:46,736 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-10 01:42:46,736 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-10 01:42:46,737 INFO L158 Benchmark]: Toolchain (without parser) took 10277.44ms. Allocated memory was 142.6MB in the beginning and 218.1MB in the end (delta: 75.5MB). Free memory was 111.9MB in the beginning and 105.9MB in the end (delta: 6.1MB). Peak memory consumption was 81.1MB. Max. memory is 16.1GB. [2025-01-10 01:42:46,737 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 123.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 01:42:46,737 INFO L158 Benchmark]: CACSL2BoogieTranslator took 418.96ms. Allocated memory is still 142.6MB. Free memory was 111.9MB in the beginning and 94.3MB in the end (delta: 17.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-10 01:42:46,737 INFO L158 Benchmark]: Boogie Procedure Inliner took 21.97ms. Allocated memory is still 142.6MB. Free memory was 94.3MB in the beginning and 92.8MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 01:42:46,737 INFO L158 Benchmark]: Boogie Preprocessor took 23.55ms. Allocated memory is still 142.6MB. Free memory was 92.8MB in the beginning and 90.4MB in the end (delta: 2.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 01:42:46,737 INFO L158 Benchmark]: RCFGBuilder took 410.60ms. Allocated memory is still 142.6MB. Free memory was 90.4MB in the beginning and 74.1MB in the end (delta: 16.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 01:42:46,738 INFO L158 Benchmark]: TraceAbstraction took 9336.32ms. Allocated memory was 142.6MB in the beginning and 218.1MB in the end (delta: 75.5MB). Free memory was 73.6MB in the beginning and 114.0MB in the end (delta: -40.4MB). Peak memory consumption was 30.8MB. Max. memory is 16.1GB. [2025-01-10 01:42:46,738 INFO L158 Benchmark]: Witness Printer took 60.96ms. Allocated memory is still 218.1MB. Free memory was 114.0MB in the beginning and 105.9MB in the end (delta: 8.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 01:42:46,739 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 123.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 418.96ms. Allocated memory is still 142.6MB. Free memory was 111.9MB in the beginning and 94.3MB in the end (delta: 17.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 21.97ms. Allocated memory is still 142.6MB. Free memory was 94.3MB in the beginning and 92.8MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 23.55ms. Allocated memory is still 142.6MB. Free memory was 92.8MB in the beginning and 90.4MB in the end (delta: 2.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 410.60ms. Allocated memory is still 142.6MB. Free memory was 90.4MB in the beginning and 74.1MB in the end (delta: 16.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 9336.32ms. Allocated memory was 142.6MB in the beginning and 218.1MB in the end (delta: 75.5MB). Free memory was 73.6MB in the beginning and 114.0MB in the end (delta: -40.4MB). Peak memory consumption was 30.8MB. Max. memory is 16.1GB. * Witness Printer took 60.96ms. Allocated memory is still 218.1MB. Free memory was 114.0MB in the beginning and 105.9MB in the end (delta: 8.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~i~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~len~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~i~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~len~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~i~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~len~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~i~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~len~0 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 585]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 585]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 619]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 619]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 609]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 609]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 618]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 618]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 623]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 623]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 602]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 602]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 622]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 622]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 51 locations, 14 error locations. Started 1 CEGAR loops. OverallTime: 9.1s, OverallIterations: 25, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 574 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 574 mSDsluCounter, 2601 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1843 mSDsCounter, 82 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1404 IncrementalHoareTripleChecker+Invalid, 1486 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 82 mSolverCounterUnsat, 758 mSDtfsCounter, 1404 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 978 GetRequests, 804 SyntacticMatches, 12 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 410 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=118occurred in iteration=23, InterpolantAutomatonStates: 156, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 25 MinimizatonAttempts, 107 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 1235 NumberOfCodeBlocks, 1119 NumberOfCodeBlocksAsserted, 40 NumberOfCheckSat, 1575 ConstructedInterpolants, 0 QuantifiedInterpolants, 3769 SizeOfPredicates, 10 NumberOfNonLiveVariables, 3154 ConjunctsInSsa, 75 ConjunctsInUnsatCore, 48 InterpolantComputations, 15 PerfectInterpolantSequences, 773/998 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 14 specifications checked. All of them hold - InvariantResult [Line: 622]: Loop Invariant Derived loop invariant: ((((i == 0) && (len == 2)) || (((i <= 2147483645) && (2 <= i)) && (len == 2))) || ((i == 1) && (len == 2))) - InvariantResult [Line: 585]: Loop Invariant Derived loop invariant: (((2 == len) && (len == 2)) || ((len <= 1) && (len == 2))) - InvariantResult [Line: 607]: Loop Invariant Derived loop invariant: ((index <= 2147483648) || (index == 0)) - InvariantResult [Line: 618]: Loop Invariant Derived loop invariant: (((i == 0) && (len == 2)) || (((1 <= i) && (i <= 2147483645)) && (len == 2))) - InvariantResult [Line: 600]: Loop Invariant Derived loop invariant: ((index <= 2147483648) || (index == 0)) RESULT: Ultimate proved your program to be correct! [2025-01-10 01:42:46,751 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE