./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_min_predec_08_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/CWE191_Integer_Underflow__int_min_predec_08_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 10dd9db220e8f975638086d64b1bfc4d3d3aa1479afc97ef62d6deeabc3d6d4f --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 14:34:05,377 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 14:34:05,436 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-03-04 14:34:05,444 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 14:34:05,444 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 14:34:05,460 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 14:34:05,461 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 14:34:05,461 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 14:34:05,461 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 14:34:05,461 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 14:34:05,461 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 14:34:05,461 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 14:34:05,461 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 14:34:05,462 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 14:34:05,462 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 14:34:05,462 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 14:34:05,462 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 14:34:05,462 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 14:34:05,462 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 14:34:05,462 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 14:34:05,462 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 14:34:05,462 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 14:34:05,462 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 14:34:05,463 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 14:34:05,463 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 14:34:05,463 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 14:34:05,463 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 14:34:05,463 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 14:34:05,463 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 14:34:05,463 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 14:34:05,463 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 14:34:05,463 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 14:34:05,464 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 14:34:05,464 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 14:34:05,464 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 14:34:05,464 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 14:34:05,464 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 14:34:05,464 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 14:34:05,464 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 14:34:05,464 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 14:34:05,464 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 14:34:05,464 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 14:34:05,464 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 -> 10dd9db220e8f975638086d64b1bfc4d3d3aa1479afc97ef62d6deeabc3d6d4f [2025-03-04 14:34:05,702 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 14:34:05,714 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 14:34:05,717 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 14:34:05,718 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 14:34:05,719 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 14:34:05,719 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_min_predec_08_good.i [2025-03-04 14:34:06,898 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/12fe086f4/43d6a3355c30440db332885ae62bbf85/FLAG84df9c196 [2025-03-04 14:34:07,243 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 14:34:07,244 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_min_predec_08_good.i [2025-03-04 14:34:07,263 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/12fe086f4/43d6a3355c30440db332885ae62bbf85/FLAG84df9c196 [2025-03-04 14:34:07,456 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/12fe086f4/43d6a3355c30440db332885ae62bbf85 [2025-03-04 14:34:07,457 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 14:34:07,458 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 14:34:07,459 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 14:34:07,459 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 14:34:07,462 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 14:34:07,463 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:34:07" (1/1) ... [2025-03-04 14:34:07,463 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2adabe3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:34:07, skipping insertion in model container [2025-03-04 14:34:07,463 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:34:07" (1/1) ... [2025-03-04 14:34:07,495 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 14:34:08,110 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 14:34:08,117 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 14:34:08,169 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 14:34:08,246 INFO L204 MainTranslator]: Completed translation [2025-03-04 14:34:08,246 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:34:08 WrapperNode [2025-03-04 14:34:08,247 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 14:34:08,248 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 14:34:08,248 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 14:34:08,248 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 14:34:08,253 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:34:08" (1/1) ... [2025-03-04 14:34:08,267 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:34:08" (1/1) ... [2025-03-04 14:34:08,282 INFO L138 Inliner]: procedures = 503, calls = 46, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 121 [2025-03-04 14:34:08,282 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 14:34:08,282 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 14:34:08,283 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 14:34:08,283 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 14:34:08,288 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:34:08" (1/1) ... [2025-03-04 14:34:08,289 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:34:08" (1/1) ... [2025-03-04 14:34:08,290 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:34:08" (1/1) ... [2025-03-04 14:34:08,296 INFO L175 MemorySlicer]: No memory access in input program. [2025-03-04 14:34:08,296 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:34:08" (1/1) ... [2025-03-04 14:34:08,297 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:34:08" (1/1) ... [2025-03-04 14:34:08,300 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:34:08" (1/1) ... [2025-03-04 14:34:08,301 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:34:08" (1/1) ... [2025-03-04 14:34:08,303 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:34:08" (1/1) ... [2025-03-04 14:34:08,303 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:34:08" (1/1) ... [2025-03-04 14:34:08,304 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 14:34:08,306 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 14:34:08,306 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 14:34:08,306 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 14:34:08,307 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:34:08" (1/1) ... [2025-03-04 14:34:08,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 14:34:08,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:34:08,331 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 14:34:08,344 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 14:34:08,356 INFO L130 BoogieDeclarations]: Found specification of procedure printIntLine [2025-03-04 14:34:08,356 INFO L138 BoogieDeclarations]: Found implementation of procedure printIntLine [2025-03-04 14:34:08,356 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2025-03-04 14:34:08,356 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2025-03-04 14:34:08,356 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 14:34:08,356 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 14:34:08,357 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 14:34:08,357 INFO L130 BoogieDeclarations]: Found specification of procedure staticReturnsTrue [2025-03-04 14:34:08,357 INFO L138 BoogieDeclarations]: Found implementation of procedure staticReturnsTrue [2025-03-04 14:34:08,357 INFO L130 BoogieDeclarations]: Found specification of procedure staticReturnsFalse [2025-03-04 14:34:08,357 INFO L138 BoogieDeclarations]: Found implementation of procedure staticReturnsFalse [2025-03-04 14:34:08,488 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 14:34:08,489 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 14:34:08,663 INFO L? ?]: Removed 28 outVars from TransFormulas that were not future-live. [2025-03-04 14:34:08,664 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 14:34:08,675 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 14:34:08,675 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 14:34:08,675 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:34:08 BoogieIcfgContainer [2025-03-04 14:34:08,675 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 14:34:08,677 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 14:34:08,677 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 14:34:08,680 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 14:34:08,681 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 02:34:07" (1/3) ... [2025-03-04 14:34:08,682 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c9fe84a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:34:08, skipping insertion in model container [2025-03-04 14:34:08,682 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:34:08" (2/3) ... [2025-03-04 14:34:08,683 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c9fe84a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:34:08, skipping insertion in model container [2025-03-04 14:34:08,683 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:34:08" (3/3) ... [2025-03-04 14:34:08,684 INFO L128 eAbstractionObserver]: Analyzing ICFG CWE191_Integer_Underflow__int_min_predec_08_good.i [2025-03-04 14:34:08,698 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 14:34:08,700 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG CWE191_Integer_Underflow__int_min_predec_08_good.i that has 5 procedures, 81 locations, 1 initial locations, 0 loop locations, and 8 error locations. [2025-03-04 14:34:08,746 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 14:34:08,755 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;@7db61af, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 14:34:08,755 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-03-04 14:34:08,759 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 14:34:08,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-04 14:34:08,764 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:34:08,764 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 14:34:08,765 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 14:34:08,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:34:08,769 INFO L85 PathProgramCache]: Analyzing trace with hash 15521404, now seen corresponding path program 1 times [2025-03-04 14:34:08,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:34:08,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054870829] [2025-03-04 14:34:08,775 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:34:08,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:34:08,847 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 14:34:08,863 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 14:34:08,863 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:34:08,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:34:08,984 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 14:34:08,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:34:08,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054870829] [2025-03-04 14:34:08,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054870829] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:34:08,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:34:08,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 14:34:08,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036732202] [2025-03-04 14:34:08,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:34:08,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:34:08,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:34:09,004 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:34:09,005 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:34:09,006 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 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 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 14:34:09,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:34:09,043 INFO L93 Difference]: Finished difference Result 155 states and 199 transitions. [2025-03-04 14:34:09,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:34:09,046 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 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 14:34:09,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:34:09,052 INFO L225 Difference]: With dead ends: 155 [2025-03-04 14:34:09,053 INFO L226 Difference]: Without dead ends: 78 [2025-03-04 14:34:09,055 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:34:09,058 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 1 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 14:34:09,063 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 209 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 14:34:09,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2025-03-04 14:34:09,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 76. [2025-03-04 14:34:09,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 47 states have (on average 1.3829787234042554) internal successors, (65), 58 states have internal predecessors, (65), 17 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-04 14:34:09,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 99 transitions. [2025-03-04 14:34:09,104 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 99 transitions. Word has length 22 [2025-03-04 14:34:09,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:34:09,104 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 99 transitions. [2025-03-04 14:34:09,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 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 14:34:09,105 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 99 transitions. [2025-03-04 14:34:09,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-04 14:34:09,107 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:34:09,107 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 14:34:09,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 14:34:09,107 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 14:34:09,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:34:09,109 INFO L85 PathProgramCache]: Analyzing trace with hash -1791933059, now seen corresponding path program 1 times [2025-03-04 14:34:09,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:34:09,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752068434] [2025-03-04 14:34:09,109 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:34:09,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:34:09,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 14:34:09,123 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 14:34:09,124 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:34:09,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:34:09,230 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 14:34:09,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:34:09,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752068434] [2025-03-04 14:34:09,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752068434] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:34:09,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:34:09,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 14:34:09,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433838607] [2025-03-04 14:34:09,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:34:09,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 14:34:09,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:34:09,233 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 14:34:09,233 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 14:34:09,233 INFO L87 Difference]: Start difference. First operand 76 states and 99 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 14:34:09,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:34:09,255 INFO L93 Difference]: Finished difference Result 131 states and 168 transitions. [2025-03-04 14:34:09,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 14:34:09,255 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2025-03-04 14:34:09,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:34:09,256 INFO L225 Difference]: With dead ends: 131 [2025-03-04 14:34:09,256 INFO L226 Difference]: Without dead ends: 66 [2025-03-04 14:34:09,256 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 14:34:09,257 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 0 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 241 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 14:34:09,257 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 241 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 14:34:09,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2025-03-04 14:34:09,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2025-03-04 14:34:09,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 41 states have (on average 1.3170731707317074) internal successors, (54), 49 states have internal predecessors, (54), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-04 14:34:09,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 84 transitions. [2025-03-04 14:34:09,268 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 84 transitions. Word has length 22 [2025-03-04 14:34:09,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:34:09,268 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 84 transitions. [2025-03-04 14:34:09,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 14:34:09,268 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 84 transitions. [2025-03-04 14:34:09,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-04 14:34:09,269 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:34:09,269 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 14:34:09,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 14:34:09,270 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 14:34:09,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:34:09,272 INFO L85 PathProgramCache]: Analyzing trace with hash -399191760, now seen corresponding path program 1 times [2025-03-04 14:34:09,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:34:09,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530309116] [2025-03-04 14:34:09,272 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:34:09,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:34:09,288 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-04 14:34:09,295 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-04 14:34:09,297 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:34:09,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:34:09,360 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 14:34:09,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:34:09,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530309116] [2025-03-04 14:34:09,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530309116] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:34:09,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:34:09,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 14:34:09,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672488861] [2025-03-04 14:34:09,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:34:09,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 14:34:09,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:34:09,361 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 14:34:09,361 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 14:34:09,362 INFO L87 Difference]: Start difference. First operand 66 states and 84 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 14:34:09,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:34:09,378 INFO L93 Difference]: Finished difference Result 119 states and 149 transitions. [2025-03-04 14:34:09,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 14:34:09,379 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 14:34:09,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:34:09,380 INFO L225 Difference]: With dead ends: 119 [2025-03-04 14:34:09,380 INFO L226 Difference]: Without dead ends: 65 [2025-03-04 14:34:09,380 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 14:34:09,381 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 0 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 232 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 14:34:09,381 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 232 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 14:34:09,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2025-03-04 14:34:09,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2025-03-04 14:34:09,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 41 states have (on average 1.2926829268292683) internal successors, (53), 48 states have internal predecessors, (53), 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 14:34:09,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 81 transitions. [2025-03-04 14:34:09,392 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 81 transitions. Word has length 40 [2025-03-04 14:34:09,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:34:09,393 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 81 transitions. [2025-03-04 14:34:09,393 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 14:34:09,393 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 81 transitions. [2025-03-04 14:34:09,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-04 14:34:09,394 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:34:09,394 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 14:34:09,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 14:34:09,395 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 14:34:09,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:34:09,396 INFO L85 PathProgramCache]: Analyzing trace with hash -1804523841, now seen corresponding path program 1 times [2025-03-04 14:34:09,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:34:09,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533823092] [2025-03-04 14:34:09,396 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:34:09,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:34:09,410 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-04 14:34:09,418 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-04 14:34:09,419 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:34:09,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:34:09,475 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 14:34:09,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:34:09,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533823092] [2025-03-04 14:34:09,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533823092] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:34:09,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:34:09,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 14:34:09,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027987250] [2025-03-04 14:34:09,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:34:09,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:34:09,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:34:09,477 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:34:09,477 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:34:09,477 INFO L87 Difference]: Start difference. First operand 65 states and 81 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 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 14:34:09,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:34:09,497 INFO L93 Difference]: Finished difference Result 114 states and 139 transitions. [2025-03-04 14:34:09,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:34:09,498 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 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 14:34:09,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:34:09,499 INFO L225 Difference]: With dead ends: 114 [2025-03-04 14:34:09,500 INFO L226 Difference]: Without dead ends: 70 [2025-03-04 14:34:09,500 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:34:09,501 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 1 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 14:34:09,503 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 158 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 14:34:09,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2025-03-04 14:34:09,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2025-03-04 14:34:09,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 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 14:34:09,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 87 transitions. [2025-03-04 14:34:09,511 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 87 transitions. Word has length 41 [2025-03-04 14:34:09,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:34:09,514 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 87 transitions. [2025-03-04 14:34:09,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 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 14:34:09,515 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 87 transitions. [2025-03-04 14:34:09,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-04 14:34:09,515 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:34:09,515 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 14:34:09,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 14:34:09,515 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 14:34:09,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:34:09,516 INFO L85 PathProgramCache]: Analyzing trace with hash 682988992, now seen corresponding path program 1 times [2025-03-04 14:34:09,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:34:09,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747827154] [2025-03-04 14:34:09,516 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:34:09,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:34:09,526 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-04 14:34:09,533 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-04 14:34:09,533 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:34:09,533 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:34:09,582 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-04 14:34:09,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:34:09,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747827154] [2025-03-04 14:34:09,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747827154] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:34:09,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1202736639] [2025-03-04 14:34:09,583 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:34:09,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:34:09,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:34:09,585 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 14:34:09,587 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 14:34:09,632 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-04 14:34:09,656 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-04 14:34:09,656 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:34:09,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:34:09,658 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 14:34:09,661 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:34:09,705 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 14:34:09,707 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 14:34:09,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1202736639] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:34:09,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 14:34:09,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-03-04 14:34:09,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462385709] [2025-03-04 14:34:09,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:34:09,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:34:09,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:34:09,709 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:34:09,709 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 14:34:09,709 INFO L87 Difference]: Start difference. First operand 69 states and 87 transitions. Second operand has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 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 14:34:09,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:34:09,730 INFO L93 Difference]: Finished difference Result 109 states and 133 transitions. [2025-03-04 14:34:09,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:34:09,731 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 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 14:34:09,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:34:09,732 INFO L225 Difference]: With dead ends: 109 [2025-03-04 14:34:09,732 INFO L226 Difference]: Without dead ends: 69 [2025-03-04 14:34:09,733 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 14:34:09,734 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 2 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 152 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 14:34:09,734 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 152 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 14:34:09,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2025-03-04 14:34:09,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2025-03-04 14:34:09,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 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 14:34:09,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 85 transitions. [2025-03-04 14:34:09,739 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 85 transitions. Word has length 41 [2025-03-04 14:34:09,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:34:09,739 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 85 transitions. [2025-03-04 14:34:09,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 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 14:34:09,739 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 85 transitions. [2025-03-04 14:34:09,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-04 14:34:09,740 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:34:09,740 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 14:34:09,747 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 14:34:09,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:34:09,941 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 14:34:09,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:34:09,942 INFO L85 PathProgramCache]: Analyzing trace with hash -302177711, now seen corresponding path program 1 times [2025-03-04 14:34:09,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:34:09,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944745438] [2025-03-04 14:34:09,942 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:34:09,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:34:09,948 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-04 14:34:09,950 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-04 14:34:09,951 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:34:09,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:34:09,980 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-04 14:34:09,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:34:09,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944745438] [2025-03-04 14:34:09,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944745438] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:34:09,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [87401912] [2025-03-04 14:34:09,981 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:34:09,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:34:09,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:34:09,982 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 14:34:09,983 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 14:34:10,019 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-04 14:34:10,034 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-04 14:34:10,035 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:34:10,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:34:10,036 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 14:34:10,037 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:34:10,052 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 14:34:10,052 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 14:34:10,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [87401912] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:34:10,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 14:34:10,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-03-04 14:34:10,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924427706] [2025-03-04 14:34:10,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:34:10,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:34:10,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:34:10,053 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:34:10,053 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 14:34:10,053 INFO L87 Difference]: Start difference. First operand 68 states and 85 transitions. Second operand has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 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 14:34:10,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:34:10,062 INFO L93 Difference]: Finished difference Result 69 states and 86 transitions. [2025-03-04 14:34:10,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:34:10,063 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), 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 42 [2025-03-04 14:34:10,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:34:10,064 INFO L225 Difference]: With dead ends: 69 [2025-03-04 14:34:10,064 INFO L226 Difference]: Without dead ends: 68 [2025-03-04 14:34:10,064 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 14:34:10,064 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 1 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 14:34:10,064 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 140 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 14:34:10,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2025-03-04 14:34:10,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 67. [2025-03-04 14:34:10,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 44 states have (on average 1.2272727272727273) internal successors, (54), 49 states have internal predecessors, (54), 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 14:34:10,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 84 transitions. [2025-03-04 14:34:10,069 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 84 transitions. Word has length 42 [2025-03-04 14:34:10,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:34:10,070 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 84 transitions. [2025-03-04 14:34:10,070 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), 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 14:34:10,070 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 84 transitions. [2025-03-04 14:34:10,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-04 14:34:10,072 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:34:10,072 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 14:34:10,081 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 14:34:10,273 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,SelfDestructingSolverStorable5 [2025-03-04 14:34:10,273 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 14:34:10,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:34:10,274 INFO L85 PathProgramCache]: Analyzing trace with hash -1239126661, now seen corresponding path program 1 times [2025-03-04 14:34:10,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:34:10,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414870890] [2025-03-04 14:34:10,274 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:34:10,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:34:10,286 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-04 14:34:10,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-04 14:34:10,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:34:10,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:34:10,325 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 14:34:10,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:34:10,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414870890] [2025-03-04 14:34:10,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414870890] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:34:10,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1462013962] [2025-03-04 14:34:10,326 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:34:10,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:34:10,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:34:10,328 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 14:34:10,352 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 14:34:10,393 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-04 14:34:10,410 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-04 14:34:10,410 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:34:10,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:34:10,411 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 14:34:10,412 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:34:10,432 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-04 14:34:10,432 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 14:34:10,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1462013962] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:34:10,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 14:34:10,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-03-04 14:34:10,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916557809] [2025-03-04 14:34:10,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:34:10,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:34:10,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:34:10,432 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:34:10,433 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 14:34:10,433 INFO L87 Difference]: Start difference. First operand 67 states and 84 transitions. Second operand has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-04 14:34:10,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:34:10,451 INFO L93 Difference]: Finished difference Result 68 states and 85 transitions. [2025-03-04 14:34:10,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:34:10,451 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 53 [2025-03-04 14:34:10,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:34:10,452 INFO L225 Difference]: With dead ends: 68 [2025-03-04 14:34:10,452 INFO L226 Difference]: Without dead ends: 67 [2025-03-04 14:34:10,452 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 14:34:10,453 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 4 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 14:34:10,453 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 139 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 14:34:10,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2025-03-04 14:34:10,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2025-03-04 14:34:10,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 44 states have (on average 1.2045454545454546) internal successors, (53), 48 states have internal predecessors, (53), 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 14:34:10,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 83 transitions. [2025-03-04 14:34:10,458 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 83 transitions. Word has length 53 [2025-03-04 14:34:10,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:34:10,458 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 83 transitions. [2025-03-04 14:34:10,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-04 14:34:10,463 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 83 transitions. [2025-03-04 14:34:10,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-03-04 14:34:10,464 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:34:10,464 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:34:10,491 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 14:34:10,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:34:10,664 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 14:34:10,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:34:10,665 INFO L85 PathProgramCache]: Analyzing trace with hash 241779174, now seen corresponding path program 1 times [2025-03-04 14:34:10,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:34:10,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054461119] [2025-03-04 14:34:10,665 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:34:10,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:34:10,674 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-04 14:34:10,683 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-04 14:34:10,684 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:34:10,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:34:10,740 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 14:34:10,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:34:10,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054461119] [2025-03-04 14:34:10,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054461119] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:34:10,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1368933102] [2025-03-04 14:34:10,741 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:34:10,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:34:10,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:34:10,743 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 14:34:10,744 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 14:34:10,789 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-04 14:34:10,806 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-04 14:34:10,806 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:34:10,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:34:10,807 INFO L256 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 14:34:10,808 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:34:10,826 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-04 14:34:10,826 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 14:34:10,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1368933102] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:34:10,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 14:34:10,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-03-04 14:34:10,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342540558] [2025-03-04 14:34:10,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:34:10,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:34:10,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:34:10,828 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:34:10,828 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 14:34:10,828 INFO L87 Difference]: Start difference. First operand 66 states and 83 transitions. Second operand has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-04 14:34:10,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:34:10,839 INFO L93 Difference]: Finished difference Result 73 states and 92 transitions. [2025-03-04 14:34:10,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:34:10,840 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 54 [2025-03-04 14:34:10,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:34:10,841 INFO L225 Difference]: With dead ends: 73 [2025-03-04 14:34:10,841 INFO L226 Difference]: Without dead ends: 72 [2025-03-04 14:34:10,841 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 14:34:10,842 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 1 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 148 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 14:34:10,842 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 148 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 14:34:10,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2025-03-04 14:34:10,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 71. [2025-03-04 14:34:10,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 48 states have (on average 1.2083333333333333) internal successors, (58), 51 states have internal predecessors, (58), 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 14:34:10,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 90 transitions. [2025-03-04 14:34:10,847 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 90 transitions. Word has length 54 [2025-03-04 14:34:10,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:34:10,847 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 90 transitions. [2025-03-04 14:34:10,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-04 14:34:10,848 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 90 transitions. [2025-03-04 14:34:10,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-03-04 14:34:10,849 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:34:10,849 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 14:34:10,858 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-04 14:34:11,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:34:11,051 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 14:34:11,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:34:11,052 INFO L85 PathProgramCache]: Analyzing trace with hash 920378553, now seen corresponding path program 1 times [2025-03-04 14:34:11,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:34:11,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716751662] [2025-03-04 14:34:11,052 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:34:11,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:34:11,058 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-04 14:34:11,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-04 14:34:11,060 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:34:11,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:34:11,098 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-04 14:34:11,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:34:11,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716751662] [2025-03-04 14:34:11,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716751662] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:34:11,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1641173494] [2025-03-04 14:34:11,098 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:34:11,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:34:11,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:34:11,101 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 14:34:11,101 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 14:34:11,147 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-04 14:34:11,168 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-04 14:34:11,168 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:34:11,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:34:11,169 INFO L256 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 14:34:11,170 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:34:11,190 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 14:34:11,190 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 14:34:11,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1641173494] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:34:11,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 14:34:11,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-03-04 14:34:11,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75802047] [2025-03-04 14:34:11,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:34:11,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:34:11,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:34:11,191 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:34:11,191 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 14:34:11,193 INFO L87 Difference]: Start difference. First operand 71 states and 90 transitions. Second operand has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 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 14:34:11,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:34:11,203 INFO L93 Difference]: Finished difference Result 72 states and 91 transitions. [2025-03-04 14:34:11,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:34:11,203 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 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 14:34:11,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:34:11,204 INFO L225 Difference]: With dead ends: 72 [2025-03-04 14:34:11,204 INFO L226 Difference]: Without dead ends: 71 [2025-03-04 14:34:11,204 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 14:34:11,205 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 1 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 14:34:11,205 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 139 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 14:34:11,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2025-03-04 14:34:11,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 65. [2025-03-04 14:34:11,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 44 states have (on average 1.1818181818181819) internal successors, (52), 47 states have internal predecessors, (52), 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 14:34:11,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 82 transitions. [2025-03-04 14:34:11,210 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 82 transitions. Word has length 59 [2025-03-04 14:34:11,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:34:11,210 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 82 transitions. [2025-03-04 14:34:11,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 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 14:34:11,210 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 82 transitions. [2025-03-04 14:34:11,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-04 14:34:11,211 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:34:11,211 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:34:11,217 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-04 14:34:11,415 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:34:11,415 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 14:34:11,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:34:11,416 INFO L85 PathProgramCache]: Analyzing trace with hash 951259779, now seen corresponding path program 1 times [2025-03-04 14:34:11,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:34:11,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185757003] [2025-03-04 14:34:11,416 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:34:11,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:34:11,424 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-04 14:34:11,431 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-04 14:34:11,431 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:34:11,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:34:11,531 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2025-03-04 14:34:11,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:34:11,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185757003] [2025-03-04 14:34:11,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185757003] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:34:11,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1467050928] [2025-03-04 14:34:11,533 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:34:11,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:34:11,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:34:11,537 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 14:34:11,538 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 14:34:11,580 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-04 14:34:11,601 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-04 14:34:11,602 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:34:11,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:34:11,603 INFO L256 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 14:34:11,605 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:34:11,623 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2025-03-04 14:34:11,623 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 14:34:11,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1467050928] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:34:11,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 14:34:11,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-03-04 14:34:11,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237729485] [2025-03-04 14:34:11,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:34:11,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:34:11,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:34:11,624 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:34:11,624 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 14:34:11,624 INFO L87 Difference]: Start difference. First operand 65 states and 82 transitions. Second operand has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-04 14:34:11,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:34:11,637 INFO L93 Difference]: Finished difference Result 65 states and 82 transitions. [2025-03-04 14:34:11,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:34:11,637 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 66 [2025-03-04 14:34:11,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:34:11,638 INFO L225 Difference]: With dead ends: 65 [2025-03-04 14:34:11,639 INFO L226 Difference]: Without dead ends: 64 [2025-03-04 14:34:11,639 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 14:34:11,640 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 3 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 14:34:11,640 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 140 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 14:34:11,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2025-03-04 14:34:11,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2025-03-04 14:34:11,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 44 states have (on average 1.1590909090909092) internal successors, (51), 46 states have internal predecessors, (51), 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 14:34:11,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 81 transitions. [2025-03-04 14:34:11,653 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 81 transitions. Word has length 66 [2025-03-04 14:34:11,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:34:11,653 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 81 transitions. [2025-03-04 14:34:11,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-04 14:34:11,653 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 81 transitions. [2025-03-04 14:34:11,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-04 14:34:11,654 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:34:11,654 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:34:11,663 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-04 14:34:11,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:34:11,855 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 14:34:11,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:34:11,855 INFO L85 PathProgramCache]: Analyzing trace with hash -575717937, now seen corresponding path program 1 times [2025-03-04 14:34:11,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:34:11,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541664942] [2025-03-04 14:34:11,855 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:34:11,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:34:11,861 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-04 14:34:11,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-04 14:34:11,864 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:34:11,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:34:11,913 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2025-03-04 14:34:11,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:34:11,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541664942] [2025-03-04 14:34:11,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541664942] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:34:11,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [284611818] [2025-03-04 14:34:11,913 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:34:11,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:34:11,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:34:11,915 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 14:34:11,917 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 14:34:11,969 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-04 14:34:11,988 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-04 14:34:11,989 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:34:11,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:34:11,990 INFO L256 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 14:34:11,991 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:34:12,008 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2025-03-04 14:34:12,008 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 14:34:12,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [284611818] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:34:12,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 14:34:12,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-03-04 14:34:12,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141744438] [2025-03-04 14:34:12,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:34:12,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:34:12,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:34:12,009 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:34:12,010 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 14:34:12,010 INFO L87 Difference]: Start difference. First operand 64 states and 81 transitions. Second operand has 3 states, 2 states have (on average 16.0) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-04 14:34:12,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:34:12,017 INFO L93 Difference]: Finished difference Result 70 states and 87 transitions. [2025-03-04 14:34:12,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:34:12,017 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 16.0) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 67 [2025-03-04 14:34:12,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:34:12,018 INFO L225 Difference]: With dead ends: 70 [2025-03-04 14:34:12,018 INFO L226 Difference]: Without dead ends: 64 [2025-03-04 14:34:12,018 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 14:34:12,018 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 0 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 14:34:12,019 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 147 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 14:34:12,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2025-03-04 14:34:12,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2025-03-04 14:34:12,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 44 states have (on average 1.1363636363636365) internal successors, (50), 46 states have internal predecessors, (50), 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 14:34:12,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 80 transitions. [2025-03-04 14:34:12,025 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 80 transitions. Word has length 67 [2025-03-04 14:34:12,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:34:12,026 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 80 transitions. [2025-03-04 14:34:12,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 16.0) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-04 14:34:12,026 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 80 transitions. [2025-03-04 14:34:12,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-04 14:34:12,027 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:34:12,027 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:34:12,033 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-04 14:34:12,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:34:12,229 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 14:34:12,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:34:12,229 INFO L85 PathProgramCache]: Analyzing trace with hash 1911794896, now seen corresponding path program 1 times [2025-03-04 14:34:12,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:34:12,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898272817] [2025-03-04 14:34:12,229 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:34:12,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:34:12,239 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-04 14:34:12,242 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-04 14:34:12,242 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:34:12,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:34:12,275 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2025-03-04 14:34:12,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:34:12,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898272817] [2025-03-04 14:34:12,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898272817] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:34:12,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [197453865] [2025-03-04 14:34:12,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:34:12,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:34:12,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:34:12,277 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 14:34:12,280 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-04 14:34:12,318 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-04 14:34:12,337 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-04 14:34:12,337 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:34:12,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:34:12,338 INFO L256 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 14:34:12,339 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:34:12,374 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2025-03-04 14:34:12,374 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 14:34:12,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [197453865] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:34:12,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 14:34:12,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-03-04 14:34:12,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388520648] [2025-03-04 14:34:12,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:34:12,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:34:12,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:34:12,375 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:34:12,375 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 14:34:12,376 INFO L87 Difference]: Start difference. First operand 64 states and 80 transitions. Second operand has 3 states, 2 states have (on average 16.0) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-04 14:34:12,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:34:12,381 INFO L93 Difference]: Finished difference Result 64 states and 80 transitions. [2025-03-04 14:34:12,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:34:12,382 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 16.0) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 67 [2025-03-04 14:34:12,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:34:12,382 INFO L225 Difference]: With dead ends: 64 [2025-03-04 14:34:12,382 INFO L226 Difference]: Without dead ends: 0 [2025-03-04 14:34:12,383 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 14:34:12,383 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 0 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 14:34:12,384 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 139 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 14:34:12,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-04 14:34:12,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-04 14:34:12,384 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 14:34:12,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-04 14:34:12,384 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 67 [2025-03-04 14:34:12,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:34:12,384 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 14:34:12,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 16.0) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-04 14:34:12,384 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-04 14:34:12,384 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-04 14:34:12,389 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2025-03-04 14:34:12,389 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2025-03-04 14:34:12,389 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2025-03-04 14:34:12,389 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2025-03-04 14:34:12,389 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2025-03-04 14:34:12,389 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2025-03-04 14:34:12,390 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2025-03-04 14:34:12,390 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2025-03-04 14:34:12,397 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-04 14:34:12,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-04 14:34:12,594 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:34:12,596 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-04 14:34:12,659 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 14:34:12,663 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 02:34:12 BoogieIcfgContainer [2025-03-04 14:34:12,663 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 14:34:12,663 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 14:34:12,663 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 14:34:12,664 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 14:34:12,664 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:34:08" (3/4) ... [2025-03-04 14:34:12,665 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-04 14:34:12,672 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure printLine [2025-03-04 14:34:12,672 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure staticReturnsFalse [2025-03-04 14:34:12,672 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure printIntLine [2025-03-04 14:34:12,672 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure staticReturnsTrue [2025-03-04 14:34:12,676 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2025-03-04 14:34:12,676 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2025-03-04 14:34:12,676 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-04 14:34:12,676 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-04 14:34:12,741 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 14:34:12,741 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-04 14:34:12,741 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 14:34:12,742 INFO L158 Benchmark]: Toolchain (without parser) took 5283.18ms. Allocated memory is still 142.6MB. Free memory was 109.5MB in the beginning and 95.1MB in the end (delta: 14.5MB). Peak memory consumption was 14.5MB. Max. memory is 16.1GB. [2025-03-04 14:34:12,742 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 201.3MB. Free memory is still 124.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 14:34:12,743 INFO L158 Benchmark]: CACSL2BoogieTranslator took 787.79ms. Allocated memory is still 142.6MB. Free memory was 109.5MB in the beginning and 49.1MB in the end (delta: 60.5MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. [2025-03-04 14:34:12,743 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.03ms. Allocated memory is still 142.6MB. Free memory was 49.1MB in the beginning and 46.0MB in the end (delta: 3.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 14:34:12,743 INFO L158 Benchmark]: Boogie Preprocessor took 22.23ms. Allocated memory is still 142.6MB. Free memory was 46.0MB in the beginning and 44.5MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 14:34:12,743 INFO L158 Benchmark]: IcfgBuilder took 369.17ms. Allocated memory is still 142.6MB. Free memory was 44.5MB in the beginning and 97.4MB in the end (delta: -52.9MB). Peak memory consumption was 14.0MB. Max. memory is 16.1GB. [2025-03-04 14:34:12,744 INFO L158 Benchmark]: TraceAbstraction took 3986.08ms. Allocated memory is still 142.6MB. Free memory was 96.6MB in the beginning and 101.8MB in the end (delta: -5.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 14:34:12,744 INFO L158 Benchmark]: Witness Printer took 77.62ms. Allocated memory is still 142.6MB. Free memory was 101.8MB in the beginning and 95.1MB in the end (delta: 6.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 14:34:12,745 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.25ms. Allocated memory is still 201.3MB. Free memory is still 124.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 787.79ms. Allocated memory is still 142.6MB. Free memory was 109.5MB in the beginning and 49.1MB in the end (delta: 60.5MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.03ms. Allocated memory is still 142.6MB. Free memory was 49.1MB in the beginning and 46.0MB in the end (delta: 3.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 22.23ms. Allocated memory is still 142.6MB. Free memory was 46.0MB in the beginning and 44.5MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 369.17ms. Allocated memory is still 142.6MB. Free memory was 44.5MB in the beginning and 97.4MB in the end (delta: -52.9MB). Peak memory consumption was 14.0MB. Max. memory is 16.1GB. * TraceAbstraction took 3986.08ms. Allocated memory is still 142.6MB. Free memory was 96.6MB in the beginning and 101.8MB in the end (delta: -5.2MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 77.62ms. Allocated memory is still 142.6MB. Free memory was 101.8MB in the beginning and 95.1MB in the end (delta: 6.7MB). 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: 1636]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1636]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1619]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1619]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1594]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1594]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1572]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1572]: 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: 3.9s, OverallIterations: 12, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 18 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 14 mSDsluCounter, 1984 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1020 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 78 IncrementalHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 964 mSDtfsCounter, 78 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 487 GetRequests, 457 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=81occurred in iteration=0, InterpolantAutomatonStates: 38, 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, 12 MinimizatonAttempts, 13 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 1023 NumberOfCodeBlocks, 1023 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 1003 ConstructedInterpolants, 0 QuantifiedInterpolants, 1255 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1367 ConjunctsInSsa, 16 ConjunctsInUnsatCore, 20 InterpolantComputations, 12 PerfectInterpolantSequences, 528/556 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 14:34:12,759 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