./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fscanf_postinc_11_good.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fscanf_postinc_11_good.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 25fb650f45ac4e358b667cb3fd05850de4873e7b24b78ed03fc2d320c85ee2f5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 12:44:55,285 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 12:44:55,330 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-03-04 12:44:55,334 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 12:44:55,334 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 12:44:55,351 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 12:44:55,352 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 12:44:55,352 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 12:44:55,352 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 12:44:55,353 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 12:44:55,353 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 12:44:55,353 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 12:44:55,353 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 12:44:55,353 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 12:44:55,353 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 12:44:55,353 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 12:44:55,353 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 12:44:55,353 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 12:44:55,354 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 12:44:55,354 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 12:44:55,354 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 12:44:55,354 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 12:44:55,354 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 12:44:55,354 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 12:44:55,354 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 12:44:55,354 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 12:44:55,354 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 12:44:55,354 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 12:44:55,354 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 12:44:55,354 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 12:44:55,355 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 12:44:55,355 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 12:44:55,355 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 12:44:55,355 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 12:44:55,355 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 12:44:55,355 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 12:44:55,355 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 12:44:55,355 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 12:44:55,355 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 12:44:55,355 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 12:44:55,355 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 12:44:55,355 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 12:44:55,355 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/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 25fb650f45ac4e358b667cb3fd05850de4873e7b24b78ed03fc2d320c85ee2f5 [2025-03-04 12:44:55,546 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 12:44:55,554 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 12:44:55,557 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 12:44:55,559 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 12:44:55,560 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 12:44:55,560 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fscanf_postinc_11_good.i [2025-03-04 12:44:56,737 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/189f709dd/886bf0fed7de4cc5bcf74a946df0caa9/FLAG2c6ff3d23 [2025-03-04 12:44:57,083 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 12:44:57,084 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fscanf_postinc_11_good.i [2025-03-04 12:44:57,103 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/189f709dd/886bf0fed7de4cc5bcf74a946df0caa9/FLAG2c6ff3d23 [2025-03-04 12:44:57,296 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/189f709dd/886bf0fed7de4cc5bcf74a946df0caa9 [2025-03-04 12:44:57,298 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 12:44:57,298 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 12:44:57,299 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 12:44:57,299 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 12:44:57,302 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 12:44:57,303 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:44:57" (1/1) ... [2025-03-04 12:44:57,303 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@400d5c88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:44:57, skipping insertion in model container [2025-03-04 12:44:57,303 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:44:57" (1/1) ... [2025-03-04 12:44:57,339 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 12:44:57,795 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 12:44:57,801 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 12:44:57,905 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 12:44:57,997 INFO L204 MainTranslator]: Completed translation [2025-03-04 12:44:57,998 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:44:57 WrapperNode [2025-03-04 12:44:57,998 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 12:44:57,999 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 12:44:57,999 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 12:44:58,000 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 12:44:58,004 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:44:57" (1/1) ... [2025-03-04 12:44:58,016 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:44:57" (1/1) ... [2025-03-04 12:44:58,036 INFO L138 Inliner]: procedures = 501, calls = 46, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 129 [2025-03-04 12:44:58,037 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 12:44:58,038 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 12:44:58,038 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 12:44:58,038 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 12:44:58,043 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:44:57" (1/1) ... [2025-03-04 12:44:58,044 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:44:57" (1/1) ... [2025-03-04 12:44:58,046 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:44:57" (1/1) ... [2025-03-04 12:44:58,051 INFO L175 MemorySlicer]: No memory access in input program. [2025-03-04 12:44:58,052 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:44:57" (1/1) ... [2025-03-04 12:44:58,052 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:44:57" (1/1) ... [2025-03-04 12:44:58,056 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:44:57" (1/1) ... [2025-03-04 12:44:58,057 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:44:57" (1/1) ... [2025-03-04 12:44:58,058 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:44:57" (1/1) ... [2025-03-04 12:44:58,059 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:44:57" (1/1) ... [2025-03-04 12:44:58,060 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 12:44:58,061 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 12:44:58,061 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 12:44:58,061 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 12:44:58,062 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:44:57" (1/1) ... [2025-03-04 12:44:58,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 12:44:58,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 12:44:58,091 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 12:44:58,104 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 12:44:58,120 INFO L130 BoogieDeclarations]: Found specification of procedure printIntLine [2025-03-04 12:44:58,121 INFO L138 BoogieDeclarations]: Found implementation of procedure printIntLine [2025-03-04 12:44:58,121 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2025-03-04 12:44:58,121 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2025-03-04 12:44:58,121 INFO L130 BoogieDeclarations]: Found specification of procedure globalReturnsTrue [2025-03-04 12:44:58,121 INFO L138 BoogieDeclarations]: Found implementation of procedure globalReturnsTrue [2025-03-04 12:44:58,121 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 12:44:58,121 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 12:44:58,121 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 12:44:58,121 INFO L130 BoogieDeclarations]: Found specification of procedure globalReturnsFalse [2025-03-04 12:44:58,121 INFO L138 BoogieDeclarations]: Found implementation of procedure globalReturnsFalse [2025-03-04 12:44:58,238 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 12:44:58,239 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 12:44:58,430 INFO L? ?]: Removed 32 outVars from TransFormulas that were not future-live. [2025-03-04 12:44:58,430 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 12:44:58,438 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 12:44:58,439 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 12:44:58,439 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:44:58 BoogieIcfgContainer [2025-03-04 12:44:58,440 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 12:44:58,443 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 12:44:58,444 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 12:44:58,448 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 12:44:58,448 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 12:44:57" (1/3) ... [2025-03-04 12:44:58,448 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ef06ec0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:44:58, skipping insertion in model container [2025-03-04 12:44:58,448 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:44:57" (2/3) ... [2025-03-04 12:44:58,448 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ef06ec0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:44:58, skipping insertion in model container [2025-03-04 12:44:58,448 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:44:58" (3/3) ... [2025-03-04 12:44:58,449 INFO L128 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_fscanf_postinc_11_good.i [2025-03-04 12:44:58,465 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 12:44:58,466 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG CWE190_Integer_Overflow__int_fscanf_postinc_11_good.i that has 5 procedures, 81 locations, 1 initial locations, 0 loop locations, and 8 error locations. [2025-03-04 12:44:58,521 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 12:44:58,533 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;@35ef7381, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 12:44:58,533 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-03-04 12:44:58,537 INFO L276 IsEmpty]: Start isEmpty. Operand has 81 states, 50 states have (on average 1.38) internal successors, (69), 62 states have internal predecessors, (69), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-04 12:44:58,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-04 12:44:58,542 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 12:44:58,542 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 12:44:58,543 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 12:44:58,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 12:44:58,547 INFO L85 PathProgramCache]: Analyzing trace with hash 15521373, now seen corresponding path program 1 times [2025-03-04 12:44:58,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 12:44:58,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928875858] [2025-03-04 12:44:58,554 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 12:44:58,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 12:44:58,631 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 12:44:58,647 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 12:44:58,648 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 12:44:58,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 12:44:58,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 12:44:58,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 12:44:58,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928875858] [2025-03-04 12:44:58,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928875858] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 12:44:58,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 12:44:58,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 12:44:58,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237366516] [2025-03-04 12:44:58,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 12:44:58,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 12:44:58,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 12:44:58,856 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 12:44:58,857 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 12:44:58,859 INFO L87 Difference]: Start difference. First operand has 81 states, 50 states have (on average 1.38) internal successors, (69), 62 states have internal predecessors, (69), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 12:44:58,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 12:44:58,904 INFO L93 Difference]: Finished difference Result 82 states and 106 transitions. [2025-03-04 12:44:58,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 12:44:58,907 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2025-03-04 12:44:58,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 12:44:58,911 INFO L225 Difference]: With dead ends: 82 [2025-03-04 12:44:58,911 INFO L226 Difference]: Without dead ends: 72 [2025-03-04 12:44:58,914 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-03-04 12:44:58,916 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 4 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 285 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-03-04 12:44:58,917 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 285 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 12:44:58,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2025-03-04 12:44:58,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 71. [2025-03-04 12:44:58,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 44 states have (on average 1.3636363636363635) internal successors, (60), 54 states have internal predecessors, (60), 16 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-04 12:44:58,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 92 transitions. [2025-03-04 12:44:58,956 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 92 transitions. Word has length 22 [2025-03-04 12:44:58,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 12:44:58,957 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 92 transitions. [2025-03-04 12:44:58,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 12:44:58,958 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 92 transitions. [2025-03-04 12:44:58,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-04 12:44:58,958 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 12:44:58,959 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 12:44:58,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 12:44:58,959 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 12:44:58,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 12:44:58,959 INFO L85 PathProgramCache]: Analyzing trace with hash 481162600, now seen corresponding path program 1 times [2025-03-04 12:44:58,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 12:44:58,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926958866] [2025-03-04 12:44:58,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 12:44:58,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 12:44:58,979 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-04 12:44:58,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 12:44:58,992 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 12:44:58,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 12:44:59,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 12:44:59,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 12:44:59,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926958866] [2025-03-04 12:44:59,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926958866] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 12:44:59,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 12:44:59,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 12:44:59,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092828087] [2025-03-04 12:44:59,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 12:44:59,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 12:44:59,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 12:44:59,052 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 12:44:59,052 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 12:44:59,052 INFO L87 Difference]: Start difference. First operand 71 states and 92 transitions. Second operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 12:44:59,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 12:44:59,067 INFO L93 Difference]: Finished difference Result 71 states and 92 transitions. [2025-03-04 12:44:59,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 12:44:59,067 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 23 [2025-03-04 12:44:59,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 12:44:59,069 INFO L225 Difference]: With dead ends: 71 [2025-03-04 12:44:59,070 INFO L226 Difference]: Without dead ends: 70 [2025-03-04 12:44:59,071 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-03-04 12:44:59,072 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 0 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 12:44:59,072 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 175 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 12:44:59,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2025-03-04 12:44:59,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2025-03-04 12:44:59,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 44 states have (on average 1.3409090909090908) internal successors, (59), 53 states have internal predecessors, (59), 16 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-04 12:44:59,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 91 transitions. [2025-03-04 12:44:59,087 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 91 transitions. Word has length 23 [2025-03-04 12:44:59,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 12:44:59,087 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 91 transitions. [2025-03-04 12:44:59,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 12:44:59,087 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 91 transitions. [2025-03-04 12:44:59,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-04 12:44:59,088 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 12:44:59,088 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 12:44:59,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 12:44:59,088 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 12:44:59,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 12:44:59,089 INFO L85 PathProgramCache]: Analyzing trace with hash -399191791, now seen corresponding path program 1 times [2025-03-04 12:44:59,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 12:44:59,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203357525] [2025-03-04 12:44:59,089 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 12:44:59,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 12:44:59,108 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-04 12:44:59,113 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-04 12:44:59,115 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 12:44:59,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 12:44:59,195 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-04 12:44:59,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 12:44:59,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203357525] [2025-03-04 12:44:59,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203357525] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 12:44:59,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 12:44:59,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 12:44:59,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72777824] [2025-03-04 12:44:59,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 12:44:59,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 12:44:59,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 12:44:59,197 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 12:44:59,198 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 12:44:59,199 INFO L87 Difference]: Start difference. First operand 70 states and 91 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-04 12:44:59,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 12:44:59,223 INFO L93 Difference]: Finished difference Result 123 states and 156 transitions. [2025-03-04 12:44:59,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 12:44:59,223 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 40 [2025-03-04 12:44:59,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 12:44:59,224 INFO L225 Difference]: With dead ends: 123 [2025-03-04 12:44:59,225 INFO L226 Difference]: Without dead ends: 69 [2025-03-04 12:44:59,226 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 12:44:59,226 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 0 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 12:44:59,227 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 253 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 12:44:59,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2025-03-04 12:44:59,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2025-03-04 12:44:59,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 44 states have (on average 1.3181818181818181) internal successors, (58), 52 states have internal predecessors, (58), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-04 12:44:59,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 88 transitions. [2025-03-04 12:44:59,251 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 88 transitions. Word has length 40 [2025-03-04 12:44:59,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 12:44:59,251 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 88 transitions. [2025-03-04 12:44:59,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-04 12:44:59,251 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 88 transitions. [2025-03-04 12:44:59,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-04 12:44:59,252 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 12:44:59,252 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 12:44:59,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 12:44:59,252 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 12:44:59,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 12:44:59,253 INFO L85 PathProgramCache]: Analyzing trace with hash -1804523872, now seen corresponding path program 1 times [2025-03-04 12:44:59,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 12:44:59,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021530742] [2025-03-04 12:44:59,253 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 12:44:59,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 12:44:59,260 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-04 12:44:59,268 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-04 12:44:59,268 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 12:44:59,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 12:44:59,338 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-04 12:44:59,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 12:44:59,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021530742] [2025-03-04 12:44:59,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021530742] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 12:44:59,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 12:44:59,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 12:44:59,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507228867] [2025-03-04 12:44:59,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 12:44:59,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 12:44:59,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 12:44:59,340 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 12:44:59,340 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 12:44:59,340 INFO L87 Difference]: Start difference. First operand 69 states and 88 transitions. Second operand has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-04 12:44:59,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 12:44:59,363 INFO L93 Difference]: Finished difference Result 70 states and 89 transitions. [2025-03-04 12:44:59,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 12:44:59,365 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 41 [2025-03-04 12:44:59,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 12:44:59,366 INFO L225 Difference]: With dead ends: 70 [2025-03-04 12:44:59,366 INFO L226 Difference]: Without dead ends: 69 [2025-03-04 12:44:59,366 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-03-04 12:44:59,367 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 4 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 234 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-03-04 12:44:59,367 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 234 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 12:44:59,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2025-03-04 12:44:59,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2025-03-04 12:44:59,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 44 states have (on average 1.2954545454545454) internal successors, (57), 51 states have internal predecessors, (57), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-04 12:44:59,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 87 transitions. [2025-03-04 12:44:59,374 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 87 transitions. Word has length 41 [2025-03-04 12:44:59,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 12:44:59,374 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 87 transitions. [2025-03-04 12:44:59,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-04 12:44:59,374 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 87 transitions. [2025-03-04 12:44:59,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-04 12:44:59,375 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 12:44:59,375 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 12:44:59,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 12:44:59,375 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 12:44:59,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 12:44:59,377 INFO L85 PathProgramCache]: Analyzing trace with hash -105665167, now seen corresponding path program 1 times [2025-03-04 12:44:59,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 12:44:59,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162249474] [2025-03-04 12:44:59,379 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 12:44:59,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 12:44:59,391 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-04 12:44:59,395 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-04 12:44:59,396 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 12:44:59,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 12:44:59,435 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-04 12:44:59,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 12:44:59,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162249474] [2025-03-04 12:44:59,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162249474] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 12:44:59,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 12:44:59,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 12:44:59,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243295291] [2025-03-04 12:44:59,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 12:44:59,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 12:44:59,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 12:44:59,437 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 12:44:59,437 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 12:44:59,437 INFO L87 Difference]: Start difference. First operand 68 states and 87 transitions. Second operand has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-04 12:44:59,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 12:44:59,453 INFO L93 Difference]: Finished difference Result 68 states and 87 transitions. [2025-03-04 12:44:59,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 12:44:59,454 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 42 [2025-03-04 12:44:59,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 12:44:59,455 INFO L225 Difference]: With dead ends: 68 [2025-03-04 12:44:59,455 INFO L226 Difference]: Without dead ends: 67 [2025-03-04 12:44:59,455 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-03-04 12:44:59,455 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 0 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 12:44:59,455 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 165 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 12:44:59,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2025-03-04 12:44:59,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2025-03-04 12:44:59,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 44 states have (on average 1.2727272727272727) internal successors, (56), 50 states have internal predecessors, (56), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-04 12:44:59,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 86 transitions. [2025-03-04 12:44:59,460 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 86 transitions. Word has length 42 [2025-03-04 12:44:59,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 12:44:59,460 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 86 transitions. [2025-03-04 12:44:59,460 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-04 12:44:59,460 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 86 transitions. [2025-03-04 12:44:59,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-04 12:44:59,461 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 12:44:59,461 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 12:44:59,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 12:44:59,461 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 12:44:59,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 12:44:59,461 INFO L85 PathProgramCache]: Analyzing trace with hash -1239126661, now seen corresponding path program 1 times [2025-03-04 12:44:59,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 12:44:59,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659489845] [2025-03-04 12:44:59,461 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 12:44:59,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 12:44:59,469 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-04 12:44:59,477 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-04 12:44:59,477 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 12:44:59,477 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 12:44:59,529 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-04 12:44:59,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 12:44:59,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659489845] [2025-03-04 12:44:59,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659489845] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 12:44:59,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [663434648] [2025-03-04 12:44:59,532 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 12:44:59,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 12:44:59,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 12:44:59,535 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 12:44:59,537 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 12:44:59,588 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-04 12:44:59,612 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-04 12:44:59,613 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 12:44:59,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 12:44:59,614 INFO L256 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 12:44:59,618 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 12:44:59,651 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-04 12:44:59,653 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 12:44:59,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [663434648] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 12:44:59,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 12:44:59,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-03-04 12:44:59,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526680320] [2025-03-04 12:44:59,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 12:44:59,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 12:44:59,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 12:44:59,654 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 12:44:59,655 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 12:44:59,655 INFO L87 Difference]: Start difference. First operand 67 states and 86 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-04 12:44:59,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 12:44:59,669 INFO L93 Difference]: Finished difference Result 105 states and 129 transitions. [2025-03-04 12:44:59,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 12:44:59,670 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 53 [2025-03-04 12:44:59,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 12:44:59,671 INFO L225 Difference]: With dead ends: 105 [2025-03-04 12:44:59,671 INFO L226 Difference]: Without dead ends: 67 [2025-03-04 12:44:59,671 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 12:44:59,672 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 0 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 12:44:59,672 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 244 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 12:44:59,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2025-03-04 12:44:59,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2025-03-04 12:44:59,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 44 states have (on average 1.25) internal successors, (55), 50 states have internal predecessors, (55), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-04 12:44:59,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 85 transitions. [2025-03-04 12:44:59,678 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 85 transitions. Word has length 53 [2025-03-04 12:44:59,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 12:44:59,680 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 85 transitions. [2025-03-04 12:44:59,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-04 12:44:59,680 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 85 transitions. [2025-03-04 12:44:59,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-03-04 12:44:59,681 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 12:44:59,682 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 12:44:59,689 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 12:44:59,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-03-04 12:44:59,886 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 12:44:59,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 12:44:59,887 INFO L85 PathProgramCache]: Analyzing trace with hash 294375701, now seen corresponding path program 1 times [2025-03-04 12:44:59,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 12:44:59,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005492964] [2025-03-04 12:44:59,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 12:44:59,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 12:44:59,898 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-04 12:44:59,904 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-04 12:44:59,904 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 12:44:59,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 12:44:59,972 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-04 12:44:59,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 12:44:59,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005492964] [2025-03-04 12:44:59,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005492964] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 12:44:59,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 12:44:59,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 12:44:59,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20732734] [2025-03-04 12:44:59,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 12:44:59,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 12:44:59,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 12:44:59,974 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 12:44:59,974 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 12:44:59,974 INFO L87 Difference]: Start difference. First operand 67 states and 85 transitions. Second operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-04 12:44:59,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 12:44:59,996 INFO L93 Difference]: Finished difference Result 75 states and 95 transitions. [2025-03-04 12:44:59,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 12:44:59,997 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 59 [2025-03-04 12:44:59,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 12:44:59,998 INFO L225 Difference]: With dead ends: 75 [2025-03-04 12:44:59,999 INFO L226 Difference]: Without dead ends: 73 [2025-03-04 12:44:59,999 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-03-04 12:44:59,999 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 2 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 12:45:00,001 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 239 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 12:45:00,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2025-03-04 12:45:00,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 72. [2025-03-04 12:45:00,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 48 states have (on average 1.25) internal successors, (60), 53 states have internal predecessors, (60), 16 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-04 12:45:00,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 92 transitions. [2025-03-04 12:45:00,010 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 92 transitions. Word has length 59 [2025-03-04 12:45:00,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 12:45:00,011 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 92 transitions. [2025-03-04 12:45:00,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-04 12:45:00,011 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 92 transitions. [2025-03-04 12:45:00,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-04 12:45:00,013 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 12:45:00,013 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 12:45:00,014 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 12:45:00,014 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 12:45:00,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 12:45:00,014 INFO L85 PathProgramCache]: Analyzing trace with hash -136152850, now seen corresponding path program 1 times [2025-03-04 12:45:00,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 12:45:00,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948744070] [2025-03-04 12:45:00,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 12:45:00,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 12:45:00,021 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-04 12:45:00,024 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-04 12:45:00,025 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 12:45:00,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 12:45:00,056 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-03-04 12:45:00,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 12:45:00,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948744070] [2025-03-04 12:45:00,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948744070] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 12:45:00,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 12:45:00,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 12:45:00,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884839691] [2025-03-04 12:45:00,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 12:45:00,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 12:45:00,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 12:45:00,057 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 12:45:00,057 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 12:45:00,057 INFO L87 Difference]: Start difference. First operand 72 states and 92 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (10), 1 states have call predecessors, (10), 2 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-04 12:45:00,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 12:45:00,067 INFO L93 Difference]: Finished difference Result 95 states and 116 transitions. [2025-03-04 12:45:00,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 12:45:00,068 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (10), 1 states have call predecessors, (10), 2 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) Word has length 64 [2025-03-04 12:45:00,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 12:45:00,068 INFO L225 Difference]: With dead ends: 95 [2025-03-04 12:45:00,069 INFO L226 Difference]: Without dead ends: 64 [2025-03-04 12:45:00,069 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 12:45:00,069 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 0 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 12:45:00,069 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 229 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 12:45:00,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2025-03-04 12:45:00,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2025-03-04 12:45:00,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 44 states have (on average 1.1818181818181819) internal successors, (52), 47 states have internal predecessors, (52), 14 states have call successors, (14), 4 states have call predecessors, (14), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-04 12:45:00,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 80 transitions. [2025-03-04 12:45:00,073 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 80 transitions. Word has length 64 [2025-03-04 12:45:00,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 12:45:00,074 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 80 transitions. [2025-03-04 12:45:00,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (10), 1 states have call predecessors, (10), 2 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-04 12:45:00,074 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 80 transitions. [2025-03-04 12:45:00,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-04 12:45:00,074 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 12:45:00,074 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 12:45:00,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 12:45:00,075 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 12:45:00,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 12:45:00,075 INFO L85 PathProgramCache]: Analyzing trace with hash -2129667799, now seen corresponding path program 1 times [2025-03-04 12:45:00,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 12:45:00,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816176509] [2025-03-04 12:45:00,076 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 12:45:00,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 12:45:00,082 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-04 12:45:00,089 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-04 12:45:00,089 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 12:45:00,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 12:45:00,124 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-04 12:45:00,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 12:45:00,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816176509] [2025-03-04 12:45:00,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816176509] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 12:45:00,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1970046455] [2025-03-04 12:45:00,125 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 12:45:00,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 12:45:00,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 12:45:00,127 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 12:45:00,128 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 12:45:00,175 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-04 12:45:00,198 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-04 12:45:00,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 12:45:00,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 12:45:00,202 INFO L256 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 12:45:00,203 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 12:45:00,232 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-04 12:45:00,232 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 12:45:00,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1970046455] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 12:45:00,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 12:45:00,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-03-04 12:45:00,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227581878] [2025-03-04 12:45:00,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 12:45:00,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 12:45:00,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 12:45:00,233 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 12:45:00,233 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 12:45:00,233 INFO L87 Difference]: Start difference. First operand 64 states and 80 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-04 12:45:00,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 12:45:00,240 INFO L93 Difference]: Finished difference Result 78 states and 95 transitions. [2025-03-04 12:45:00,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 12:45:00,241 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) Word has length 72 [2025-03-04 12:45:00,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 12:45:00,241 INFO L225 Difference]: With dead ends: 78 [2025-03-04 12:45:00,241 INFO L226 Difference]: Without dead ends: 64 [2025-03-04 12:45:00,241 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 12:45:00,242 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 0 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 12:45:00,242 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 226 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 12:45:00,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2025-03-04 12:45:00,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2025-03-04 12:45:00,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 44 states have (on average 1.1590909090909092) internal successors, (51), 47 states have internal predecessors, (51), 14 states have call successors, (14), 4 states have call predecessors, (14), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-04 12:45:00,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 79 transitions. [2025-03-04 12:45:00,245 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 79 transitions. Word has length 72 [2025-03-04 12:45:00,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 12:45:00,245 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 79 transitions. [2025-03-04 12:45:00,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-04 12:45:00,245 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 79 transitions. [2025-03-04 12:45:00,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-04 12:45:00,246 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 12:45:00,246 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 12:45:00,252 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 12:45:00,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2025-03-04 12:45:00,447 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 12:45:00,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 12:45:00,449 INFO L85 PathProgramCache]: Analyzing trace with hash -492670067, now seen corresponding path program 1 times [2025-03-04 12:45:00,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 12:45:00,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603561525] [2025-03-04 12:45:00,449 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 12:45:00,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 12:45:00,463 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-04 12:45:00,472 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-04 12:45:00,472 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 12:45:00,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 12:45:00,542 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-04 12:45:00,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 12:45:00,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603561525] [2025-03-04 12:45:00,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603561525] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 12:45:00,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 12:45:00,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 12:45:00,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650008012] [2025-03-04 12:45:00,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 12:45:00,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 12:45:00,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 12:45:00,543 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 12:45:00,543 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 12:45:00,543 INFO L87 Difference]: Start difference. First operand 64 states and 79 transitions. Second operand has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-04 12:45:00,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 12:45:00,559 INFO L93 Difference]: Finished difference Result 71 states and 86 transitions. [2025-03-04 12:45:00,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 12:45:00,560 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 79 [2025-03-04 12:45:00,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 12:45:00,560 INFO L225 Difference]: With dead ends: 71 [2025-03-04 12:45:00,560 INFO L226 Difference]: Without dead ends: 64 [2025-03-04 12:45:00,561 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-03-04 12:45:00,561 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 1 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 12:45:00,561 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 226 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 12:45:00,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2025-03-04 12:45:00,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2025-03-04 12:45:00,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 44 states have (on average 1.1363636363636365) internal successors, (50), 47 states have internal predecessors, (50), 14 states have call successors, (14), 4 states have call predecessors, (14), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-04 12:45:00,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 78 transitions. [2025-03-04 12:45:00,565 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 78 transitions. Word has length 79 [2025-03-04 12:45:00,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 12:45:00,566 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 78 transitions. [2025-03-04 12:45:00,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-04 12:45:00,566 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 78 transitions. [2025-03-04 12:45:00,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-04 12:45:00,566 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 12:45:00,567 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 12:45:00,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 12:45:00,567 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 12:45:00,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 12:45:00,567 INFO L85 PathProgramCache]: Analyzing trace with hash 1250140268, now seen corresponding path program 1 times [2025-03-04 12:45:00,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 12:45:00,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772834960] [2025-03-04 12:45:00,567 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 12:45:00,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 12:45:00,579 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-04 12:45:00,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-04 12:45:00,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 12:45:00,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 12:45:00,638 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-04 12:45:00,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 12:45:00,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772834960] [2025-03-04 12:45:00,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772834960] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 12:45:00,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [966166010] [2025-03-04 12:45:00,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 12:45:00,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 12:45:00,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 12:45:00,657 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 12:45:00,660 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 12:45:00,714 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-04 12:45:00,742 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-04 12:45:00,743 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 12:45:00,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 12:45:00,744 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 12:45:00,746 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 12:45:00,774 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-03-04 12:45:00,775 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 12:45:00,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [966166010] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 12:45:00,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 12:45:00,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-03-04 12:45:00,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393410951] [2025-03-04 12:45:00,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 12:45:00,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 12:45:00,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 12:45:00,777 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 12:45:00,777 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 12:45:00,778 INFO L87 Difference]: Start difference. First operand 64 states and 78 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (12), 3 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-04 12:45:00,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 12:45:00,786 INFO L93 Difference]: Finished difference Result 67 states and 80 transitions. [2025-03-04 12:45:00,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 12:45:00,787 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (12), 3 states have call predecessors, (12), 2 states have call successors, (12) Word has length 79 [2025-03-04 12:45:00,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 12:45:00,788 INFO L225 Difference]: With dead ends: 67 [2025-03-04 12:45:00,788 INFO L226 Difference]: Without dead ends: 0 [2025-03-04 12:45:00,789 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 12:45:00,789 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 0 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 12:45:00,790 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 203 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 12:45:00,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-04 12:45:00,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-04 12:45:00,791 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-03-04 12:45:00,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-04 12:45:00,791 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 79 [2025-03-04 12:45:00,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 12:45:00,791 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 12:45:00,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (12), 3 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-04 12:45:00,791 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-04 12:45:00,792 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-04 12:45:00,793 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2025-03-04 12:45:00,794 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2025-03-04 12:45:00,794 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2025-03-04 12:45:00,794 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2025-03-04 12:45:00,794 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2025-03-04 12:45:00,795 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2025-03-04 12:45:00,795 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2025-03-04 12:45:00,795 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2025-03-04 12:45:00,801 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-04 12:45:00,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 12:45:01,001 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 12:45:01,003 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-04 12:45:01,035 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 12:45:01,041 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 12:45:01 BoogieIcfgContainer [2025-03-04 12:45:01,041 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 12:45:01,042 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 12:45:01,042 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 12:45:01,042 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 12:45:01,043 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:44:58" (3/4) ... [2025-03-04 12:45:01,044 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-04 12:45:01,049 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure printLine [2025-03-04 12:45:01,049 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure globalReturnsFalse [2025-03-04 12:45:01,049 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure printIntLine [2025-03-04 12:45:01,049 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure globalReturnsTrue [2025-03-04 12:45:01,054 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2025-03-04 12:45:01,054 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2025-03-04 12:45:01,054 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-04 12:45:01,055 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-04 12:45:01,118 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 12:45:01,119 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-04 12:45:01,119 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 12:45:01,120 INFO L158 Benchmark]: Toolchain (without parser) took 3821.08ms. Allocated memory is still 142.6MB. Free memory was 102.7MB in the beginning and 50.5MB in the end (delta: 52.1MB). Peak memory consumption was 55.3MB. Max. memory is 16.1GB. [2025-03-04 12:45:01,121 INFO L158 Benchmark]: CDTParser took 0.93ms. Allocated memory is still 201.3MB. Free memory is still 126.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 12:45:01,121 INFO L158 Benchmark]: CACSL2BoogieTranslator took 699.34ms. Allocated memory is still 142.6MB. Free memory was 102.7MB in the beginning and 41.7MB in the end (delta: 60.9MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. [2025-03-04 12:45:01,121 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.70ms. Allocated memory is still 142.6MB. Free memory was 41.7MB in the beginning and 39.0MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 12:45:01,121 INFO L158 Benchmark]: Boogie Preprocessor took 21.96ms. Allocated memory is still 142.6MB. Free memory was 39.0MB in the beginning and 37.2MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 12:45:01,122 INFO L158 Benchmark]: IcfgBuilder took 378.95ms. Allocated memory is still 142.6MB. Free memory was 37.2MB in the beginning and 90.9MB in the end (delta: -53.8MB). Peak memory consumption was 13.4MB. Max. memory is 16.1GB. [2025-03-04 12:45:01,122 INFO L158 Benchmark]: TraceAbstraction took 2598.58ms. Allocated memory is still 142.6MB. Free memory was 90.2MB in the beginning and 58.1MB in the end (delta: 32.0MB). Peak memory consumption was 33.5MB. Max. memory is 16.1GB. [2025-03-04 12:45:01,123 INFO L158 Benchmark]: Witness Printer took 76.93ms. Allocated memory is still 142.6MB. Free memory was 58.1MB in the beginning and 50.5MB in the end (delta: 7.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 12:45:01,124 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.93ms. Allocated memory is still 201.3MB. Free memory is still 126.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 699.34ms. Allocated memory is still 142.6MB. Free memory was 102.7MB in the beginning and 41.7MB in the end (delta: 60.9MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.70ms. Allocated memory is still 142.6MB. Free memory was 41.7MB in the beginning and 39.0MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 21.96ms. Allocated memory is still 142.6MB. Free memory was 39.0MB in the beginning and 37.2MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 378.95ms. Allocated memory is still 142.6MB. Free memory was 37.2MB in the beginning and 90.9MB in the end (delta: -53.8MB). Peak memory consumption was 13.4MB. Max. memory is 16.1GB. * TraceAbstraction took 2598.58ms. Allocated memory is still 142.6MB. Free memory was 90.2MB in the beginning and 58.1MB in the end (delta: 32.0MB). Peak memory consumption was 33.5MB. Max. memory is 16.1GB. * Witness Printer took 76.93ms. Allocated memory is still 142.6MB. Free memory was 58.1MB in the beginning and 50.5MB in the end (delta: 7.6MB). 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: 1628]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1628]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1611]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1611]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1586]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1586]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1564]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1564]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 81 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 2.5s, OverallIterations: 11, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 14 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 11 mSDsluCounter, 2479 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1572 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 100 IncrementalHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 907 mSDtfsCounter, 100 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 237 GetRequests, 211 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=81occurred in iteration=0, InterpolantAutomatonStates: 42, 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, 11 MinimizatonAttempts, 3 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 778 NumberOfCodeBlocks, 778 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 764 ConstructedInterpolants, 0 QuantifiedInterpolants, 892 SizeOfPredicates, 0 NumberOfNonLiveVariables, 623 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 14 InterpolantComputations, 11 PerfectInterpolantSequences, 459/467 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-04 12:45:01,143 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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