./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_postinc_08_good.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_postinc_08_good.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 5b8525e411339426e47b0c6cded986bded6156754572b2487a7c059c496e530e --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 03:45:26,893 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 03:45:26,966 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-01-10 03:45:26,971 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 03:45:26,972 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 03:45:26,993 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 03:45:26,994 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 03:45:26,994 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 03:45:26,995 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 03:45:26,995 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 03:45:26,996 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 03:45:26,996 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 03:45:26,996 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 03:45:26,996 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 03:45:26,997 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 03:45:26,997 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 03:45:26,997 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 03:45:26,997 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 03:45:26,997 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 03:45:26,998 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 03:45:26,998 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 03:45:26,998 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 03:45:26,998 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 03:45:26,998 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 03:45:26,998 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 03:45:26,998 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 03:45:26,998 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 03:45:26,998 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 03:45:26,998 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 03:45:26,999 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 03:45:26,999 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 03:45:26,999 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 03:45:26,999 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 03:45:26,999 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 03:45:26,999 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 03:45:27,000 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 03:45:27,000 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 03:45:27,000 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 03:45:27,000 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 03:45:27,000 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 03:45:27,000 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 03:45:27,000 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 03:45:27,000 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 03:45:27,000 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 03:45:27,000 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 03:45:27,000 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 03:45:27,000 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 03:45:27,000 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5b8525e411339426e47b0c6cded986bded6156754572b2487a7c059c496e530e [2025-01-10 03:45:27,297 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 03:45:27,308 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 03:45:27,310 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 03:45:27,313 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 03:45:27,313 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 03:45:27,314 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_postinc_08_good.i [2025-01-10 03:45:28,570 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bee66dcb2/d3ee34343d4c44c4bbd5888ddff16706/FLAGbeefb9e27 [2025-01-10 03:45:28,973 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 03:45:28,973 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_postinc_08_good.i [2025-01-10 03:45:28,998 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bee66dcb2/d3ee34343d4c44c4bbd5888ddff16706/FLAGbeefb9e27 [2025-01-10 03:45:29,132 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bee66dcb2/d3ee34343d4c44c4bbd5888ddff16706 [2025-01-10 03:45:29,135 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 03:45:29,137 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 03:45:29,138 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 03:45:29,138 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 03:45:29,142 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 03:45:29,143 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 03:45:29" (1/1) ... [2025-01-10 03:45:29,144 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@368dfe1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:45:29, skipping insertion in model container [2025-01-10 03:45:29,146 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 03:45:29" (1/1) ... [2025-01-10 03:45:29,196 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 03:45:29,745 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 03:45:29,756 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 03:45:29,824 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 03:45:29,936 INFO L204 MainTranslator]: Completed translation [2025-01-10 03:45:29,936 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:45:29 WrapperNode [2025-01-10 03:45:29,936 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 03:45:29,937 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 03:45:29,937 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 03:45:29,937 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 03:45:29,942 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:45:29" (1/1) ... [2025-01-10 03:45:29,965 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:45:29" (1/1) ... [2025-01-10 03:45:29,995 INFO L138 Inliner]: procedures = 504, calls = 54, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 169 [2025-01-10 03:45:29,996 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 03:45:29,996 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 03:45:29,996 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 03:45:29,996 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 03:45:30,007 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:45:29" (1/1) ... [2025-01-10 03:45:30,008 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:45:29" (1/1) ... [2025-01-10 03:45:30,010 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:45:29" (1/1) ... [2025-01-10 03:45:30,035 INFO L175 MemorySlicer]: Split 2 memory accesses to 2 slices as follows [1, 1]. 50 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [1, 1]. The 0 writes are split as follows [0, 0]. [2025-01-10 03:45:30,038 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:45:29" (1/1) ... [2025-01-10 03:45:30,039 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:45:29" (1/1) ... [2025-01-10 03:45:30,043 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:45:29" (1/1) ... [2025-01-10 03:45:30,046 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:45:29" (1/1) ... [2025-01-10 03:45:30,052 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:45:29" (1/1) ... [2025-01-10 03:45:30,053 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:45:29" (1/1) ... [2025-01-10 03:45:30,054 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:45:29" (1/1) ... [2025-01-10 03:45:30,058 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 03:45:30,059 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 03:45:30,059 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 03:45:30,059 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 03:45:30,060 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:45:29" (1/1) ... [2025-01-10 03:45:30,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 03:45:30,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 03:45:30,115 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 03:45:30,116 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 03:45:30,148 INFO L130 BoogieDeclarations]: Found specification of procedure printIntLine [2025-01-10 03:45:30,148 INFO L138 BoogieDeclarations]: Found implementation of procedure printIntLine [2025-01-10 03:45:30,149 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2025-01-10 03:45:30,149 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2025-01-10 03:45:30,149 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 03:45:30,149 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 03:45:30,149 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 03:45:30,149 INFO L130 BoogieDeclarations]: Found specification of procedure staticReturnsTrue [2025-01-10 03:45:30,149 INFO L138 BoogieDeclarations]: Found implementation of procedure staticReturnsTrue [2025-01-10 03:45:30,149 INFO L130 BoogieDeclarations]: Found specification of procedure staticReturnsFalse [2025-01-10 03:45:30,149 INFO L138 BoogieDeclarations]: Found implementation of procedure staticReturnsFalse [2025-01-10 03:45:30,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 03:45:30,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 03:45:30,253 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 03:45:30,255 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 03:45:30,479 INFO L? ?]: Removed 34 outVars from TransFormulas that were not future-live. [2025-01-10 03:45:30,480 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 03:45:30,493 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 03:45:30,494 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 03:45:30,494 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 03:45:30 BoogieIcfgContainer [2025-01-10 03:45:30,494 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 03:45:30,497 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 03:45:30,497 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 03:45:30,501 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 03:45:30,501 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 03:45:29" (1/3) ... [2025-01-10 03:45:30,502 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7255bdd5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 03:45:30, skipping insertion in model container [2025-01-10 03:45:30,503 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:45:29" (2/3) ... [2025-01-10 03:45:30,504 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7255bdd5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 03:45:30, skipping insertion in model container [2025-01-10 03:45:30,504 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 03:45:30" (3/3) ... [2025-01-10 03:45:30,506 INFO L128 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_fgets_postinc_08_good.i [2025-01-10 03:45:30,524 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 03:45:30,526 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG CWE190_Integer_Overflow__int_fgets_postinc_08_good.i that has 5 procedures, 87 locations, 1 initial locations, 0 loop locations, and 8 error locations. [2025-01-10 03:45:30,595 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 03:45:30,607 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;@59f5b3c5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 03:45:30,608 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-01-10 03:45:30,613 INFO L276 IsEmpty]: Start isEmpty. Operand has 87 states, 54 states have (on average 1.3888888888888888) internal successors, (75), 68 states have internal predecessors, (75), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2025-01-10 03:45:30,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-01-10 03:45:30,619 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 03:45:30,620 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 03:45:30,620 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 03:45:30,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 03:45:30,626 INFO L85 PathProgramCache]: Analyzing trace with hash 890812736, now seen corresponding path program 1 times [2025-01-10 03:45:30,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 03:45:30,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413063519] [2025-01-10 03:45:30,635 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 03:45:30,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 03:45:30,732 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-10 03:45:30,760 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-10 03:45:30,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 03:45:30,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 03:45:30,926 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 03:45:30,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 03:45:30,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413063519] [2025-01-10 03:45:30,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413063519] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 03:45:30,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 03:45:30,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 03:45:30,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400788546] [2025-01-10 03:45:30,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 03:45:30,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 03:45:30,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 03:45:30,949 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 03:45:30,950 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 03:45:30,951 INFO L87 Difference]: Start difference. First operand has 87 states, 54 states have (on average 1.3888888888888888) internal successors, (75), 68 states have internal predecessors, (75), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-10 03:45:30,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 03:45:30,980 INFO L93 Difference]: Finished difference Result 164 states and 215 transitions. [2025-01-10 03:45:30,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 03:45:30,982 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2025-01-10 03:45:30,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 03:45:30,988 INFO L225 Difference]: With dead ends: 164 [2025-01-10 03:45:30,988 INFO L226 Difference]: Without dead ends: 78 [2025-01-10 03:45:30,991 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 03:45:30,993 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 0 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 331 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 03:45:30,994 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 331 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 03:45:31,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2025-01-10 03:45:31,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2025-01-10 03:45:31,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 48 states have (on average 1.375) internal successors, (66), 61 states have internal predecessors, (66), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2025-01-10 03:45:31,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 102 transitions. [2025-01-10 03:45:31,028 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 102 transitions. Word has length 22 [2025-01-10 03:45:31,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 03:45:31,031 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 102 transitions. [2025-01-10 03:45:31,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-10 03:45:31,031 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 102 transitions. [2025-01-10 03:45:31,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-01-10 03:45:31,032 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 03:45:31,032 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 03:45:31,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 03:45:31,033 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 03:45:31,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 03:45:31,034 INFO L85 PathProgramCache]: Analyzing trace with hash 770660731, now seen corresponding path program 1 times [2025-01-10 03:45:31,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 03:45:31,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743242134] [2025-01-10 03:45:31,034 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 03:45:31,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 03:45:31,058 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-10 03:45:31,077 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-10 03:45:31,077 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 03:45:31,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 03:45:31,201 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 03:45:31,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 03:45:31,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743242134] [2025-01-10 03:45:31,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743242134] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 03:45:31,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 03:45:31,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 03:45:31,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658022749] [2025-01-10 03:45:31,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 03:45:31,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 03:45:31,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 03:45:31,205 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 03:45:31,205 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 03:45:31,206 INFO L87 Difference]: Start difference. First operand 78 states and 102 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-10 03:45:31,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 03:45:31,256 INFO L93 Difference]: Finished difference Result 79 states and 103 transitions. [2025-01-10 03:45:31,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 03:45:31,256 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 24 [2025-01-10 03:45:31,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 03:45:31,258 INFO L225 Difference]: With dead ends: 79 [2025-01-10 03:45:31,258 INFO L226 Difference]: Without dead ends: 78 [2025-01-10 03:45:31,259 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 03:45:31,260 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 5 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 273 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 03:45:31,260 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 273 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 03:45:31,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2025-01-10 03:45:31,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2025-01-10 03:45:31,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 48 states have (on average 1.3541666666666667) internal successors, (65), 60 states have internal predecessors, (65), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2025-01-10 03:45:31,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 101 transitions. [2025-01-10 03:45:31,279 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 101 transitions. Word has length 24 [2025-01-10 03:45:31,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 03:45:31,280 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 101 transitions. [2025-01-10 03:45:31,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-10 03:45:31,280 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 101 transitions. [2025-01-10 03:45:31,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-01-10 03:45:31,282 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 03:45:31,282 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 03:45:31,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 03:45:31,282 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 03:45:31,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 03:45:31,283 INFO L85 PathProgramCache]: Analyzing trace with hash -1879321038, now seen corresponding path program 1 times [2025-01-10 03:45:31,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 03:45:31,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547726789] [2025-01-10 03:45:31,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 03:45:31,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 03:45:31,308 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-10 03:45:31,318 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-10 03:45:31,322 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 03:45:31,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 03:45:31,411 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 03:45:31,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 03:45:31,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547726789] [2025-01-10 03:45:31,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547726789] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 03:45:31,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 03:45:31,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 03:45:31,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597212625] [2025-01-10 03:45:31,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 03:45:31,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 03:45:31,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 03:45:31,413 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 03:45:31,413 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 03:45:31,413 INFO L87 Difference]: Start difference. First operand 77 states and 101 transitions. Second operand has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-10 03:45:31,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 03:45:31,435 INFO L93 Difference]: Finished difference Result 77 states and 101 transitions. [2025-01-10 03:45:31,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 03:45:31,437 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 25 [2025-01-10 03:45:31,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 03:45:31,439 INFO L225 Difference]: With dead ends: 77 [2025-01-10 03:45:31,439 INFO L226 Difference]: Without dead ends: 76 [2025-01-10 03:45:31,440 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 03:45:31,440 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 0 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 03:45:31,441 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 193 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 03:45:31,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2025-01-10 03:45:31,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2025-01-10 03:45:31,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 48 states have (on average 1.3333333333333333) internal successors, (64), 59 states have internal predecessors, (64), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2025-01-10 03:45:31,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 100 transitions. [2025-01-10 03:45:31,458 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 100 transitions. Word has length 25 [2025-01-10 03:45:31,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 03:45:31,458 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 100 transitions. [2025-01-10 03:45:31,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-10 03:45:31,458 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 100 transitions. [2025-01-10 03:45:31,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-01-10 03:45:31,459 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 03:45:31,459 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 03:45:31,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 03:45:31,460 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 03:45:31,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 03:45:31,460 INFO L85 PathProgramCache]: Analyzing trace with hash -1109155225, now seen corresponding path program 1 times [2025-01-10 03:45:31,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 03:45:31,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440126863] [2025-01-10 03:45:31,461 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 03:45:31,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 03:45:31,479 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-01-10 03:45:31,484 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-01-10 03:45:31,485 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 03:45:31,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 03:45:31,564 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-01-10 03:45:31,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 03:45:31,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440126863] [2025-01-10 03:45:31,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440126863] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 03:45:31,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 03:45:31,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 03:45:31,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146655042] [2025-01-10 03:45:31,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 03:45:31,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 03:45:31,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 03:45:31,567 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 03:45:31,567 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 03:45:31,567 INFO L87 Difference]: Start difference. First operand 76 states and 100 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2025-01-10 03:45:31,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 03:45:31,590 INFO L93 Difference]: Finished difference Result 132 states and 170 transitions. [2025-01-10 03:45:31,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 03:45:31,591 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), 2 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 42 [2025-01-10 03:45:31,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 03:45:31,592 INFO L225 Difference]: With dead ends: 132 [2025-01-10 03:45:31,592 INFO L226 Difference]: Without dead ends: 75 [2025-01-10 03:45:31,592 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 03:45:31,593 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 0 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 280 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 03:45:31,593 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 280 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 03:45:31,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-01-10 03:45:31,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2025-01-10 03:45:31,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 48 states have (on average 1.3125) internal successors, (63), 58 states have internal predecessors, (63), 17 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-01-10 03:45:31,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 97 transitions. [2025-01-10 03:45:31,601 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 97 transitions. Word has length 42 [2025-01-10 03:45:31,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 03:45:31,601 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 97 transitions. [2025-01-10 03:45:31,601 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), 2 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2025-01-10 03:45:31,602 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 97 transitions. [2025-01-10 03:45:31,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-01-10 03:45:31,603 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 03:45:31,603 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 03:45:31,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 03:45:31,603 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 03:45:31,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 03:45:31,604 INFO L85 PathProgramCache]: Analyzing trace with hash 98430113, now seen corresponding path program 1 times [2025-01-10 03:45:31,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 03:45:31,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787558750] [2025-01-10 03:45:31,604 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 03:45:31,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 03:45:31,619 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-01-10 03:45:31,626 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-01-10 03:45:31,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 03:45:31,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 03:45:31,701 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-10 03:45:31,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 03:45:31,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787558750] [2025-01-10 03:45:31,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787558750] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 03:45:31,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [668711097] [2025-01-10 03:45:31,703 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 03:45:31,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 03:45:31,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 03:45:31,707 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 03:45:31,708 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 03:45:31,780 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-01-10 03:45:31,823 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-01-10 03:45:31,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 03:45:31,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 03:45:31,830 INFO L256 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 03:45:31,838 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 03:45:31,901 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-10 03:45:31,902 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 03:45:31,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [668711097] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 03:45:31,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 03:45:31,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-01-10 03:45:31,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477417317] [2025-01-10 03:45:31,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 03:45:31,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 03:45:31,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 03:45:31,905 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 03:45:31,905 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-10 03:45:31,905 INFO L87 Difference]: Start difference. First operand 75 states and 97 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2025-01-10 03:45:31,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 03:45:31,931 INFO L93 Difference]: Finished difference Result 124 states and 156 transitions. [2025-01-10 03:45:31,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 03:45:31,931 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 43 [2025-01-10 03:45:31,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 03:45:31,932 INFO L225 Difference]: With dead ends: 124 [2025-01-10 03:45:31,932 INFO L226 Difference]: Without dead ends: 75 [2025-01-10 03:45:31,933 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-10 03:45:31,933 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 0 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 277 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 03:45:31,934 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 277 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 03:45:31,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-01-10 03:45:31,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2025-01-10 03:45:31,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 48 states have (on average 1.2916666666666667) internal successors, (62), 58 states have internal predecessors, (62), 17 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-01-10 03:45:31,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 96 transitions. [2025-01-10 03:45:31,950 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 96 transitions. Word has length 43 [2025-01-10 03:45:31,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 03:45:31,950 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 96 transitions. [2025-01-10 03:45:31,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2025-01-10 03:45:31,951 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 96 transitions. [2025-01-10 03:45:31,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-01-10 03:45:31,952 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 03:45:31,952 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 03:45:31,959 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 03:45:32,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 03:45:32,156 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 03:45:32,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 03:45:32,157 INFO L85 PathProgramCache]: Analyzing trace with hash -1824274276, now seen corresponding path program 1 times [2025-01-10 03:45:32,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 03:45:32,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403118070] [2025-01-10 03:45:32,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 03:45:32,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 03:45:32,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-01-10 03:45:32,184 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-01-10 03:45:32,184 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 03:45:32,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 03:45:32,266 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-01-10 03:45:32,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 03:45:32,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403118070] [2025-01-10 03:45:32,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403118070] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 03:45:32,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 03:45:32,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 03:45:32,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442916460] [2025-01-10 03:45:32,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 03:45:32,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 03:45:32,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 03:45:32,268 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 03:45:32,268 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 03:45:32,268 INFO L87 Difference]: Start difference. First operand 75 states and 96 transitions. Second operand has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-01-10 03:45:32,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 03:45:32,297 INFO L93 Difference]: Finished difference Result 76 states and 97 transitions. [2025-01-10 03:45:32,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 03:45:32,301 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 45 [2025-01-10 03:45:32,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 03:45:32,302 INFO L225 Difference]: With dead ends: 76 [2025-01-10 03:45:32,302 INFO L226 Difference]: Without dead ends: 75 [2025-01-10 03:45:32,302 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 03:45:32,303 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 5 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 255 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 03:45:32,303 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 255 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 03:45:32,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-01-10 03:45:32,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 74. [2025-01-10 03:45:32,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 48 states have (on average 1.2708333333333333) internal successors, (61), 57 states have internal predecessors, (61), 17 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-01-10 03:45:32,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 95 transitions. [2025-01-10 03:45:32,319 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 95 transitions. Word has length 45 [2025-01-10 03:45:32,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 03:45:32,320 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 95 transitions. [2025-01-10 03:45:32,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-01-10 03:45:32,320 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 95 transitions. [2025-01-10 03:45:32,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-01-10 03:45:32,321 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 03:45:32,321 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 03:45:32,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 03:45:32,321 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 03:45:32,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 03:45:32,322 INFO L85 PathProgramCache]: Analyzing trace with hash -717927596, now seen corresponding path program 1 times [2025-01-10 03:45:32,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 03:45:32,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46739182] [2025-01-10 03:45:32,322 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 03:45:32,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 03:45:32,345 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-01-10 03:45:32,354 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-01-10 03:45:32,355 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 03:45:32,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 03:45:32,401 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-01-10 03:45:32,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 03:45:32,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46739182] [2025-01-10 03:45:32,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46739182] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 03:45:32,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 03:45:32,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 03:45:32,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373252921] [2025-01-10 03:45:32,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 03:45:32,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 03:45:32,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 03:45:32,403 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 03:45:32,403 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 03:45:32,404 INFO L87 Difference]: Start difference. First operand 74 states and 95 transitions. Second operand has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-01-10 03:45:32,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 03:45:32,419 INFO L93 Difference]: Finished difference Result 74 states and 95 transitions. [2025-01-10 03:45:32,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 03:45:32,420 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 46 [2025-01-10 03:45:32,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 03:45:32,421 INFO L225 Difference]: With dead ends: 74 [2025-01-10 03:45:32,422 INFO L226 Difference]: Without dead ends: 73 [2025-01-10 03:45:32,423 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 03:45:32,423 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 0 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 03:45:32,424 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 181 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 03:45:32,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2025-01-10 03:45:32,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2025-01-10 03:45:32,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 48 states have (on average 1.25) internal successors, (60), 56 states have internal predecessors, (60), 17 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-01-10 03:45:32,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 94 transitions. [2025-01-10 03:45:32,430 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 94 transitions. Word has length 46 [2025-01-10 03:45:32,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 03:45:32,431 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 94 transitions. [2025-01-10 03:45:32,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-01-10 03:45:32,431 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 94 transitions. [2025-01-10 03:45:32,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-01-10 03:45:32,432 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 03:45:32,433 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 03:45:32,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 03:45:32,433 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 03:45:32,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 03:45:32,433 INFO L85 PathProgramCache]: Analyzing trace with hash -857706864, now seen corresponding path program 1 times [2025-01-10 03:45:32,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 03:45:32,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433560288] [2025-01-10 03:45:32,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 03:45:32,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 03:45:32,450 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-01-10 03:45:32,455 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-01-10 03:45:32,455 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 03:45:32,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 03:45:32,542 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-01-10 03:45:32,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 03:45:32,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433560288] [2025-01-10 03:45:32,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433560288] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 03:45:32,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2109713862] [2025-01-10 03:45:32,545 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 03:45:32,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 03:45:32,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 03:45:32,549 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 03:45:32,553 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 03:45:32,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-01-10 03:45:32,663 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-01-10 03:45:32,663 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 03:45:32,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 03:45:32,666 INFO L256 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 03:45:32,669 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 03:45:32,705 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-10 03:45:32,706 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 03:45:32,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2109713862] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 03:45:32,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 03:45:32,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-01-10 03:45:32,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408946699] [2025-01-10 03:45:32,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 03:45:32,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 03:45:32,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 03:45:32,707 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 03:45:32,707 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-10 03:45:32,707 INFO L87 Difference]: Start difference. First operand 73 states and 94 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-10 03:45:32,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 03:45:32,722 INFO L93 Difference]: Finished difference Result 111 states and 137 transitions. [2025-01-10 03:45:32,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 03:45:32,723 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 57 [2025-01-10 03:45:32,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 03:45:32,724 INFO L225 Difference]: With dead ends: 111 [2025-01-10 03:45:32,724 INFO L226 Difference]: Without dead ends: 73 [2025-01-10 03:45:32,724 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-10 03:45:32,725 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 0 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 268 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 03:45:32,725 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 268 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 03:45:32,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2025-01-10 03:45:32,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2025-01-10 03:45:32,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 48 states have (on average 1.2291666666666667) internal successors, (59), 56 states have internal predecessors, (59), 17 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-01-10 03:45:32,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 93 transitions. [2025-01-10 03:45:32,735 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 93 transitions. Word has length 57 [2025-01-10 03:45:32,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 03:45:32,735 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 93 transitions. [2025-01-10 03:45:32,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-10 03:45:32,735 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 93 transitions. [2025-01-10 03:45:32,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-01-10 03:45:32,736 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 03:45:32,736 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 03:45:32,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 03:45:32,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 03:45:32,937 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 03:45:32,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 03:45:32,938 INFO L85 PathProgramCache]: Analyzing trace with hash -188931298, now seen corresponding path program 1 times [2025-01-10 03:45:32,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 03:45:32,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612754141] [2025-01-10 03:45:32,938 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 03:45:32,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 03:45:32,955 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-01-10 03:45:32,966 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-01-10 03:45:32,966 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 03:45:32,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 03:45:33,069 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-01-10 03:45:33,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 03:45:33,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612754141] [2025-01-10 03:45:33,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612754141] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 03:45:33,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 03:45:33,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 03:45:33,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519537604] [2025-01-10 03:45:33,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 03:45:33,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 03:45:33,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 03:45:33,071 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 03:45:33,071 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 03:45:33,071 INFO L87 Difference]: Start difference. First operand 73 states and 93 transitions. Second operand has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-01-10 03:45:33,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 03:45:33,097 INFO L93 Difference]: Finished difference Result 81 states and 103 transitions. [2025-01-10 03:45:33,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 03:45:33,098 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 63 [2025-01-10 03:45:33,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 03:45:33,099 INFO L225 Difference]: With dead ends: 81 [2025-01-10 03:45:33,099 INFO L226 Difference]: Without dead ends: 79 [2025-01-10 03:45:33,099 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 03:45:33,100 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 2 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 03:45:33,101 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 263 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 03:45:33,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2025-01-10 03:45:33,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 78. [2025-01-10 03:45:33,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 52 states have (on average 1.2307692307692308) internal successors, (64), 59 states have internal predecessors, (64), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-01-10 03:45:33,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 100 transitions. [2025-01-10 03:45:33,114 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 100 transitions. Word has length 63 [2025-01-10 03:45:33,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 03:45:33,115 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 100 transitions. [2025-01-10 03:45:33,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-01-10 03:45:33,116 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 100 transitions. [2025-01-10 03:45:33,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-01-10 03:45:33,117 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 03:45:33,117 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 03:45:33,118 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-10 03:45:33,118 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 03:45:33,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 03:45:33,119 INFO L85 PathProgramCache]: Analyzing trace with hash 1013844052, now seen corresponding path program 1 times [2025-01-10 03:45:33,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 03:45:33,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271377014] [2025-01-10 03:45:33,119 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 03:45:33,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 03:45:33,136 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-01-10 03:45:33,144 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-01-10 03:45:33,144 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 03:45:33,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 03:45:33,208 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-01-10 03:45:33,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 03:45:33,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271377014] [2025-01-10 03:45:33,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271377014] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 03:45:33,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 03:45:33,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 03:45:33,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17720398] [2025-01-10 03:45:33,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 03:45:33,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 03:45:33,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 03:45:33,209 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 03:45:33,209 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 03:45:33,210 INFO L87 Difference]: Start difference. First operand 78 states and 100 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (10), 1 states have call predecessors, (10), 2 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2025-01-10 03:45:33,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 03:45:33,225 INFO L93 Difference]: Finished difference Result 101 states and 124 transitions. [2025-01-10 03:45:33,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 03:45:33,226 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (10), 1 states have call predecessors, (10), 2 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) Word has length 68 [2025-01-10 03:45:33,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 03:45:33,227 INFO L225 Difference]: With dead ends: 101 [2025-01-10 03:45:33,227 INFO L226 Difference]: Without dead ends: 70 [2025-01-10 03:45:33,228 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 03:45:33,229 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 0 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 253 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 03:45:33,229 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 253 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 03:45:33,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2025-01-10 03:45:33,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2025-01-10 03:45:33,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 48 states have (on average 1.1666666666666667) internal successors, (56), 53 states have internal predecessors, (56), 16 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-01-10 03:45:33,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 88 transitions. [2025-01-10 03:45:33,239 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 88 transitions. Word has length 68 [2025-01-10 03:45:33,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 03:45:33,239 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 88 transitions. [2025-01-10 03:45:33,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (10), 1 states have call predecessors, (10), 2 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2025-01-10 03:45:33,240 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 88 transitions. [2025-01-10 03:45:33,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-01-10 03:45:33,241 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 03:45:33,241 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 03:45:33,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-10 03:45:33,241 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 03:45:33,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 03:45:33,242 INFO L85 PathProgramCache]: Analyzing trace with hash 59595581, now seen corresponding path program 1 times [2025-01-10 03:45:33,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 03:45:33,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372155776] [2025-01-10 03:45:33,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 03:45:33,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 03:45:33,259 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-01-10 03:45:33,265 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-01-10 03:45:33,266 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 03:45:33,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 03:45:33,323 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-01-10 03:45:33,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 03:45:33,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372155776] [2025-01-10 03:45:33,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372155776] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 03:45:33,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [542829156] [2025-01-10 03:45:33,323 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 03:45:33,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 03:45:33,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 03:45:33,327 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 03:45:33,328 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 03:45:33,405 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-01-10 03:45:33,440 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-01-10 03:45:33,440 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 03:45:33,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 03:45:33,443 INFO L256 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 03:45:33,445 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 03:45:33,492 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-10 03:45:33,492 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 03:45:33,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [542829156] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 03:45:33,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 03:45:33,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-01-10 03:45:33,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357379485] [2025-01-10 03:45:33,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 03:45:33,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 03:45:33,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 03:45:33,494 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 03:45:33,494 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-10 03:45:33,494 INFO L87 Difference]: Start difference. First operand 70 states and 88 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) [2025-01-10 03:45:33,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 03:45:33,513 INFO L93 Difference]: Finished difference Result 84 states and 103 transitions. [2025-01-10 03:45:33,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 03:45:33,513 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) Word has length 76 [2025-01-10 03:45:33,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 03:45:33,514 INFO L225 Difference]: With dead ends: 84 [2025-01-10 03:45:33,514 INFO L226 Difference]: Without dead ends: 70 [2025-01-10 03:45:33,514 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-10 03:45:33,515 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 0 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 250 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 03:45:33,515 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 250 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 03:45:33,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2025-01-10 03:45:33,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2025-01-10 03:45:33,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 48 states have (on average 1.1458333333333333) internal successors, (55), 53 states have internal predecessors, (55), 16 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-01-10 03:45:33,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 87 transitions. [2025-01-10 03:45:33,525 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 87 transitions. Word has length 76 [2025-01-10 03:45:33,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 03:45:33,527 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 87 transitions. [2025-01-10 03:45:33,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) [2025-01-10 03:45:33,527 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 87 transitions. [2025-01-10 03:45:33,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-01-10 03:45:33,528 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 03:45:33,528 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 03:45:33,537 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-10 03:45:33,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 03:45:33,729 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 03:45:33,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 03:45:33,729 INFO L85 PathProgramCache]: Analyzing trace with hash 1963041257, now seen corresponding path program 1 times [2025-01-10 03:45:33,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 03:45:33,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413289926] [2025-01-10 03:45:33,729 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 03:45:33,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 03:45:33,746 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-01-10 03:45:33,754 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-01-10 03:45:33,754 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 03:45:33,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 03:45:33,829 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-01-10 03:45:33,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 03:45:33,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413289926] [2025-01-10 03:45:33,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413289926] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 03:45:33,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 03:45:33,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 03:45:33,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063228431] [2025-01-10 03:45:33,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 03:45:33,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 03:45:33,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 03:45:33,832 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 03:45:33,832 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 03:45:33,832 INFO L87 Difference]: Start difference. First operand 70 states and 87 transitions. Second operand has 4 states, 3 states have (on average 13.666666666666666) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-10 03:45:33,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 03:45:33,854 INFO L93 Difference]: Finished difference Result 77 states and 94 transitions. [2025-01-10 03:45:33,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 03:45:33,855 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 13.666666666666666) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 83 [2025-01-10 03:45:33,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 03:45:33,856 INFO L225 Difference]: With dead ends: 77 [2025-01-10 03:45:33,856 INFO L226 Difference]: Without dead ends: 70 [2025-01-10 03:45:33,856 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 03:45:33,857 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 1 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 03:45:33,857 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 250 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 03:45:33,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2025-01-10 03:45:33,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2025-01-10 03:45:33,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 48 states have (on average 1.125) internal successors, (54), 53 states have internal predecessors, (54), 16 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-01-10 03:45:33,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 86 transitions. [2025-01-10 03:45:33,866 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 86 transitions. Word has length 83 [2025-01-10 03:45:33,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 03:45:33,866 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 86 transitions. [2025-01-10 03:45:33,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 13.666666666666666) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-10 03:45:33,866 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 86 transitions. [2025-01-10 03:45:33,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-01-10 03:45:33,869 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 03:45:33,869 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 03:45:33,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-10 03:45:33,870 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 03:45:33,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 03:45:33,870 INFO L85 PathProgramCache]: Analyzing trace with hash 1153694631, now seen corresponding path program 1 times [2025-01-10 03:45:33,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 03:45:33,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039332935] [2025-01-10 03:45:33,871 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 03:45:33,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 03:45:33,888 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-01-10 03:45:33,898 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-01-10 03:45:33,898 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 03:45:33,898 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 03:45:33,975 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-01-10 03:45:33,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 03:45:33,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039332935] [2025-01-10 03:45:33,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039332935] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 03:45:33,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [865724206] [2025-01-10 03:45:33,976 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 03:45:33,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 03:45:33,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 03:45:33,979 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 03:45:33,982 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 03:45:34,091 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-01-10 03:45:34,138 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-01-10 03:45:34,138 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 03:45:34,139 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 03:45:34,141 INFO L256 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 03:45:34,147 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 03:45:34,172 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-01-10 03:45:34,173 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 03:45:34,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [865724206] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 03:45:34,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 03:45:34,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-01-10 03:45:34,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609140012] [2025-01-10 03:45:34,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 03:45:34,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 03:45:34,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 03:45:34,176 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 03:45:34,176 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-10 03:45:34,176 INFO L87 Difference]: Start difference. First operand 70 states and 86 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (12), 3 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-10 03:45:34,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 03:45:34,188 INFO L93 Difference]: Finished difference Result 73 states and 88 transitions. [2025-01-10 03:45:34,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 03:45:34,189 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (12), 3 states have call predecessors, (12), 2 states have call successors, (12) Word has length 83 [2025-01-10 03:45:34,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 03:45:34,189 INFO L225 Difference]: With dead ends: 73 [2025-01-10 03:45:34,189 INFO L226 Difference]: Without dead ends: 0 [2025-01-10 03:45:34,190 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-10 03:45:34,190 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 0 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 03:45:34,191 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 227 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 03:45:34,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-01-10 03:45:34,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-01-10 03:45:34,193 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 03:45:34,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-01-10 03:45:34,193 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 83 [2025-01-10 03:45:34,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 03:45:34,193 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-10 03:45:34,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (12), 3 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-10 03:45:34,193 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-01-10 03:45:34,194 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-01-10 03:45:34,196 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2025-01-10 03:45:34,196 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2025-01-10 03:45:34,196 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2025-01-10 03:45:34,196 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2025-01-10 03:45:34,196 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2025-01-10 03:45:34,197 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2025-01-10 03:45:34,197 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2025-01-10 03:45:34,197 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2025-01-10 03:45:34,206 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 03:45:34,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-01-10 03:45:34,407 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 03:45:34,408 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-01-10 03:45:34,455 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-10 03:45:34,464 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 03:45:34 BoogieIcfgContainer [2025-01-10 03:45:34,466 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-10 03:45:34,467 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-10 03:45:34,467 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-10 03:45:34,468 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-10 03:45:34,468 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 03:45:30" (3/4) ... [2025-01-10 03:45:34,471 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-10 03:45:34,476 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure printLine [2025-01-10 03:45:34,476 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure staticReturnsFalse [2025-01-10 03:45:34,476 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure printIntLine [2025-01-10 03:45:34,476 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure staticReturnsTrue [2025-01-10 03:45:34,484 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2025-01-10 03:45:34,485 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2025-01-10 03:45:34,485 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-01-10 03:45:34,485 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-10 03:45:34,486 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-10 03:45:34,568 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-10 03:45:34,568 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-10 03:45:34,568 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-10 03:45:34,570 INFO L158 Benchmark]: Toolchain (without parser) took 5432.09ms. Allocated memory was 142.6MB in the beginning and 293.6MB in the end (delta: 151.0MB). Free memory was 103.4MB in the beginning and 171.6MB in the end (delta: -68.2MB). Peak memory consumption was 84.7MB. Max. memory is 16.1GB. [2025-01-10 03:45:34,570 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 116.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 03:45:34,571 INFO L158 Benchmark]: CACSL2BoogieTranslator took 798.22ms. Allocated memory is still 142.6MB. Free memory was 103.4MB in the beginning and 42.7MB in the end (delta: 60.7MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. [2025-01-10 03:45:34,571 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.53ms. Allocated memory is still 142.6MB. Free memory was 42.7MB in the beginning and 40.1MB in the end (delta: 2.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 03:45:34,573 INFO L158 Benchmark]: Boogie Preprocessor took 61.69ms. Allocated memory is still 142.6MB. Free memory was 40.1MB in the beginning and 37.9MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 03:45:34,573 INFO L158 Benchmark]: RCFGBuilder took 435.58ms. Allocated memory is still 142.6MB. Free memory was 37.9MB in the beginning and 89.1MB in the end (delta: -51.2MB). Peak memory consumption was 13.8MB. Max. memory is 16.1GB. [2025-01-10 03:45:34,573 INFO L158 Benchmark]: TraceAbstraction took 3970.03ms. Allocated memory was 142.6MB in the beginning and 293.6MB in the end (delta: 151.0MB). Free memory was 89.1MB in the beginning and 178.6MB in the end (delta: -89.5MB). Peak memory consumption was 62.4MB. Max. memory is 16.1GB. [2025-01-10 03:45:34,574 INFO L158 Benchmark]: Witness Printer took 101.01ms. Allocated memory is still 293.6MB. Free memory was 178.6MB in the beginning and 171.6MB in the end (delta: 7.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 03:45:34,575 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.21ms. Allocated memory is still 201.3MB. Free memory is still 116.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 798.22ms. Allocated memory is still 142.6MB. Free memory was 103.4MB in the beginning and 42.7MB in the end (delta: 60.7MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 58.53ms. Allocated memory is still 142.6MB. Free memory was 42.7MB in the beginning and 40.1MB in the end (delta: 2.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 61.69ms. Allocated memory is still 142.6MB. Free memory was 40.1MB in the beginning and 37.9MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 435.58ms. Allocated memory is still 142.6MB. Free memory was 37.9MB in the beginning and 89.1MB in the end (delta: -51.2MB). Peak memory consumption was 13.8MB. Max. memory is 16.1GB. * TraceAbstraction took 3970.03ms. Allocated memory was 142.6MB in the beginning and 293.6MB in the end (delta: 151.0MB). Free memory was 89.1MB in the beginning and 178.6MB in the end (delta: -89.5MB). Peak memory consumption was 62.4MB. Max. memory is 16.1GB. * Witness Printer took 101.01ms. Allocated memory is still 293.6MB. Free memory was 178.6MB in the beginning and 171.6MB in the end (delta: 7.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * 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: 1582]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1582]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1614]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1614]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1639]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1639]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1656]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1656]: 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 5 procedures, 87 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 3.8s, OverallIterations: 13, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 18 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 13 mSDsluCounter, 3301 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2109 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 114 IncrementalHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 1192 mSDtfsCounter, 114 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 299 GetRequests, 267 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=87occurred in iteration=0, InterpolantAutomatonStates: 50, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 13 MinimizatonAttempts, 3 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 936 NumberOfCodeBlocks, 936 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 919 ConstructedInterpolants, 0 QuantifiedInterpolants, 1079 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1050 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 17 InterpolantComputations, 13 PerfectInterpolantSequences, 483/493 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 8 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-01-10 03:45:34,596 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