./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_rand_multiply_06_good.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 8fc3dc66 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_rand_multiply_06_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 80fab94ae60ebc9afba46667a1a53e32eeb65578d75eefdcab36207c5c519270 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 18:51:28,179 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 18:51:28,226 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-03-17 18:51:28,232 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 18:51:28,234 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 18:51:28,255 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 18:51:28,256 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 18:51:28,256 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 18:51:28,256 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 18:51:28,256 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 18:51:28,256 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 18:51:28,257 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 18:51:28,257 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 18:51:28,257 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 18:51:28,257 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 18:51:28,257 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 18:51:28,257 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 18:51:28,257 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 18:51:28,257 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 18:51:28,257 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 18:51:28,258 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 18:51:28,258 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 18:51:28,258 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-17 18:51:28,258 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 18:51:28,258 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 18:51:28,258 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 18:51:28,258 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 18:51:28,258 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 18:51:28,258 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 18:51:28,258 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 18:51:28,259 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 18:51:28,259 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 18:51:28,259 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 18:51:28,259 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 18:51:28,259 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 18:51:28,259 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 18:51:28,259 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 18:51:28,259 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 18:51:28,259 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 18:51:28,259 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 18:51:28,259 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 18:51:28,259 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 18:51:28,259 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 -> 80fab94ae60ebc9afba46667a1a53e32eeb65578d75eefdcab36207c5c519270 [2025-03-17 18:51:28,486 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 18:51:28,495 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 18:51:28,496 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 18:51:28,497 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 18:51:28,497 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 18:51:28,499 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_rand_multiply_06_good.i [2025-03-17 18:51:29,628 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c1c9f67b2/dee650b911d849c99b8355d4f8ae2a0d/FLAGcd3204f13 [2025-03-17 18:51:30,000 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 18:51:30,000 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_rand_multiply_06_good.i [2025-03-17 18:51:30,028 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c1c9f67b2/dee650b911d849c99b8355d4f8ae2a0d/FLAGcd3204f13 [2025-03-17 18:51:30,189 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c1c9f67b2/dee650b911d849c99b8355d4f8ae2a0d [2025-03-17 18:51:30,190 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 18:51:30,191 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 18:51:30,192 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 18:51:30,192 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 18:51:30,195 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 18:51:30,195 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 06:51:30" (1/1) ... [2025-03-17 18:51:30,196 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d18d8eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:51:30, skipping insertion in model container [2025-03-17 18:51:30,196 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 06:51:30" (1/1) ... [2025-03-17 18:51:30,227 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 18:51:30,695 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 18:51:30,706 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 18:51:30,788 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 18:51:30,863 INFO L204 MainTranslator]: Completed translation [2025-03-17 18:51:30,864 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:51:30 WrapperNode [2025-03-17 18:51:30,864 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 18:51:30,864 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 18:51:30,865 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 18:51:30,865 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 18:51:30,869 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:51:30" (1/1) ... [2025-03-17 18:51:30,884 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:51:30" (1/1) ... [2025-03-17 18:51:30,901 INFO L138 Inliner]: procedures = 501, calls = 38, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 198 [2025-03-17 18:51:30,902 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 18:51:30,902 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 18:51:30,902 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 18:51:30,902 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 18:51:30,910 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:51:30" (1/1) ... [2025-03-17 18:51:30,911 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:51:30" (1/1) ... [2025-03-17 18:51:30,913 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:51:30" (1/1) ... [2025-03-17 18:51:30,922 INFO L175 MemorySlicer]: No memory access in input program. [2025-03-17 18:51:30,922 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:51:30" (1/1) ... [2025-03-17 18:51:30,922 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:51:30" (1/1) ... [2025-03-17 18:51:30,927 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:51:30" (1/1) ... [2025-03-17 18:51:30,928 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:51:30" (1/1) ... [2025-03-17 18:51:30,929 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:51:30" (1/1) ... [2025-03-17 18:51:30,929 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:51:30" (1/1) ... [2025-03-17 18:51:30,931 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 18:51:30,934 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 18:51:30,934 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 18:51:30,934 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 18:51:30,935 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:51:30" (1/1) ... [2025-03-17 18:51:30,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 18:51:30,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 18:51:30,957 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-17 18:51:30,958 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-17 18:51:30,975 INFO L130 BoogieDeclarations]: Found specification of procedure printIntLine [2025-03-17 18:51:30,975 INFO L138 BoogieDeclarations]: Found implementation of procedure printIntLine [2025-03-17 18:51:30,975 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2025-03-17 18:51:30,975 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2025-03-17 18:51:30,975 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 18:51:30,975 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 18:51:30,975 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 18:51:31,074 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 18:51:31,076 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 18:51:31,332 INFO L? ?]: Removed 104 outVars from TransFormulas that were not future-live. [2025-03-17 18:51:31,332 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 18:51:31,358 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 18:51:31,359 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 18:51:31,359 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 06:51:31 BoogieIcfgContainer [2025-03-17 18:51:31,360 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 18:51:31,361 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 18:51:31,361 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 18:51:31,364 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 18:51:31,364 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 06:51:30" (1/3) ... [2025-03-17 18:51:31,365 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78138385 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 06:51:31, skipping insertion in model container [2025-03-17 18:51:31,365 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:51:30" (2/3) ... [2025-03-17 18:51:31,365 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78138385 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 06:51:31, skipping insertion in model container [2025-03-17 18:51:31,365 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 06:51:31" (3/3) ... [2025-03-17 18:51:31,366 INFO L128 eAbstractionObserver]: Analyzing ICFG CWE191_Integer_Underflow__int_rand_multiply_06_good.i [2025-03-17 18:51:31,380 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 18:51:31,383 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG CWE191_Integer_Underflow__int_rand_multiply_06_good.i that has 3 procedures, 104 locations, 1 initial locations, 0 loop locations, and 8 error locations. [2025-03-17 18:51:31,431 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 18:51:31,440 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;@5af31ce4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 18:51:31,441 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-03-17 18:51:31,445 INFO L276 IsEmpty]: Start isEmpty. Operand has 104 states, 83 states have (on average 1.5903614457831325) internal successors, (132), 95 states have internal predecessors, (132), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-17 18:51:31,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-17 18:51:31,450 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 18:51:31,450 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 18:51:31,451 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-17 18:51:31,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 18:51:31,454 INFO L85 PathProgramCache]: Analyzing trace with hash 617553843, now seen corresponding path program 1 times [2025-03-17 18:51:31,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 18:51:31,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491430238] [2025-03-17 18:51:31,460 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 18:51:31,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 18:51:31,528 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-17 18:51:31,546 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-17 18:51:31,547 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 18:51:31,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 18:51:31,645 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-17 18:51:31,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 18:51:31,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491430238] [2025-03-17 18:51:31,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491430238] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 18:51:31,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 18:51:31,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 18:51:31,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558907910] [2025-03-17 18:51:31,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 18:51:31,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 18:51:31,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 18:51:31,667 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 18:51:31,667 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 18:51:31,670 INFO L87 Difference]: Start difference. First operand has 104 states, 83 states have (on average 1.5903614457831325) internal successors, (132), 95 states have internal predecessors, (132), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 18:51:31,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 18:51:31,739 INFO L93 Difference]: Finished difference Result 180 states and 259 transitions. [2025-03-17 18:51:31,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 18:51:31,741 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2025-03-17 18:51:31,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 18:51:31,747 INFO L225 Difference]: With dead ends: 180 [2025-03-17 18:51:31,747 INFO L226 Difference]: Without dead ends: 95 [2025-03-17 18:51:31,750 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-17 18:51:31,752 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 137 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 18:51:31,756 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 124 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 18:51:31,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2025-03-17 18:51:31,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2025-03-17 18:51:31,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 79 states have (on average 1.4936708860759493) internal successors, (118), 88 states have internal predecessors, (118), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-17 18:51:31,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 130 transitions. [2025-03-17 18:51:31,796 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 130 transitions. Word has length 12 [2025-03-17 18:51:31,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 18:51:31,797 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 130 transitions. [2025-03-17 18:51:31,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 18:51:31,798 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 130 transitions. [2025-03-17 18:51:31,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-17 18:51:31,799 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 18:51:31,799 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 18:51:31,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 18:51:31,800 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-17 18:51:31,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 18:51:31,801 INFO L85 PathProgramCache]: Analyzing trace with hash 1719481473, now seen corresponding path program 1 times [2025-03-17 18:51:31,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 18:51:31,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017515268] [2025-03-17 18:51:31,801 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 18:51:31,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 18:51:31,815 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-17 18:51:31,834 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-17 18:51:31,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 18:51:31,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 18:51:31,892 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-17 18:51:31,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 18:51:31,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017515268] [2025-03-17 18:51:31,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017515268] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 18:51:31,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 18:51:31,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 18:51:31,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145768312] [2025-03-17 18:51:31,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 18:51:31,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 18:51:31,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 18:51:31,894 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 18:51:31,894 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 18:51:31,895 INFO L87 Difference]: Start difference. First operand 95 states and 130 transitions. Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 18:51:31,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 18:51:31,929 INFO L93 Difference]: Finished difference Result 95 states and 130 transitions. [2025-03-17 18:51:31,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 18:51:31,930 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2025-03-17 18:51:31,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 18:51:31,931 INFO L225 Difference]: With dead ends: 95 [2025-03-17 18:51:31,931 INFO L226 Difference]: Without dead ends: 94 [2025-03-17 18:51:31,931 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 18:51:31,932 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 36 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 18:51:31,932 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 198 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 18:51:31,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2025-03-17 18:51:31,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2025-03-17 18:51:31,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 79 states have (on average 1.481012658227848) internal successors, (117), 87 states have internal predecessors, (117), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-17 18:51:31,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 129 transitions. [2025-03-17 18:51:31,942 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 129 transitions. Word has length 18 [2025-03-17 18:51:31,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 18:51:31,942 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 129 transitions. [2025-03-17 18:51:31,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 18:51:31,942 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 129 transitions. [2025-03-17 18:51:31,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-17 18:51:31,942 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 18:51:31,942 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 18:51:31,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 18:51:31,943 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-17 18:51:31,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 18:51:31,943 INFO L85 PathProgramCache]: Analyzing trace with hash 1764318175, now seen corresponding path program 1 times [2025-03-17 18:51:31,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 18:51:31,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391538927] [2025-03-17 18:51:31,943 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 18:51:31,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 18:51:31,958 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-17 18:51:31,964 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-17 18:51:31,964 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 18:51:31,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 18:51:32,012 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-17 18:51:32,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 18:51:32,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391538927] [2025-03-17 18:51:32,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391538927] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 18:51:32,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 18:51:32,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 18:51:32,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137281934] [2025-03-17 18:51:32,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 18:51:32,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 18:51:32,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 18:51:32,014 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 18:51:32,014 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 18:51:32,014 INFO L87 Difference]: Start difference. First operand 94 states and 129 transitions. Second operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 18:51:32,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 18:51:32,054 INFO L93 Difference]: Finished difference Result 94 states and 129 transitions. [2025-03-17 18:51:32,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 18:51:32,056 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2025-03-17 18:51:32,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 18:51:32,056 INFO L225 Difference]: With dead ends: 94 [2025-03-17 18:51:32,056 INFO L226 Difference]: Without dead ends: 93 [2025-03-17 18:51:32,057 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 18:51:32,057 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 0 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 18:51:32,057 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 227 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 18:51:32,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2025-03-17 18:51:32,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2025-03-17 18:51:32,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 79 states have (on average 1.4683544303797469) internal successors, (116), 86 states have internal predecessors, (116), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-17 18:51:32,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 128 transitions. [2025-03-17 18:51:32,063 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 128 transitions. Word has length 19 [2025-03-17 18:51:32,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 18:51:32,063 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 128 transitions. [2025-03-17 18:51:32,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 18:51:32,063 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 128 transitions. [2025-03-17 18:51:32,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-17 18:51:32,064 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 18:51:32,064 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 18:51:32,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 18:51:32,064 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-17 18:51:32,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 18:51:32,064 INFO L85 PathProgramCache]: Analyzing trace with hash -1922153235, now seen corresponding path program 1 times [2025-03-17 18:51:32,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 18:51:32,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747833876] [2025-03-17 18:51:32,065 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 18:51:32,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 18:51:32,073 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-17 18:51:32,083 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-17 18:51:32,084 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 18:51:32,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 18:51:32,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 18:51:32,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 18:51:32,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747833876] [2025-03-17 18:51:32,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747833876] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 18:51:32,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 18:51:32,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 18:51:32,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593883643] [2025-03-17 18:51:32,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 18:51:32,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 18:51:32,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 18:51:32,121 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 18:51:32,121 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 18:51:32,121 INFO L87 Difference]: Start difference. First operand 93 states and 128 transitions. Second operand has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 18:51:32,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 18:51:32,157 INFO L93 Difference]: Finished difference Result 93 states and 128 transitions. [2025-03-17 18:51:32,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 18:51:32,158 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2025-03-17 18:51:32,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 18:51:32,158 INFO L225 Difference]: With dead ends: 93 [2025-03-17 18:51:32,158 INFO L226 Difference]: Without dead ends: 92 [2025-03-17 18:51:32,159 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 18:51:32,159 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 36 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 18:51:32,159 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 194 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 18:51:32,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2025-03-17 18:51:32,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2025-03-17 18:51:32,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 79 states have (on average 1.4556962025316456) internal successors, (115), 85 states have internal predecessors, (115), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-17 18:51:32,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 127 transitions. [2025-03-17 18:51:32,169 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 127 transitions. Word has length 28 [2025-03-17 18:51:32,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 18:51:32,169 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 127 transitions. [2025-03-17 18:51:32,170 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 18:51:32,170 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 127 transitions. [2025-03-17 18:51:32,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-17 18:51:32,171 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 18:51:32,171 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 18:51:32,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 18:51:32,171 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-17 18:51:32,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 18:51:32,172 INFO L85 PathProgramCache]: Analyzing trace with hash 542791867, now seen corresponding path program 1 times [2025-03-17 18:51:32,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 18:51:32,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354827033] [2025-03-17 18:51:32,172 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 18:51:32,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 18:51:32,181 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-17 18:51:32,190 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-17 18:51:32,190 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 18:51:32,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 18:51:32,243 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-17 18:51:32,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 18:51:32,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354827033] [2025-03-17 18:51:32,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354827033] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 18:51:32,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 18:51:32,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 18:51:32,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295364866] [2025-03-17 18:51:32,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 18:51:32,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 18:51:32,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 18:51:32,244 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 18:51:32,244 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 18:51:32,244 INFO L87 Difference]: Start difference. First operand 92 states and 127 transitions. Second operand has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 18:51:32,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 18:51:32,302 INFO L93 Difference]: Finished difference Result 92 states and 127 transitions. [2025-03-17 18:51:32,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 18:51:32,303 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2025-03-17 18:51:32,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 18:51:32,305 INFO L225 Difference]: With dead ends: 92 [2025-03-17 18:51:32,306 INFO L226 Difference]: Without dead ends: 91 [2025-03-17 18:51:32,306 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 18:51:32,306 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 0 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 18:51:32,306 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 223 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 18:51:32,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-03-17 18:51:32,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2025-03-17 18:51:32,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 79 states have (on average 1.4430379746835442) internal successors, (114), 84 states have internal predecessors, (114), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-17 18:51:32,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 126 transitions. [2025-03-17 18:51:32,311 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 126 transitions. Word has length 29 [2025-03-17 18:51:32,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 18:51:32,311 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 126 transitions. [2025-03-17 18:51:32,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 18:51:32,311 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 126 transitions. [2025-03-17 18:51:32,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-17 18:51:32,311 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 18:51:32,311 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 18:51:32,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 18:51:32,312 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-17 18:51:32,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 18:51:32,312 INFO L85 PathProgramCache]: Analyzing trace with hash 1952966063, now seen corresponding path program 1 times [2025-03-17 18:51:32,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 18:51:32,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652777453] [2025-03-17 18:51:32,312 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 18:51:32,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 18:51:32,318 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-17 18:51:32,322 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-17 18:51:32,322 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 18:51:32,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 18:51:32,344 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-17 18:51:32,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 18:51:32,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652777453] [2025-03-17 18:51:32,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652777453] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 18:51:32,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 18:51:32,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 18:51:32,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436848839] [2025-03-17 18:51:32,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 18:51:32,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 18:51:32,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 18:51:32,345 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 18:51:32,345 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 18:51:32,345 INFO L87 Difference]: Start difference. First operand 91 states and 126 transitions. Second operand has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 18:51:32,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 18:51:32,363 INFO L93 Difference]: Finished difference Result 91 states and 126 transitions. [2025-03-17 18:51:32,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 18:51:32,364 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2025-03-17 18:51:32,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 18:51:32,365 INFO L225 Difference]: With dead ends: 91 [2025-03-17 18:51:32,365 INFO L226 Difference]: Without dead ends: 90 [2025-03-17 18:51:32,365 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 18:51:32,365 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 1 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 18:51:32,365 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 220 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 18:51:32,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2025-03-17 18:51:32,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2025-03-17 18:51:32,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 79 states have (on average 1.4303797468354431) internal successors, (113), 83 states have internal predecessors, (113), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-17 18:51:32,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 125 transitions. [2025-03-17 18:51:32,369 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 125 transitions. Word has length 31 [2025-03-17 18:51:32,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 18:51:32,369 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 125 transitions. [2025-03-17 18:51:32,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 18:51:32,369 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 125 transitions. [2025-03-17 18:51:32,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-03-17 18:51:32,370 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 18:51:32,370 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 18:51:32,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 18:51:32,370 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-17 18:51:32,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 18:51:32,370 INFO L85 PathProgramCache]: Analyzing trace with hash 412405803, now seen corresponding path program 1 times [2025-03-17 18:51:32,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 18:51:32,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595501560] [2025-03-17 18:51:32,371 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 18:51:32,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 18:51:32,376 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-17 18:51:32,379 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-17 18:51:32,379 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 18:51:32,379 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 18:51:32,400 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-17 18:51:32,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 18:51:32,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595501560] [2025-03-17 18:51:32,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595501560] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 18:51:32,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 18:51:32,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 18:51:32,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784462022] [2025-03-17 18:51:32,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 18:51:32,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 18:51:32,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 18:51:32,401 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 18:51:32,401 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 18:51:32,401 INFO L87 Difference]: Start difference. First operand 90 states and 125 transitions. Second operand has 3 states, 2 states have (on average 15.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 18:51:32,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 18:51:32,423 INFO L93 Difference]: Finished difference Result 98 states and 132 transitions. [2025-03-17 18:51:32,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 18:51:32,424 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 15.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2025-03-17 18:51:32,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 18:51:32,424 INFO L225 Difference]: With dead ends: 98 [2025-03-17 18:51:32,424 INFO L226 Difference]: Without dead ends: 89 [2025-03-17 18:51:32,424 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 18:51:32,425 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 0 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 18:51:32,425 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 220 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 18:51:32,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2025-03-17 18:51:32,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2025-03-17 18:51:32,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 79 states have (on average 1.4050632911392404) internal successors, (111), 82 states have internal predecessors, (111), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-17 18:51:32,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 123 transitions. [2025-03-17 18:51:32,429 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 123 transitions. Word has length 32 [2025-03-17 18:51:32,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 18:51:32,429 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 123 transitions. [2025-03-17 18:51:32,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 15.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 18:51:32,429 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 123 transitions. [2025-03-17 18:51:32,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-17 18:51:32,430 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 18:51:32,430 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 18:51:32,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 18:51:32,430 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-17 18:51:32,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 18:51:32,430 INFO L85 PathProgramCache]: Analyzing trace with hash 689773830, now seen corresponding path program 1 times [2025-03-17 18:51:32,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 18:51:32,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098816198] [2025-03-17 18:51:32,430 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 18:51:32,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 18:51:32,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-17 18:51:32,440 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-17 18:51:32,440 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 18:51:32,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 18:51:32,465 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-17 18:51:32,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 18:51:32,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098816198] [2025-03-17 18:51:32,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098816198] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 18:51:32,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 18:51:32,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 18:51:32,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366514307] [2025-03-17 18:51:32,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 18:51:32,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 18:51:32,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 18:51:32,465 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 18:51:32,466 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 18:51:32,466 INFO L87 Difference]: Start difference. First operand 89 states and 123 transitions. Second operand has 3 states, 2 states have (on average 19.0) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 18:51:32,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 18:51:32,484 INFO L93 Difference]: Finished difference Result 89 states and 123 transitions. [2025-03-17 18:51:32,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 18:51:32,484 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 19.0) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 42 [2025-03-17 18:51:32,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 18:51:32,485 INFO L225 Difference]: With dead ends: 89 [2025-03-17 18:51:32,485 INFO L226 Difference]: Without dead ends: 88 [2025-03-17 18:51:32,485 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 18:51:32,486 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 1 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 18:51:32,488 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 219 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 18:51:32,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2025-03-17 18:51:32,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2025-03-17 18:51:32,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 79 states have (on average 1.3924050632911393) internal successors, (110), 81 states have internal predecessors, (110), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-17 18:51:32,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 122 transitions. [2025-03-17 18:51:32,492 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 122 transitions. Word has length 42 [2025-03-17 18:51:32,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 18:51:32,492 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 122 transitions. [2025-03-17 18:51:32,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 19.0) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 18:51:32,492 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 122 transitions. [2025-03-17 18:51:32,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-17 18:51:32,493 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 18:51:32,493 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 18:51:32,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 18:51:32,493 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-17 18:51:32,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 18:51:32,493 INFO L85 PathProgramCache]: Analyzing trace with hash -91847769, now seen corresponding path program 1 times [2025-03-17 18:51:32,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 18:51:32,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346629994] [2025-03-17 18:51:32,493 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 18:51:32,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 18:51:32,503 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-17 18:51:32,507 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-17 18:51:32,508 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 18:51:32,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 18:51:32,552 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-17 18:51:32,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 18:51:32,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346629994] [2025-03-17 18:51:32,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346629994] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 18:51:32,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 18:51:32,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 18:51:32,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207336138] [2025-03-17 18:51:32,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 18:51:32,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 18:51:32,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 18:51:32,553 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 18:51:32,553 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 18:51:32,553 INFO L87 Difference]: Start difference. First operand 88 states and 122 transitions. Second operand has 3 states, 2 states have (on average 19.5) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 18:51:32,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 18:51:32,578 INFO L93 Difference]: Finished difference Result 88 states and 122 transitions. [2025-03-17 18:51:32,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 18:51:32,578 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 19.5) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 43 [2025-03-17 18:51:32,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 18:51:32,579 INFO L225 Difference]: With dead ends: 88 [2025-03-17 18:51:32,579 INFO L226 Difference]: Without dead ends: 0 [2025-03-17 18:51:32,579 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 18:51:32,581 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 0 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 18:51:32,582 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 219 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 18:51:32,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-17 18:51:32,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-17 18:51:32,582 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-17 18:51:32,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-17 18:51:32,584 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 43 [2025-03-17 18:51:32,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 18:51:32,584 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-17 18:51:32,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 19.5) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 18:51:32,584 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-17 18:51:32,585 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-17 18:51:32,586 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2025-03-17 18:51:32,587 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2025-03-17 18:51:32,587 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2025-03-17 18:51:32,587 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2025-03-17 18:51:32,587 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2025-03-17 18:51:32,587 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2025-03-17 18:51:32,587 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2025-03-17 18:51:32,587 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2025-03-17 18:51:32,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 18:51:32,589 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 18:51:32,591 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-17 18:51:32,624 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 18:51:32,629 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 06:51:32 BoogieIcfgContainer [2025-03-17 18:51:32,631 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 18:51:32,631 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 18:51:32,631 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 18:51:32,632 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 18:51:32,632 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 06:51:31" (3/4) ... [2025-03-17 18:51:32,634 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-17 18:51:32,638 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure printLine [2025-03-17 18:51:32,638 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure printIntLine [2025-03-17 18:51:32,644 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2025-03-17 18:51:32,644 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2025-03-17 18:51:32,644 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-17 18:51:32,645 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-17 18:51:32,712 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-17 18:51:32,713 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-17 18:51:32,713 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 18:51:32,714 INFO L158 Benchmark]: Toolchain (without parser) took 2522.06ms. Allocated memory is still 167.8MB. Free memory was 119.4MB in the beginning and 65.4MB in the end (delta: 54.0MB). Peak memory consumption was 55.4MB. Max. memory is 16.1GB. [2025-03-17 18:51:32,714 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 201.3MB. Free memory is still 116.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 18:51:32,714 INFO L158 Benchmark]: CACSL2BoogieTranslator took 671.82ms. Allocated memory is still 167.8MB. Free memory was 119.4MB in the beginning and 59.0MB in the end (delta: 60.4MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. [2025-03-17 18:51:32,715 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.20ms. Allocated memory is still 167.8MB. Free memory was 58.3MB in the beginning and 55.3MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 18:51:32,715 INFO L158 Benchmark]: Boogie Preprocessor took 29.04ms. Allocated memory is still 167.8MB. Free memory was 55.3MB in the beginning and 53.9MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 18:51:32,715 INFO L158 Benchmark]: IcfgBuilder took 425.72ms. Allocated memory is still 167.8MB. Free memory was 53.9MB in the beginning and 113.5MB in the end (delta: -59.7MB). Peak memory consumption was 32.0MB. Max. memory is 16.1GB. [2025-03-17 18:51:32,715 INFO L158 Benchmark]: TraceAbstraction took 1269.56ms. Allocated memory is still 167.8MB. Free memory was 112.7MB in the beginning and 72.9MB in the end (delta: 39.8MB). Peak memory consumption was 40.2MB. Max. memory is 16.1GB. [2025-03-17 18:51:32,715 INFO L158 Benchmark]: Witness Printer took 81.64ms. Allocated memory is still 167.8MB. Free memory was 72.9MB in the beginning and 65.4MB in the end (delta: 7.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 18:51:32,716 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.29ms. Allocated memory is still 201.3MB. Free memory is still 116.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 671.82ms. Allocated memory is still 167.8MB. Free memory was 119.4MB in the beginning and 59.0MB in the end (delta: 60.4MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.20ms. Allocated memory is still 167.8MB. Free memory was 58.3MB in the beginning and 55.3MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 29.04ms. Allocated memory is still 167.8MB. Free memory was 55.3MB in the beginning and 53.9MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 425.72ms. Allocated memory is still 167.8MB. Free memory was 53.9MB in the beginning and 113.5MB in the end (delta: -59.7MB). Peak memory consumption was 32.0MB. Max. memory is 16.1GB. * TraceAbstraction took 1269.56ms. Allocated memory is still 167.8MB. Free memory was 112.7MB in the beginning and 72.9MB in the end (delta: 39.8MB). Peak memory consumption was 40.2MB. Max. memory is 16.1GB. * Witness Printer took 81.64ms. Allocated memory is still 167.8MB. Free memory was 72.9MB in the beginning and 65.4MB in the end (delta: 7.4MB). 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: 1634]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1634]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1617]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1617]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1591]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1591]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1567]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1567]: 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 3 procedures, 104 locations, 162 edges, 8 error locations. Started 1 CEGAR loops. OverallTime: 1.2s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 211 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 211 mSDsluCounter, 1844 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 810 mSDsCounter, 12 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 198 IncrementalHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12 mSolverCounterUnsat, 1034 mSDtfsCounter, 198 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=104occurred in iteration=0, InterpolantAutomatonStates: 27, 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, 9 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 254 NumberOfCodeBlocks, 254 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 245 ConstructedInterpolants, 0 QuantifiedInterpolants, 339 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 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-17 18:51:32,734 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE