./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/array-memsafety/openbsd_cstrncmp-alloca-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/array-memsafety/openbsd_cstrncmp-alloca-2.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e0283c4a072a13e5b82b0728b718582152e385c6ee1404b3ed9be4e37b84a0b2 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 01:22:33,062 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 01:22:33,150 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-01-10 01:22:33,156 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 01:22:33,156 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 01:22:33,172 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 01:22:33,173 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 01:22:33,173 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 01:22:33,173 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 01:22:33,173 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 01:22:33,173 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 01:22:33,173 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 01:22:33,174 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 01:22:33,174 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 01:22:33,174 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 01:22:33,174 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 01:22:33,174 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 01:22:33,174 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 01:22:33,174 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 01:22:33,174 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 01:22:33,174 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 01:22:33,175 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 01:22:33,175 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 01:22:33,175 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 01:22:33,175 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 01:22:33,175 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 01:22:33,175 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 01:22:33,175 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 01:22:33,175 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 01:22:33,175 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 01:22:33,175 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 01:22:33,175 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:22:33,175 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:22:33,175 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:22:33,176 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:22:33,176 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 01:22:33,176 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:22:33,176 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:22:33,176 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:22:33,176 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:22:33,176 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 01:22:33,176 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 01:22:33,176 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 01:22:33,176 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 01:22:33,176 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 01:22:33,176 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 01:22:33,176 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 01:22:33,176 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 01:22:33,176 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 01:22:33,176 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 01:22:33,176 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e0283c4a072a13e5b82b0728b718582152e385c6ee1404b3ed9be4e37b84a0b2 [2025-01-10 01:22:33,343 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 01:22:33,348 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 01:22:33,350 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 01:22:33,351 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 01:22:33,351 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 01:22:33,351 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety/openbsd_cstrncmp-alloca-2.i [2025-01-10 01:22:34,447 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/df22156a7/ad522b879ae743ccb03a70619a884923/FLAG92b59cae1 [2025-01-10 01:22:34,730 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 01:22:34,730 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/array-memsafety/openbsd_cstrncmp-alloca-2.i [2025-01-10 01:22:34,741 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/df22156a7/ad522b879ae743ccb03a70619a884923/FLAG92b59cae1 [2025-01-10 01:22:34,754 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/df22156a7/ad522b879ae743ccb03a70619a884923 [2025-01-10 01:22:34,756 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 01:22:34,756 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 01:22:34,758 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 01:22:34,758 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 01:22:34,768 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 01:22:34,769 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:22:34" (1/1) ... [2025-01-10 01:22:34,769 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@754daf9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:22:34, skipping insertion in model container [2025-01-10 01:22:34,769 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:22:34" (1/1) ... [2025-01-10 01:22:34,792 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 01:22:35,001 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:22:35,009 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 01:22:35,046 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:22:35,072 INFO L204 MainTranslator]: Completed translation [2025-01-10 01:22:35,074 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:22:35 WrapperNode [2025-01-10 01:22:35,075 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 01:22:35,075 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 01:22:35,075 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 01:22:35,076 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 01:22:35,081 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:22:35" (1/1) ... [2025-01-10 01:22:35,092 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:22:35" (1/1) ... [2025-01-10 01:22:35,107 INFO L138 Inliner]: procedures = 117, calls = 18, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 122 [2025-01-10 01:22:35,107 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 01:22:35,109 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 01:22:35,109 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 01:22:35,109 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 01:22:35,115 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:22:35" (1/1) ... [2025-01-10 01:22:35,116 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:22:35" (1/1) ... [2025-01-10 01:22:35,119 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:22:35" (1/1) ... [2025-01-10 01:22:35,133 INFO L175 MemorySlicer]: Split 9 memory accesses to 2 slices as follows [4, 5]. 56 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0, 0]. The 4 writes are split as follows [2, 2]. [2025-01-10 01:22:35,133 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:22:35" (1/1) ... [2025-01-10 01:22:35,133 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:22:35" (1/1) ... [2025-01-10 01:22:35,141 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:22:35" (1/1) ... [2025-01-10 01:22:35,141 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:22:35" (1/1) ... [2025-01-10 01:22:35,144 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:22:35" (1/1) ... [2025-01-10 01:22:35,145 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:22:35" (1/1) ... [2025-01-10 01:22:35,145 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:22:35" (1/1) ... [2025-01-10 01:22:35,147 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 01:22:35,147 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 01:22:35,147 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 01:22:35,147 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 01:22:35,148 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:22:35" (1/1) ... [2025-01-10 01:22:35,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:22:35,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:22:35,173 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-10 01:22:35,174 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-10 01:22:35,207 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 01:22:35,207 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-10 01:22:35,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 01:22:35,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-10 01:22:35,208 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-10 01:22:35,208 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-10 01:22:35,208 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 01:22:35,208 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 01:22:35,347 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 01:22:35,348 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 01:22:35,629 INFO L? ?]: Removed 44 outVars from TransFormulas that were not future-live. [2025-01-10 01:22:35,633 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 01:22:35,645 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 01:22:35,651 INFO L312 CfgBuilder]: Removed 3 assume(true) statements. [2025-01-10 01:22:35,651 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:22:35 BoogieIcfgContainer [2025-01-10 01:22:35,651 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 01:22:35,654 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 01:22:35,654 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 01:22:35,661 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 01:22:35,661 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 01:22:34" (1/3) ... [2025-01-10 01:22:35,662 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@102ff0dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:22:35, skipping insertion in model container [2025-01-10 01:22:35,662 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:22:35" (2/3) ... [2025-01-10 01:22:35,662 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@102ff0dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:22:35, skipping insertion in model container [2025-01-10 01:22:35,662 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:22:35" (3/3) ... [2025-01-10 01:22:35,663 INFO L128 eAbstractionObserver]: Analyzing ICFG openbsd_cstrncmp-alloca-2.i [2025-01-10 01:22:35,693 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 01:22:35,694 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG openbsd_cstrncmp-alloca-2.i that has 1 procedures, 49 locations, 1 initial locations, 3 loop locations, and 14 error locations. [2025-01-10 01:22:35,771 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 01:22:35,790 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;@6e9ddfd9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 01:22:35,791 INFO L334 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2025-01-10 01:22:35,798 INFO L276 IsEmpty]: Start isEmpty. Operand has 49 states, 34 states have (on average 1.7352941176470589) internal successors, (59), 48 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:22:35,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-01-10 01:22:35,806 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:22:35,807 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-01-10 01:22:35,807 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-01-10 01:22:35,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:22:35,822 INFO L85 PathProgramCache]: Analyzing trace with hash 889510733, now seen corresponding path program 1 times [2025-01-10 01:22:35,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:22:35,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964760318] [2025-01-10 01:22:35,835 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:22:35,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:22:35,952 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 01:22:35,978 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 01:22:35,980 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:22:35,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:22:36,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:22:36,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:22:36,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964760318] [2025-01-10 01:22:36,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964760318] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:22:36,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:22:36,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:22:36,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907606364] [2025-01-10 01:22:36,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:22:36,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:22:36,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:22:36,150 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:22:36,150 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:22:36,151 INFO L87 Difference]: Start difference. First operand has 49 states, 34 states have (on average 1.7352941176470589) internal successors, (59), 48 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:22:36,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:22:36,198 INFO L93 Difference]: Finished difference Result 80 states and 99 transitions. [2025-01-10 01:22:36,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:22:36,203 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-01-10 01:22:36,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:22:36,207 INFO L225 Difference]: With dead ends: 80 [2025-01-10 01:22:36,210 INFO L226 Difference]: Without dead ends: 33 [2025-01-10 01:22:36,212 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:22:36,214 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 24 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:22:36,218 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 62 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:22:36,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2025-01-10 01:22:36,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2025-01-10 01:22:36,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 23 states have (on average 1.565217391304348) internal successors, (36), 32 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:22:36,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2025-01-10 01:22:36,257 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 6 [2025-01-10 01:22:36,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:22:36,257 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2025-01-10 01:22:36,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:22:36,257 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2025-01-10 01:22:36,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-01-10 01:22:36,257 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:22:36,257 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:22:36,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 01:22:36,258 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-01-10 01:22:36,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:22:36,258 INFO L85 PathProgramCache]: Analyzing trace with hash 1805028999, now seen corresponding path program 1 times [2025-01-10 01:22:36,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:22:36,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333273286] [2025-01-10 01:22:36,259 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:22:36,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:22:36,272 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 01:22:36,280 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 01:22:36,280 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:22:36,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:22:36,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:22:36,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:22:36,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333273286] [2025-01-10 01:22:36,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333273286] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:22:36,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:22:36,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:22:36,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175738693] [2025-01-10 01:22:36,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:22:36,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:22:36,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:22:36,338 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:22:36,338 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:22:36,338 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:22:36,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:22:36,380 INFO L93 Difference]: Finished difference Result 59 states and 65 transitions. [2025-01-10 01:22:36,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:22:36,384 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-01-10 01:22:36,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:22:36,385 INFO L225 Difference]: With dead ends: 59 [2025-01-10 01:22:36,385 INFO L226 Difference]: Without dead ends: 57 [2025-01-10 01:22:36,385 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:22:36,386 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 23 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:22:36,386 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 53 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:22:36,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-01-10 01:22:36,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 51. [2025-01-10 01:22:36,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 41 states have (on average 1.5365853658536586) internal successors, (63), 50 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:22:36,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 63 transitions. [2025-01-10 01:22:36,397 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 63 transitions. Word has length 7 [2025-01-10 01:22:36,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:22:36,398 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 63 transitions. [2025-01-10 01:22:36,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:22:36,398 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 63 transitions. [2025-01-10 01:22:36,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-01-10 01:22:36,398 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:22:36,398 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:22:36,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 01:22:36,399 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-01-10 01:22:36,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:22:36,399 INFO L85 PathProgramCache]: Analyzing trace with hash 1806876041, now seen corresponding path program 1 times [2025-01-10 01:22:36,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:22:36,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503612930] [2025-01-10 01:22:36,399 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:22:36,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:22:36,412 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 01:22:36,420 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 01:22:36,423 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:22:36,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:22:36,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:22:36,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:22:36,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503612930] [2025-01-10 01:22:36,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503612930] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:22:36,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:22:36,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:22:36,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582868246] [2025-01-10 01:22:36,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:22:36,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:22:36,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:22:36,465 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:22:36,465 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:22:36,465 INFO L87 Difference]: Start difference. First operand 51 states and 63 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:22:36,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:22:36,490 INFO L93 Difference]: Finished difference Result 51 states and 63 transitions. [2025-01-10 01:22:36,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:22:36,490 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-01-10 01:22:36,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:22:36,491 INFO L225 Difference]: With dead ends: 51 [2025-01-10 01:22:36,494 INFO L226 Difference]: Without dead ends: 49 [2025-01-10 01:22:36,495 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:22:36,495 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 23 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:22:36,495 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 29 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:22:36,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-01-10 01:22:36,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 31. [2025-01-10 01:22:36,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 23 states have (on average 1.4782608695652173) internal successors, (34), 30 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:22:36,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2025-01-10 01:22:36,502 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 7 [2025-01-10 01:22:36,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:22:36,502 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2025-01-10 01:22:36,502 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:22:36,502 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2025-01-10 01:22:36,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-01-10 01:22:36,503 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:22:36,503 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:22:36,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 01:22:36,503 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-01-10 01:22:36,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:22:36,503 INFO L85 PathProgramCache]: Analyzing trace with hash 628418034, now seen corresponding path program 1 times [2025-01-10 01:22:36,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:22:36,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101647719] [2025-01-10 01:22:36,504 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:22:36,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:22:36,512 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 01:22:36,521 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 01:22:36,521 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:22:36,521 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:22:36,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:22:36,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:22:36,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101647719] [2025-01-10 01:22:36,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101647719] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:22:36,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:22:36,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 01:22:36,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254171468] [2025-01-10 01:22:36,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:22:36,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:22:36,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:22:36,617 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:22:36,617 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:22:36,617 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:22:36,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:22:36,650 INFO L93 Difference]: Finished difference Result 76 states and 83 transitions. [2025-01-10 01:22:36,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:22:36,650 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-01-10 01:22:36,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:22:36,654 INFO L225 Difference]: With dead ends: 76 [2025-01-10 01:22:36,654 INFO L226 Difference]: Without dead ends: 50 [2025-01-10 01:22:36,654 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:22:36,655 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 16 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:22:36,655 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 66 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:22:36,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-01-10 01:22:36,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 36. [2025-01-10 01:22:36,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 28 states have (on average 1.4285714285714286) internal successors, (40), 35 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:22:36,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2025-01-10 01:22:36,662 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 10 [2025-01-10 01:22:36,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:22:36,662 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2025-01-10 01:22:36,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:22:36,662 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2025-01-10 01:22:36,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-01-10 01:22:36,662 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:22:36,662 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:22:36,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 01:22:36,663 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-01-10 01:22:36,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:22:36,663 INFO L85 PathProgramCache]: Analyzing trace with hash 628420215, now seen corresponding path program 1 times [2025-01-10 01:22:36,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:22:36,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961900474] [2025-01-10 01:22:36,664 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:22:36,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:22:36,675 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 01:22:36,683 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 01:22:36,683 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:22:36,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:22:36,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:22:36,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:22:36,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961900474] [2025-01-10 01:22:36,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961900474] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:22:36,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:22:36,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:22:36,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633581936] [2025-01-10 01:22:36,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:22:36,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:22:36,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:22:36,705 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:22:36,705 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:22:36,705 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:22:36,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:22:36,726 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2025-01-10 01:22:36,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:22:36,727 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-01-10 01:22:36,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:22:36,727 INFO L225 Difference]: With dead ends: 36 [2025-01-10 01:22:36,727 INFO L226 Difference]: Without dead ends: 34 [2025-01-10 01:22:36,727 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:22:36,728 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 19 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:22:36,728 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 27 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:22:36,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2025-01-10 01:22:36,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2025-01-10 01:22:36,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 28 states have (on average 1.3571428571428572) internal successors, (38), 33 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:22:36,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2025-01-10 01:22:36,734 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 10 [2025-01-10 01:22:36,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:22:36,734 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2025-01-10 01:22:36,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:22:36,734 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2025-01-10 01:22:36,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-01-10 01:22:36,735 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:22:36,735 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:22:36,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 01:22:36,735 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-01-10 01:22:36,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:22:36,735 INFO L85 PathProgramCache]: Analyzing trace with hash -180928592, now seen corresponding path program 1 times [2025-01-10 01:22:36,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:22:36,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093032302] [2025-01-10 01:22:36,735 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:22:36,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:22:36,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 01:22:36,753 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 01:22:36,753 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:22:36,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:22:36,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:22:36,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:22:36,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093032302] [2025-01-10 01:22:36,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2093032302] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:22:36,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:22:36,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:22:36,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690456933] [2025-01-10 01:22:36,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:22:36,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:22:36,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:22:36,794 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:22:36,794 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:22:36,795 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:22:36,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:22:36,815 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2025-01-10 01:22:36,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:22:36,815 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-01-10 01:22:36,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:22:36,816 INFO L225 Difference]: With dead ends: 42 [2025-01-10 01:22:36,816 INFO L226 Difference]: Without dead ends: 40 [2025-01-10 01:22:36,816 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:22:36,817 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 1 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:22:36,817 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 75 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:22:36,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2025-01-10 01:22:36,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2025-01-10 01:22:36,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 39 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:22:36,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 45 transitions. [2025-01-10 01:22:36,819 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 45 transitions. Word has length 10 [2025-01-10 01:22:36,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:22:36,819 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 45 transitions. [2025-01-10 01:22:36,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:22:36,820 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 45 transitions. [2025-01-10 01:22:36,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-01-10 01:22:36,820 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:22:36,820 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:22:36,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 01:22:36,820 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-01-10 01:22:36,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:22:36,821 INFO L85 PathProgramCache]: Analyzing trace with hash -1993809741, now seen corresponding path program 1 times [2025-01-10 01:22:36,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:22:36,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037603628] [2025-01-10 01:22:36,821 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:22:36,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:22:36,825 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 01:22:36,831 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 01:22:36,831 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:22:36,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:22:36,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:22:36,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:22:36,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037603628] [2025-01-10 01:22:36,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037603628] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:22:36,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:22:36,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:22:36,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196648444] [2025-01-10 01:22:36,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:22:36,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:22:36,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:22:36,853 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:22:36,854 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:22:36,854 INFO L87 Difference]: Start difference. First operand 40 states and 45 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:22:36,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:22:36,878 INFO L93 Difference]: Finished difference Result 75 states and 82 transitions. [2025-01-10 01:22:36,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:22:36,879 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-01-10 01:22:36,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:22:36,879 INFO L225 Difference]: With dead ends: 75 [2025-01-10 01:22:36,879 INFO L226 Difference]: Without dead ends: 68 [2025-01-10 01:22:36,879 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:22:36,880 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 18 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:22:36,880 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 47 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:22:36,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2025-01-10 01:22:36,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 64. [2025-01-10 01:22:36,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 58 states have (on average 1.293103448275862) internal successors, (75), 63 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:22:36,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 75 transitions. [2025-01-10 01:22:36,884 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 75 transitions. Word has length 11 [2025-01-10 01:22:36,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:22:36,884 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 75 transitions. [2025-01-10 01:22:36,884 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:22:36,884 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 75 transitions. [2025-01-10 01:22:36,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-01-10 01:22:36,884 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:22:36,885 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:22:36,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 01:22:36,885 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-01-10 01:22:36,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:22:36,885 INFO L85 PathProgramCache]: Analyzing trace with hash 1491810929, now seen corresponding path program 1 times [2025-01-10 01:22:36,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:22:36,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800150829] [2025-01-10 01:22:36,885 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:22:36,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:22:36,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 01:22:36,894 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 01:22:36,894 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:22:36,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:22:36,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:22:36,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:22:36,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800150829] [2025-01-10 01:22:36,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800150829] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:22:36,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:22:36,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:22:36,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796099502] [2025-01-10 01:22:36,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:22:36,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:22:36,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:22:36,913 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:22:36,913 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:22:36,913 INFO L87 Difference]: Start difference. First operand 64 states and 75 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:22:36,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:22:36,923 INFO L93 Difference]: Finished difference Result 64 states and 75 transitions. [2025-01-10 01:22:36,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:22:36,924 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-01-10 01:22:36,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:22:36,924 INFO L225 Difference]: With dead ends: 64 [2025-01-10 01:22:36,924 INFO L226 Difference]: Without dead ends: 57 [2025-01-10 01:22:36,924 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:22:36,925 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 19 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:22:36,925 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 23 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:22:36,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-01-10 01:22:36,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 33. [2025-01-10 01:22:36,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 32 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:22:36,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2025-01-10 01:22:36,927 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 38 transitions. Word has length 11 [2025-01-10 01:22:36,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:22:36,927 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 38 transitions. [2025-01-10 01:22:36,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:22:36,928 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2025-01-10 01:22:36,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-01-10 01:22:36,928 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:22:36,928 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:22:36,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 01:22:36,928 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-01-10 01:22:36,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:22:36,929 INFO L85 PathProgramCache]: Analyzing trace with hash 1811786140, now seen corresponding path program 1 times [2025-01-10 01:22:36,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:22:36,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964467693] [2025-01-10 01:22:36,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:22:36,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:22:36,934 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-10 01:22:36,937 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 01:22:36,937 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:22:36,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:22:36,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:22:36,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:22:36,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964467693] [2025-01-10 01:22:36,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964467693] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:22:36,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:22:36,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 01:22:36,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508827425] [2025-01-10 01:22:36,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:22:36,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:22:36,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:22:36,963 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:22:36,963 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:22:36,964 INFO L87 Difference]: Start difference. First operand 33 states and 38 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:22:36,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:22:36,984 INFO L93 Difference]: Finished difference Result 64 states and 71 transitions. [2025-01-10 01:22:36,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:22:36,985 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-01-10 01:22:36,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:22:36,985 INFO L225 Difference]: With dead ends: 64 [2025-01-10 01:22:36,985 INFO L226 Difference]: Without dead ends: 48 [2025-01-10 01:22:36,985 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:22:36,986 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 6 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:22:36,986 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 55 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:22:36,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-01-10 01:22:36,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46. [2025-01-10 01:22:36,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 45 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:22:36,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 52 transitions. [2025-01-10 01:22:36,989 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 52 transitions. Word has length 14 [2025-01-10 01:22:36,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:22:36,989 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 52 transitions. [2025-01-10 01:22:36,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:22:36,990 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 52 transitions. [2025-01-10 01:22:36,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-01-10 01:22:36,990 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:22:36,990 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:22:36,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-10 01:22:36,990 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-01-10 01:22:36,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:22:36,991 INFO L85 PathProgramCache]: Analyzing trace with hash -1782116578, now seen corresponding path program 1 times [2025-01-10 01:22:36,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:22:36,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178226946] [2025-01-10 01:22:36,991 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:22:36,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:22:36,999 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-10 01:22:37,001 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 01:22:37,001 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:22:37,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:22:37,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:22:37,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:22:37,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178226946] [2025-01-10 01:22:37,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178226946] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:22:37,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:22:37,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:22:37,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631087366] [2025-01-10 01:22:37,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:22:37,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:22:37,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:22:37,025 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:22:37,025 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:22:37,025 INFO L87 Difference]: Start difference. First operand 46 states and 52 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:22:37,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:22:37,045 INFO L93 Difference]: Finished difference Result 54 states and 60 transitions. [2025-01-10 01:22:37,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:22:37,045 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-01-10 01:22:37,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:22:37,046 INFO L225 Difference]: With dead ends: 54 [2025-01-10 01:22:37,046 INFO L226 Difference]: Without dead ends: 52 [2025-01-10 01:22:37,046 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:22:37,046 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 1 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:22:37,047 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 58 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:22:37,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2025-01-10 01:22:37,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2025-01-10 01:22:37,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 48 states have (on average 1.2083333333333333) internal successors, (58), 51 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:22:37,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 58 transitions. [2025-01-10 01:22:37,051 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 58 transitions. Word has length 14 [2025-01-10 01:22:37,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:22:37,051 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 58 transitions. [2025-01-10 01:22:37,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:22:37,051 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 58 transitions. [2025-01-10 01:22:37,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-01-10 01:22:37,052 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:22:37,052 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:22:37,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-10 01:22:37,052 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-01-10 01:22:37,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:22:37,052 INFO L85 PathProgramCache]: Analyzing trace with hash 1697585960, now seen corresponding path program 1 times [2025-01-10 01:22:37,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:22:37,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560214207] [2025-01-10 01:22:37,053 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:22:37,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:22:37,061 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-10 01:22:37,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-10 01:22:37,065 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:22:37,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:22:37,140 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:22:37,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:22:37,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560214207] [2025-01-10 01:22:37,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560214207] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:22:37,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [492615393] [2025-01-10 01:22:37,140 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:22:37,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:22:37,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:22:37,144 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:22:37,145 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-10 01:22:37,214 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-10 01:22:37,227 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-10 01:22:37,228 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:22:37,228 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:22:37,233 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 01:22:37,237 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:22:37,283 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:22:37,284 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 01:22:37,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [492615393] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:22:37,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 01:22:37,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-01-10 01:22:37,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562065078] [2025-01-10 01:22:37,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:22:37,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 01:22:37,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:22:37,285 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 01:22:37,285 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-01-10 01:22:37,285 INFO L87 Difference]: Start difference. First operand 52 states and 58 transitions. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:22:37,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:22:37,319 INFO L93 Difference]: Finished difference Result 52 states and 58 transitions. [2025-01-10 01:22:37,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 01:22:37,319 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-01-10 01:22:37,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:22:37,319 INFO L225 Difference]: With dead ends: 52 [2025-01-10 01:22:37,320 INFO L226 Difference]: Without dead ends: 51 [2025-01-10 01:22:37,320 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-01-10 01:22:37,320 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 1 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:22:37,321 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 67 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:22:37,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-01-10 01:22:37,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2025-01-10 01:22:37,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 48 states have (on average 1.1666666666666667) internal successors, (56), 50 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:22:37,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 56 transitions. [2025-01-10 01:22:37,331 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 56 transitions. Word has length 16 [2025-01-10 01:22:37,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:22:37,331 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 56 transitions. [2025-01-10 01:22:37,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:22:37,331 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2025-01-10 01:22:37,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-01-10 01:22:37,332 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:22:37,332 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:22:37,342 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-10 01:22:37,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-01-10 01:22:37,538 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-01-10 01:22:37,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:22:37,539 INFO L85 PathProgramCache]: Analyzing trace with hash 1085557271, now seen corresponding path program 1 times [2025-01-10 01:22:37,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:22:37,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575943356] [2025-01-10 01:22:37,539 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:22:37,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:22:37,544 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-10 01:22:37,547 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 01:22:37,548 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:22:37,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:22:37,603 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:22:37,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:22:37,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575943356] [2025-01-10 01:22:37,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575943356] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:22:37,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1352662998] [2025-01-10 01:22:37,607 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:22:37,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:22:37,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:22:37,608 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:22:37,609 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-10 01:22:37,653 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-10 01:22:37,661 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 01:22:37,661 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:22:37,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:22:37,662 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 01:22:37,662 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:22:37,691 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:22:37,691 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:22:37,732 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:22:37,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1352662998] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:22:37,733 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:22:37,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-01-10 01:22:37,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044402332] [2025-01-10 01:22:37,733 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:22:37,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-10 01:22:37,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:22:37,734 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-10 01:22:37,734 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-01-10 01:22:37,734 INFO L87 Difference]: Start difference. First operand 51 states and 56 transitions. Second operand has 12 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 12 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:22:37,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:22:37,772 INFO L93 Difference]: Finished difference Result 88 states and 101 transitions. [2025-01-10 01:22:37,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 01:22:37,772 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 12 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-01-10 01:22:37,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:22:37,773 INFO L225 Difference]: With dead ends: 88 [2025-01-10 01:22:37,774 INFO L226 Difference]: Without dead ends: 87 [2025-01-10 01:22:37,774 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-01-10 01:22:37,774 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 0 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:22:37,774 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 86 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:22:37,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2025-01-10 01:22:37,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2025-01-10 01:22:37,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 84 states have (on average 1.130952380952381) internal successors, (95), 86 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:22:37,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 95 transitions. [2025-01-10 01:22:37,780 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 95 transitions. Word has length 17 [2025-01-10 01:22:37,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:22:37,780 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 95 transitions. [2025-01-10 01:22:37,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 12 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:22:37,780 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 95 transitions. [2025-01-10 01:22:37,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-01-10 01:22:37,781 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:22:37,781 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:22:37,786 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-10 01:22:37,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:22:37,985 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-01-10 01:22:37,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:22:37,985 INFO L85 PathProgramCache]: Analyzing trace with hash 706746454, now seen corresponding path program 1 times [2025-01-10 01:22:37,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:22:37,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034458555] [2025-01-10 01:22:37,986 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:22:37,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:22:38,003 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-10 01:22:38,012 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-10 01:22:38,012 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:22:38,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:22:38,137 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:22:38,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:22:38,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034458555] [2025-01-10 01:22:38,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034458555] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:22:38,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1033167499] [2025-01-10 01:22:38,137 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:22:38,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:22:38,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:22:38,139 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:22:38,141 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-10 01:22:38,174 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-10 01:22:38,182 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-10 01:22:38,182 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:22:38,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:22:38,183 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 01:22:38,183 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:22:38,214 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:22:38,214 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 01:22:38,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1033167499] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:22:38,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 01:22:38,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-01-10 01:22:38,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142060201] [2025-01-10 01:22:38,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:22:38,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 01:22:38,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:22:38,216 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 01:22:38,216 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-01-10 01:22:38,216 INFO L87 Difference]: Start difference. First operand 87 states and 95 transitions. Second operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:22:38,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:22:38,238 INFO L93 Difference]: Finished difference Result 87 states and 95 transitions. [2025-01-10 01:22:38,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 01:22:38,238 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-01-10 01:22:38,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:22:38,239 INFO L225 Difference]: With dead ends: 87 [2025-01-10 01:22:38,239 INFO L226 Difference]: Without dead ends: 86 [2025-01-10 01:22:38,239 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-01-10 01:22:38,239 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 1 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:22:38,240 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 74 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:22:38,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2025-01-10 01:22:38,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2025-01-10 01:22:38,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 84 states have (on average 1.119047619047619) internal successors, (94), 85 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:22:38,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 94 transitions. [2025-01-10 01:22:38,244 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 94 transitions. Word has length 20 [2025-01-10 01:22:38,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:22:38,244 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 94 transitions. [2025-01-10 01:22:38,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:22:38,245 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 94 transitions. [2025-01-10 01:22:38,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-01-10 01:22:38,245 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:22:38,245 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:22:38,251 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 01:22:38,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:22:38,446 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-01-10 01:22:38,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:22:38,446 INFO L85 PathProgramCache]: Analyzing trace with hash 434303679, now seen corresponding path program 1 times [2025-01-10 01:22:38,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:22:38,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076116215] [2025-01-10 01:22:38,447 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:22:38,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:22:38,452 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-10 01:22:38,455 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-10 01:22:38,455 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:22:38,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:22:38,510 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:22:38,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:22:38,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076116215] [2025-01-10 01:22:38,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076116215] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:22:38,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1670303443] [2025-01-10 01:22:38,511 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:22:38,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:22:38,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:22:38,513 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:22:38,514 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-10 01:22:38,555 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-10 01:22:38,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-10 01:22:38,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:22:38,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:22:38,567 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 01:22:38,568 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:22:38,602 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:22:38,602 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:22:38,648 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:22:38,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1670303443] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:22:38,650 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:22:38,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-01-10 01:22:38,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457665140] [2025-01-10 01:22:38,650 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:22:38,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-10 01:22:38,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:22:38,651 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-10 01:22:38,651 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-01-10 01:22:38,651 INFO L87 Difference]: Start difference. First operand 86 states and 94 transitions. Second operand has 12 states, 11 states have (on average 3.727272727272727) internal successors, (41), 12 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:22:38,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:22:38,687 INFO L93 Difference]: Finished difference Result 105 states and 115 transitions. [2025-01-10 01:22:38,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 01:22:38,687 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.727272727272727) internal successors, (41), 12 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-01-10 01:22:38,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:22:38,688 INFO L225 Difference]: With dead ends: 105 [2025-01-10 01:22:38,688 INFO L226 Difference]: Without dead ends: 104 [2025-01-10 01:22:38,688 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-01-10 01:22:38,688 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 0 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:22:38,689 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 91 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:22:38,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2025-01-10 01:22:38,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2025-01-10 01:22:38,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 102 states have (on average 1.0980392156862746) internal successors, (112), 103 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:22:38,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 112 transitions. [2025-01-10 01:22:38,701 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 112 transitions. Word has length 21 [2025-01-10 01:22:38,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:22:38,701 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 112 transitions. [2025-01-10 01:22:38,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.727272727272727) internal successors, (41), 12 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:22:38,701 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 112 transitions. [2025-01-10 01:22:38,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-01-10 01:22:38,701 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:22:38,701 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1] [2025-01-10 01:22:38,710 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-10 01:22:38,902 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,SelfDestructingSolverStorable13 [2025-01-10 01:22:38,902 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-01-10 01:22:38,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:22:38,903 INFO L85 PathProgramCache]: Analyzing trace with hash -1315938129, now seen corresponding path program 2 times [2025-01-10 01:22:38,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:22:38,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980550809] [2025-01-10 01:22:38,903 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:22:38,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:22:38,914 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 35 statements into 2 equivalence classes. [2025-01-10 01:22:38,918 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 11 of 35 statements. [2025-01-10 01:22:38,920 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 01:22:38,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:22:38,951 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-01-10 01:22:38,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:22:38,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980550809] [2025-01-10 01:22:38,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980550809] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:22:38,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1264712008] [2025-01-10 01:22:38,951 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:22:38,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:22:38,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:22:38,954 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:22:38,961 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-10 01:22:39,003 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 35 statements into 2 equivalence classes. [2025-01-10 01:22:39,010 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 11 of 35 statements. [2025-01-10 01:22:39,010 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 01:22:39,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:22:39,011 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 01:22:39,011 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:22:39,057 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-01-10 01:22:39,057 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:22:39,110 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-01-10 01:22:39,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1264712008] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:22:39,111 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:22:39,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-01-10 01:22:39,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693572860] [2025-01-10 01:22:39,111 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:22:39,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-10 01:22:39,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:22:39,112 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-10 01:22:39,112 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-01-10 01:22:39,113 INFO L87 Difference]: Start difference. First operand 104 states and 112 transitions. Second operand has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:22:39,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:22:39,153 INFO L93 Difference]: Finished difference Result 104 states and 112 transitions. [2025-01-10 01:22:39,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 01:22:39,154 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2025-01-10 01:22:39,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:22:39,154 INFO L225 Difference]: With dead ends: 104 [2025-01-10 01:22:39,154 INFO L226 Difference]: Without dead ends: 72 [2025-01-10 01:22:39,156 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2025-01-10 01:22:39,156 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 28 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:22:39,156 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 34 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:22:39,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2025-01-10 01:22:39,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 48. [2025-01-10 01:22:39,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 47 states have (on average 1.0638297872340425) internal successors, (50), 47 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:22:39,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 50 transitions. [2025-01-10 01:22:39,164 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 50 transitions. Word has length 35 [2025-01-10 01:22:39,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:22:39,164 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 50 transitions. [2025-01-10 01:22:39,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:22:39,164 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 50 transitions. [2025-01-10 01:22:39,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-01-10 01:22:39,164 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:22:39,164 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:22:39,174 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-01-10 01:22:39,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-01-10 01:22:39,365 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-01-10 01:22:39,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:22:39,366 INFO L85 PathProgramCache]: Analyzing trace with hash 1259898903, now seen corresponding path program 2 times [2025-01-10 01:22:39,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:22:39,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71911650] [2025-01-10 01:22:39,366 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:22:39,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:22:39,383 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 39 statements into 2 equivalence classes. [2025-01-10 01:22:39,390 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 15 of 39 statements. [2025-01-10 01:22:39,390 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 01:22:39,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:22:39,442 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-01-10 01:22:39,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:22:39,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71911650] [2025-01-10 01:22:39,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71911650] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:22:39,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2046044985] [2025-01-10 01:22:39,442 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:22:39,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:22:39,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:22:39,445 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:22:39,446 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-10 01:22:39,497 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 39 statements into 2 equivalence classes. [2025-01-10 01:22:39,503 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 15 of 39 statements. [2025-01-10 01:22:39,503 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 01:22:39,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:22:39,503 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 01:22:39,504 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:22:39,546 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-01-10 01:22:39,546 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:22:39,606 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-01-10 01:22:39,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2046044985] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:22:39,606 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:22:39,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-01-10 01:22:39,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073527010] [2025-01-10 01:22:39,607 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:22:39,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-10 01:22:39,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:22:39,607 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-10 01:22:39,607 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-01-10 01:22:39,607 INFO L87 Difference]: Start difference. First operand 48 states and 50 transitions. Second operand has 8 states, 7 states have (on average 5.285714285714286) internal successors, (37), 8 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:22:39,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:22:39,642 INFO L93 Difference]: Finished difference Result 48 states and 50 transitions. [2025-01-10 01:22:39,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 01:22:39,642 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.285714285714286) internal successors, (37), 8 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2025-01-10 01:22:39,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:22:39,642 INFO L225 Difference]: With dead ends: 48 [2025-01-10 01:22:39,643 INFO L226 Difference]: Without dead ends: 0 [2025-01-10 01:22:39,643 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2025-01-10 01:22:39,643 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 9 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:22:39,643 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 45 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:22:39,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-01-10 01:22:39,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-01-10 01:22:39,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:22:39,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-01-10 01:22:39,644 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 39 [2025-01-10 01:22:39,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:22:39,644 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-10 01:22:39,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.285714285714286) internal successors, (37), 8 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:22:39,644 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-01-10 01:22:39,644 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-01-10 01:22:39,646 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 14 remaining) [2025-01-10 01:22:39,647 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 14 remaining) [2025-01-10 01:22:39,647 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 14 remaining) [2025-01-10 01:22:39,647 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 14 remaining) [2025-01-10 01:22:39,647 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 14 remaining) [2025-01-10 01:22:39,647 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 14 remaining) [2025-01-10 01:22:39,647 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 14 remaining) [2025-01-10 01:22:39,647 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 14 remaining) [2025-01-10 01:22:39,647 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 14 remaining) [2025-01-10 01:22:39,647 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 14 remaining) [2025-01-10 01:22:39,647 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 14 remaining) [2025-01-10 01:22:39,647 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 14 remaining) [2025-01-10 01:22:39,647 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 14 remaining) [2025-01-10 01:22:39,647 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 14 remaining) [2025-01-10 01:22:39,653 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-01-10 01:22:39,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-01-10 01:22:39,854 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:22:39,855 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-01-10 01:22:40,119 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-10 01:22:40,132 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 01:22:40 BoogieIcfgContainer [2025-01-10 01:22:40,132 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-10 01:22:40,133 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-10 01:22:40,133 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-10 01:22:40,133 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-10 01:22:40,133 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:22:35" (3/4) ... [2025-01-10 01:22:40,137 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-10 01:22:40,145 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2025-01-10 01:22:40,146 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-01-10 01:22:40,146 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-01-10 01:22:40,146 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-10 01:22:40,211 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-10 01:22:40,211 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-10 01:22:40,211 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-10 01:22:40,213 INFO L158 Benchmark]: Toolchain (without parser) took 5455.22ms. Allocated memory is still 142.6MB. Free memory was 110.4MB in the beginning and 70.8MB in the end (delta: 39.6MB). Peak memory consumption was 43.2MB. Max. memory is 16.1GB. [2025-01-10 01:22:40,213 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 124.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 01:22:40,213 INFO L158 Benchmark]: CACSL2BoogieTranslator took 317.42ms. Allocated memory is still 142.6MB. Free memory was 110.4MB in the beginning and 93.5MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-10 01:22:40,213 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.78ms. Allocated memory is still 142.6MB. Free memory was 93.5MB in the beginning and 91.6MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 01:22:40,214 INFO L158 Benchmark]: Boogie Preprocessor took 38.00ms. Allocated memory is still 142.6MB. Free memory was 91.6MB in the beginning and 90.0MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 01:22:40,214 INFO L158 Benchmark]: RCFGBuilder took 503.79ms. Allocated memory is still 142.6MB. Free memory was 89.6MB in the beginning and 74.6MB in the end (delta: 15.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 01:22:40,214 INFO L158 Benchmark]: TraceAbstraction took 4478.45ms. Allocated memory is still 142.6MB. Free memory was 74.2MB in the beginning and 77.8MB in the end (delta: -3.7MB). Peak memory consumption was 44.0MB. Max. memory is 16.1GB. [2025-01-10 01:22:40,214 INFO L158 Benchmark]: Witness Printer took 78.63ms. Allocated memory is still 142.6MB. Free memory was 76.6MB in the beginning and 70.8MB in the end (delta: 5.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 01:22:40,217 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.19ms. Allocated memory is still 201.3MB. Free memory is still 124.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 317.42ms. Allocated memory is still 142.6MB. Free memory was 110.4MB in the beginning and 93.5MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.78ms. Allocated memory is still 142.6MB. Free memory was 93.5MB in the beginning and 91.6MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 38.00ms. Allocated memory is still 142.6MB. Free memory was 91.6MB in the beginning and 90.0MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 503.79ms. Allocated memory is still 142.6MB. Free memory was 89.6MB in the beginning and 74.6MB in the end (delta: 15.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 4478.45ms. Allocated memory is still 142.6MB. Free memory was 74.2MB in the beginning and 77.8MB in the end (delta: -3.7MB). Peak memory consumption was 44.0MB. Max. memory is 16.1GB. * Witness Printer took 78.63ms. Allocated memory is still 142.6MB. Free memory was 76.6MB in the beginning and 70.8MB in the end (delta: 5.8MB). 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: 538]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 538]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 538]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 538]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 543]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 543]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 543]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 543]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 548]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 548]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 549]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 549]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 520]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 520]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 49 locations, 14 error locations. Started 1 CEGAR loops. OverallTime: 4.1s, OverallIterations: 16, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 189 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 189 mSDsluCounter, 892 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 523 mSDsCounter, 21 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 356 IncrementalHoareTripleChecker+Invalid, 377 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 21 mSolverCounterUnsat, 369 mSDtfsCounter, 356 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 312 GetRequests, 248 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=104occurred in iteration=14, InterpolantAutomatonStates: 78, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 16 MinimizatonAttempts, 92 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 396 NumberOfCodeBlocks, 300 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 482 ConstructedInterpolants, 0 QuantifiedInterpolants, 1272 SizeOfPredicates, 4 NumberOfNonLiveVariables, 421 ConjunctsInSsa, 28 ConjunctsInUnsatCore, 26 InterpolantComputations, 12 PerfectInterpolantSequences, 298/416 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 14 specifications checked. All of them hold - InvariantResult [Line: 543]: Loop Invariant Derived loop invariant: ((((((i == 0) && (1 <= length1)) && (1 <= length2)) && (length1 <= 2147483647)) && (length2 <= 2147483647)) || ((((((1 <= length1) && (i <= 2147483646)) && (1 <= length2)) && (length1 <= 2147483647)) && (1 <= i)) && (length2 <= 2147483647))) - InvariantResult [Line: 538]: Loop Invariant Derived loop invariant: ((((((i == 0) && (1 <= length1)) && (1 <= length2)) && (length1 <= 2147483647)) || (((((1 <= i) && (i <= 2147483646)) && (1 <= length1)) && (1 <= length2)) && (length1 <= 2147483647))) && (length2 <= 2147483647)) RESULT: Ultimate proved your program to be correct! [2025-01-10 01:22:40,231 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