./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_rand_sub_15_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_sub_15_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 1eee24e655db3a93554521bbdd9ede60ae87c6549a31d3535875d525cd4027a6 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 18:53:43,337 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 18:53:43,395 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-03-17 18:53:43,401 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 18:53:43,402 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 18:53:43,417 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 18:53:43,418 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 18:53:43,419 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 18:53:43,419 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 18:53:43,419 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 18:53:43,420 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 18:53:43,420 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 18:53:43,420 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 18:53:43,420 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 18:53:43,421 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 18:53:43,421 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 18:53:43,421 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 18:53:43,421 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 18:53:43,421 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 18:53:43,421 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 18:53:43,421 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 18:53:43,421 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 18:53:43,421 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-17 18:53:43,422 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 18:53:43,422 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 18:53:43,422 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 18:53:43,422 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 18:53:43,422 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 18:53:43,422 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 18:53:43,422 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 18:53:43,422 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 18:53:43,422 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 18:53:43,423 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 18:53:43,423 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 18:53:43,423 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 18:53:43,423 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 18:53:43,423 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 18:53:43,423 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 18:53:43,423 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 18:53:43,423 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 18:53:43,423 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 18:53:43,423 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 18:53:43,423 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 -> 1eee24e655db3a93554521bbdd9ede60ae87c6549a31d3535875d525cd4027a6 [2025-03-17 18:53:43,685 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 18:53:43,693 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 18:53:43,695 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 18:53:43,696 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 18:53:43,696 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 18:53:43,698 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_sub_15_good.i [2025-03-17 18:53:44,809 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bdcd9a6dd/2ba8451ed40b4912a544d5e103c344e2/FLAG800dcd03b [2025-03-17 18:53:45,176 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 18:53:45,178 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_rand_sub_15_good.i [2025-03-17 18:53:45,201 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bdcd9a6dd/2ba8451ed40b4912a544d5e103c344e2/FLAG800dcd03b [2025-03-17 18:53:45,382 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bdcd9a6dd/2ba8451ed40b4912a544d5e103c344e2 [2025-03-17 18:53:45,383 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 18:53:45,384 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 18:53:45,385 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 18:53:45,385 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 18:53:45,388 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 18:53:45,388 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 06:53:45" (1/1) ... [2025-03-17 18:53:45,389 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@526c2332 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:53:45, skipping insertion in model container [2025-03-17 18:53:45,389 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 06:53:45" (1/1) ... [2025-03-17 18:53:45,422 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 18:53:45,877 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 18:53:45,882 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 18:53:45,963 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 18:53:46,054 INFO L204 MainTranslator]: Completed translation [2025-03-17 18:53:46,055 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:53:46 WrapperNode [2025-03-17 18:53:46,055 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 18:53:46,056 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 18:53:46,056 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 18:53:46,057 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 18:53:46,061 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:53:46" (1/1) ... [2025-03-17 18:53:46,076 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:53:46" (1/1) ... [2025-03-17 18:53:46,098 INFO L138 Inliner]: procedures = 501, calls = 50, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 293 [2025-03-17 18:53:46,099 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 18:53:46,099 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 18:53:46,099 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 18:53:46,100 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 18:53:46,105 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:53:46" (1/1) ... [2025-03-17 18:53:46,105 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:53:46" (1/1) ... [2025-03-17 18:53:46,107 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:53:46" (1/1) ... [2025-03-17 18:53:46,114 INFO L175 MemorySlicer]: No memory access in input program. [2025-03-17 18:53:46,114 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:53:46" (1/1) ... [2025-03-17 18:53:46,114 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:53:46" (1/1) ... [2025-03-17 18:53:46,118 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:53:46" (1/1) ... [2025-03-17 18:53:46,118 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:53:46" (1/1) ... [2025-03-17 18:53:46,119 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:53:46" (1/1) ... [2025-03-17 18:53:46,120 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:53:46" (1/1) ... [2025-03-17 18:53:46,121 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 18:53:46,122 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 18:53:46,122 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 18:53:46,122 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 18:53:46,123 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:53:46" (1/1) ... [2025-03-17 18:53:46,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 18:53:46,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 18:53:46,164 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:53:46,165 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:53:46,180 INFO L130 BoogieDeclarations]: Found specification of procedure printIntLine [2025-03-17 18:53:46,180 INFO L138 BoogieDeclarations]: Found implementation of procedure printIntLine [2025-03-17 18:53:46,181 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2025-03-17 18:53:46,181 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2025-03-17 18:53:46,181 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 18:53:46,182 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 18:53:46,182 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 18:53:46,282 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 18:53:46,283 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 18:53:46,538 INFO L? ?]: Removed 126 outVars from TransFormulas that were not future-live. [2025-03-17 18:53:46,538 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 18:53:46,556 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 18:53:46,557 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 18:53:46,557 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 06:53:46 BoogieIcfgContainer [2025-03-17 18:53:46,557 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 18:53:46,559 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 18:53:46,559 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 18:53:46,562 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 18:53:46,563 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 06:53:45" (1/3) ... [2025-03-17 18:53:46,563 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49e7e6b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 06:53:46, skipping insertion in model container [2025-03-17 18:53:46,563 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:53:46" (2/3) ... [2025-03-17 18:53:46,563 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49e7e6b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 06:53:46, skipping insertion in model container [2025-03-17 18:53:46,563 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 06:53:46" (3/3) ... [2025-03-17 18:53:46,565 INFO L128 eAbstractionObserver]: Analyzing ICFG CWE191_Integer_Underflow__int_rand_sub_15_good.i [2025-03-17 18:53:46,576 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 18:53:46,578 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG CWE191_Integer_Underflow__int_rand_sub_15_good.i that has 3 procedures, 118 locations, 1 initial locations, 0 loop locations, and 8 error locations. [2025-03-17 18:53:46,620 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 18:53:46,631 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;@43e59015, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 18:53:46,632 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-03-17 18:53:46,635 INFO L276 IsEmpty]: Start isEmpty. Operand has 118 states, 91 states have (on average 1.5824175824175823) internal successors, (144), 109 states have internal predecessors, (144), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-17 18:53:46,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-17 18:53:46,641 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 18:53:46,641 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 18:53:46,642 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:53:46,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 18:53:46,646 INFO L85 PathProgramCache]: Analyzing trace with hash -387303851, now seen corresponding path program 1 times [2025-03-17 18:53:46,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 18:53:46,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188818957] [2025-03-17 18:53:46,651 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 18:53:46,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 18:53:46,707 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-17 18:53:46,717 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-17 18:53:46,718 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 18:53:46,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 18:53:46,810 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:53:46,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 18:53:46,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188818957] [2025-03-17 18:53:46,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188818957] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 18:53:46,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 18:53:46,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 18:53:46,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678504419] [2025-03-17 18:53:46,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 18:53:46,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 18:53:46,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 18:53:46,830 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 18:53:46,831 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 18:53:46,832 INFO L87 Difference]: Start difference. First operand has 118 states, 91 states have (on average 1.5824175824175823) internal successors, (144), 109 states have internal predecessors, (144), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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:53:46,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 18:53:46,879 INFO L93 Difference]: Finished difference Result 208 states and 307 transitions. [2025-03-17 18:53:46,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 18:53:46,881 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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 14 [2025-03-17 18:53:46,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 18:53:46,885 INFO L225 Difference]: With dead ends: 208 [2025-03-17 18:53:46,885 INFO L226 Difference]: Without dead ends: 107 [2025-03-17 18:53:46,888 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:53:46,890 INFO L435 NwaCegarLoop]: 162 mSDtfsCounter, 0 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 18:53:46,891 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 321 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 18:53:46,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2025-03-17 18:53:46,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2025-03-17 18:53:46,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 85 states have (on average 1.5647058823529412) internal successors, (133), 100 states have internal predecessors, (133), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 10 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-17 18:53:46,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 157 transitions. [2025-03-17 18:53:46,922 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 157 transitions. Word has length 14 [2025-03-17 18:53:46,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 18:53:46,924 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 157 transitions. [2025-03-17 18:53:46,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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:53:46,924 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 157 transitions. [2025-03-17 18:53:46,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-17 18:53:46,925 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 18:53:46,925 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:53:46,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 18:53:46,926 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:53:46,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 18:53:46,927 INFO L85 PathProgramCache]: Analyzing trace with hash -1081402034, now seen corresponding path program 1 times [2025-03-17 18:53:46,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 18:53:46,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420289258] [2025-03-17 18:53:46,927 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 18:53:46,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 18:53:46,937 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-17 18:53:46,948 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-17 18:53:46,948 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 18:53:46,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 18:53:46,987 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:53:46,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 18:53:46,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420289258] [2025-03-17 18:53:46,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420289258] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 18:53:46,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 18:53:46,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 18:53:46,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695866223] [2025-03-17 18:53:46,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 18:53:46,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 18:53:46,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 18:53:46,988 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 18:53:46,988 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 18:53:46,989 INFO L87 Difference]: Start difference. First operand 107 states and 157 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:53:47,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 18:53:47,013 INFO L93 Difference]: Finished difference Result 107 states and 157 transitions. [2025-03-17 18:53:47,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 18:53:47,014 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:53:47,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 18:53:47,015 INFO L225 Difference]: With dead ends: 107 [2025-03-17 18:53:47,015 INFO L226 Difference]: Without dead ends: 106 [2025-03-17 18:53:47,015 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:53:47,015 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 36 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 254 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:53:47,016 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 254 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 18:53:47,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2025-03-17 18:53:47,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2025-03-17 18:53:47,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 85 states have (on average 1.5529411764705883) internal successors, (132), 99 states have internal predecessors, (132), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 10 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-17 18:53:47,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 156 transitions. [2025-03-17 18:53:47,021 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 156 transitions. Word has length 19 [2025-03-17 18:53:47,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 18:53:47,022 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 156 transitions. [2025-03-17 18:53:47,022 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:53:47,022 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 156 transitions. [2025-03-17 18:53:47,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-17 18:53:47,022 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 18:53:47,022 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] [2025-03-17 18:53:47,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 18:53:47,022 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:53:47,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 18:53:47,023 INFO L85 PathProgramCache]: Analyzing trace with hash 836275416, now seen corresponding path program 1 times [2025-03-17 18:53:47,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 18:53:47,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367609449] [2025-03-17 18:53:47,023 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 18:53:47,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 18:53:47,032 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-17 18:53:47,042 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-17 18:53:47,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 18:53:47,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 18:53:47,202 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:53:47,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 18:53:47,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367609449] [2025-03-17 18:53:47,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367609449] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 18:53:47,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 18:53:47,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 18:53:47,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135420414] [2025-03-17 18:53:47,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 18:53:47,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 18:53:47,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 18:53:47,203 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 18:53:47,203 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 18:53:47,203 INFO L87 Difference]: Start difference. First operand 106 states and 156 transitions. Second operand has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 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:53:47,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 18:53:47,248 INFO L93 Difference]: Finished difference Result 107 states and 157 transitions. [2025-03-17 18:53:47,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 18:53:47,251 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 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 20 [2025-03-17 18:53:47,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 18:53:47,252 INFO L225 Difference]: With dead ends: 107 [2025-03-17 18:53:47,252 INFO L226 Difference]: Without dead ends: 106 [2025-03-17 18:53:47,252 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:53:47,253 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 37 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 18:53:47,253 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 246 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 18:53:47,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2025-03-17 18:53:47,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2025-03-17 18:53:47,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 85 states have (on average 1.5411764705882354) internal successors, (131), 98 states have internal predecessors, (131), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 10 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-17 18:53:47,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 155 transitions. [2025-03-17 18:53:47,259 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 155 transitions. Word has length 20 [2025-03-17 18:53:47,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 18:53:47,259 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 155 transitions. [2025-03-17 18:53:47,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 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:53:47,260 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 155 transitions. [2025-03-17 18:53:47,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-17 18:53:47,260 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 18:53:47,260 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 18:53:47,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 18:53:47,261 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:53:47,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 18:53:47,261 INFO L85 PathProgramCache]: Analyzing trace with hash -1009646402, now seen corresponding path program 1 times [2025-03-17 18:53:47,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 18:53:47,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460569245] [2025-03-17 18:53:47,262 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 18:53:47,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 18:53:47,278 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-17 18:53:47,287 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-17 18:53:47,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 18:53:47,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 18:53:47,330 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:53:47,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 18:53:47,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460569245] [2025-03-17 18:53:47,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460569245] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 18:53:47,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 18:53:47,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 18:53:47,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528360045] [2025-03-17 18:53:47,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 18:53:47,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 18:53:47,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 18:53:47,331 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 18:53:47,332 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 18:53:47,332 INFO L87 Difference]: Start difference. First operand 105 states and 155 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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:53:47,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 18:53:47,375 INFO L93 Difference]: Finished difference Result 174 states and 254 transitions. [2025-03-17 18:53:47,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 18:53:47,375 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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 24 [2025-03-17 18:53:47,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 18:53:47,376 INFO L225 Difference]: With dead ends: 174 [2025-03-17 18:53:47,376 INFO L226 Difference]: Without dead ends: 105 [2025-03-17 18:53:47,377 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:53:47,377 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 0 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 18:53:47,377 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 285 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 18:53:47,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2025-03-17 18:53:47,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2025-03-17 18:53:47,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 85 states have (on average 1.5294117647058822) internal successors, (130), 98 states have internal predecessors, (130), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 10 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-17 18:53:47,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 154 transitions. [2025-03-17 18:53:47,386 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 154 transitions. Word has length 24 [2025-03-17 18:53:47,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 18:53:47,386 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 154 transitions. [2025-03-17 18:53:47,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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:53:47,386 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 154 transitions. [2025-03-17 18:53:47,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-17 18:53:47,387 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 18:53:47,387 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 18:53:47,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 18:53:47,388 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-17 18:53:47,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 18:53:47,388 INFO L85 PathProgramCache]: Analyzing trace with hash -535948696, now seen corresponding path program 1 times [2025-03-17 18:53:47,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 18:53:47,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136137999] [2025-03-17 18:53:47,388 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 18:53:47,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 18:53:47,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-17 18:53:47,402 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-17 18:53:47,402 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 18:53:47,402 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 18:53:47,425 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 18:53:47,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 18:53:47,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136137999] [2025-03-17 18:53:47,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136137999] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 18:53:47,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 18:53:47,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 18:53:47,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240081251] [2025-03-17 18:53:47,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 18:53:47,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 18:53:47,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 18:53:47,427 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 18:53:47,427 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 18:53:47,427 INFO L87 Difference]: Start difference. First operand 105 states and 154 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 18:53:47,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 18:53:47,447 INFO L93 Difference]: Finished difference Result 174 states and 253 transitions. [2025-03-17 18:53:47,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 18:53:47,448 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 28 [2025-03-17 18:53:47,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 18:53:47,448 INFO L225 Difference]: With dead ends: 174 [2025-03-17 18:53:47,448 INFO L226 Difference]: Without dead ends: 104 [2025-03-17 18:53:47,449 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:53:47,449 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 0 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 18:53:47,449 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 280 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 18:53:47,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2025-03-17 18:53:47,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2025-03-17 18:53:47,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 85 states have (on average 1.5176470588235293) internal successors, (129), 97 states have internal predecessors, (129), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-17 18:53:47,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 151 transitions. [2025-03-17 18:53:47,455 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 151 transitions. Word has length 28 [2025-03-17 18:53:47,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 18:53:47,455 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 151 transitions. [2025-03-17 18:53:47,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 18:53:47,456 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 151 transitions. [2025-03-17 18:53:47,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-17 18:53:47,456 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 18:53:47,456 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 18:53:47,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 18:53:47,457 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-17 18:53:47,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 18:53:47,457 INFO L85 PathProgramCache]: Analyzing trace with hash 1119982349, now seen corresponding path program 1 times [2025-03-17 18:53:47,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 18:53:47,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172412724] [2025-03-17 18:53:47,457 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 18:53:47,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 18:53:47,464 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-17 18:53:47,468 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-17 18:53:47,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 18:53:47,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 18:53:47,485 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 18:53:47,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 18:53:47,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172412724] [2025-03-17 18:53:47,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172412724] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 18:53:47,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 18:53:47,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 18:53:47,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506853163] [2025-03-17 18:53:47,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 18:53:47,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 18:53:47,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 18:53:47,486 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 18:53:47,486 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 18:53:47,486 INFO L87 Difference]: Start difference. First operand 104 states and 151 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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:53:47,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 18:53:47,503 INFO L93 Difference]: Finished difference Result 147 states and 208 transitions. [2025-03-17 18:53:47,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 18:53:47,503 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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 30 [2025-03-17 18:53:47,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 18:53:47,504 INFO L225 Difference]: With dead ends: 147 [2025-03-17 18:53:47,504 INFO L226 Difference]: Without dead ends: 102 [2025-03-17 18:53:47,504 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:53:47,505 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 0 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 18:53:47,505 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 271 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 18:53:47,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2025-03-17 18:53:47,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2025-03-17 18:53:47,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 84 states have (on average 1.5) internal successors, (126), 95 states have internal predecessors, (126), 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:53:47,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 146 transitions. [2025-03-17 18:53:47,509 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 146 transitions. Word has length 30 [2025-03-17 18:53:47,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 18:53:47,510 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 146 transitions. [2025-03-17 18:53:47,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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:53:47,510 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 146 transitions. [2025-03-17 18:53:47,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-17 18:53:47,510 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 18:53:47,510 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 18:53:47,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 18:53:47,511 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-17 18:53:47,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 18:53:47,511 INFO L85 PathProgramCache]: Analyzing trace with hash -1636838455, now seen corresponding path program 1 times [2025-03-17 18:53:47,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 18:53:47,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760882328] [2025-03-17 18:53:47,511 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 18:53:47,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 18:53:47,518 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-17 18:53:47,524 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-17 18:53:47,524 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 18:53:47,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 18:53:47,547 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 18:53:47,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 18:53:47,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760882328] [2025-03-17 18:53:47,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760882328] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 18:53:47,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 18:53:47,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 18:53:47,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051277541] [2025-03-17 18:53:47,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 18:53:47,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 18:53:47,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 18:53:47,548 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 18:53:47,548 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 18:53:47,548 INFO L87 Difference]: Start difference. First operand 102 states and 146 transitions. Second operand has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 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:53:47,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 18:53:47,567 INFO L93 Difference]: Finished difference Result 102 states and 146 transitions. [2025-03-17 18:53:47,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 18:53:47,568 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 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 35 [2025-03-17 18:53:47,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 18:53:47,568 INFO L225 Difference]: With dead ends: 102 [2025-03-17 18:53:47,568 INFO L226 Difference]: Without dead ends: 101 [2025-03-17 18:53:47,568 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:53:47,569 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 36 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 232 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:53:47,569 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 232 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 18:53:47,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-03-17 18:53:47,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2025-03-17 18:53:47,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 84 states have (on average 1.4880952380952381) internal successors, (125), 94 states have internal predecessors, (125), 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:53:47,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 145 transitions. [2025-03-17 18:53:47,574 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 145 transitions. Word has length 35 [2025-03-17 18:53:47,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 18:53:47,574 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 145 transitions. [2025-03-17 18:53:47,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 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:53:47,575 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 145 transitions. [2025-03-17 18:53:47,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-17 18:53:47,575 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 18:53:47,575 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 18:53:47,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 18:53:47,575 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-17 18:53:47,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 18:53:47,576 INFO L85 PathProgramCache]: Analyzing trace with hash 797615486, now seen corresponding path program 1 times [2025-03-17 18:53:47,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 18:53:47,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706765159] [2025-03-17 18:53:47,576 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 18:53:47,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 18:53:47,583 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-17 18:53:47,589 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-17 18:53:47,590 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 18:53:47,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 18:53:47,672 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 18:53:47,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 18:53:47,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706765159] [2025-03-17 18:53:47,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706765159] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 18:53:47,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 18:53:47,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 18:53:47,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635883789] [2025-03-17 18:53:47,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 18:53:47,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 18:53:47,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 18:53:47,673 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 18:53:47,673 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 18:53:47,673 INFO L87 Difference]: Start difference. First operand 101 states and 145 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, (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:53:47,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 18:53:47,698 INFO L93 Difference]: Finished difference Result 102 states and 146 transitions. [2025-03-17 18:53:47,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 18:53:47,698 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, (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 36 [2025-03-17 18:53:47,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 18:53:47,698 INFO L225 Difference]: With dead ends: 102 [2025-03-17 18:53:47,699 INFO L226 Difference]: Without dead ends: 101 [2025-03-17 18:53:47,699 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:53:47,699 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 38 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 18:53:47,699 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 224 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 18:53:47,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-03-17 18:53:47,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 100. [2025-03-17 18:53:47,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 84 states have (on average 1.4761904761904763) internal successors, (124), 93 states have internal predecessors, (124), 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:53:47,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 144 transitions. [2025-03-17 18:53:47,704 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 144 transitions. Word has length 36 [2025-03-17 18:53:47,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 18:53:47,704 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 144 transitions. [2025-03-17 18:53:47,704 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, (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:53:47,704 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 144 transitions. [2025-03-17 18:53:47,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-17 18:53:47,705 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 18:53:47,705 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 18:53:47,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 18:53:47,705 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-17 18:53:47,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 18:53:47,705 INFO L85 PathProgramCache]: Analyzing trace with hash 572248879, now seen corresponding path program 1 times [2025-03-17 18:53:47,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 18:53:47,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945843877] [2025-03-17 18:53:47,706 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 18:53:47,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 18:53:47,713 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-17 18:53:47,718 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-17 18:53:47,718 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 18:53:47,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 18:53:47,740 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 18:53:47,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 18:53:47,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945843877] [2025-03-17 18:53:47,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945843877] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 18:53:47,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 18:53:47,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 18:53:47,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754790060] [2025-03-17 18:53:47,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 18:53:47,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 18:53:47,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 18:53:47,741 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 18:53:47,741 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 18:53:47,741 INFO L87 Difference]: Start difference. First operand 100 states and 144 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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:53:47,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 18:53:47,758 INFO L93 Difference]: Finished difference Result 131 states and 183 transitions. [2025-03-17 18:53:47,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 18:53:47,759 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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 40 [2025-03-17 18:53:47,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 18:53:47,759 INFO L225 Difference]: With dead ends: 131 [2025-03-17 18:53:47,759 INFO L226 Difference]: Without dead ends: 98 [2025-03-17 18:53:47,760 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:53:47,760 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 0 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 18:53:47,760 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 257 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 18:53:47,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-03-17 18:53:47,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2025-03-17 18:53:47,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 83 states have (on average 1.4578313253012047) internal successors, (121), 91 states have internal predecessors, (121), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-17 18:53:47,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 139 transitions. [2025-03-17 18:53:47,764 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 139 transitions. Word has length 40 [2025-03-17 18:53:47,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 18:53:47,764 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 139 transitions. [2025-03-17 18:53:47,765 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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:53:47,765 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 139 transitions. [2025-03-17 18:53:47,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-17 18:53:47,765 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 18:53:47,765 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:47,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 18:53:47,766 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-17 18:53:47,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 18:53:47,766 INFO L85 PathProgramCache]: Analyzing trace with hash -1013337524, now seen corresponding path program 1 times [2025-03-17 18:53:47,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 18:53:47,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691341724] [2025-03-17 18:53:47,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 18:53:47,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 18:53:47,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-17 18:53:47,781 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-17 18:53:47,781 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 18:53:47,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 18:53:47,822 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-17 18:53:47,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 18:53:47,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691341724] [2025-03-17 18:53:47,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691341724] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 18:53:47,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 18:53:47,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 18:53:47,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752250372] [2025-03-17 18:53:47,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 18:53:47,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 18:53:47,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 18:53:47,823 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 18:53:47,823 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 18:53:47,823 INFO L87 Difference]: Start difference. First operand 98 states and 139 transitions. Second operand has 3 states, 2 states have (on average 16.5) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-17 18:53:47,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 18:53:47,843 INFO L93 Difference]: Finished difference Result 99 states and 140 transitions. [2025-03-17 18:53:47,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 18:53:47,843 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 16.5) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 45 [2025-03-17 18:53:47,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 18:53:47,844 INFO L225 Difference]: With dead ends: 99 [2025-03-17 18:53:47,844 INFO L226 Difference]: Without dead ends: 98 [2025-03-17 18:53:47,844 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:53:47,844 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 7 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 241 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:53:47,844 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 241 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 18:53:47,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-03-17 18:53:47,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2025-03-17 18:53:47,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 83 states have (on average 1.4457831325301205) internal successors, (120), 90 states have internal predecessors, (120), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-17 18:53:47,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 138 transitions. [2025-03-17 18:53:47,849 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 138 transitions. Word has length 45 [2025-03-17 18:53:47,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 18:53:47,849 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 138 transitions. [2025-03-17 18:53:47,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 16.5) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-17 18:53:47,849 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 138 transitions. [2025-03-17 18:53:47,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-17 18:53:47,850 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 18:53:47,850 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:47,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 18:53:47,850 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-17 18:53:47,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 18:53:47,850 INFO L85 PathProgramCache]: Analyzing trace with hash -1348692159, now seen corresponding path program 1 times [2025-03-17 18:53:47,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 18:53:47,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563045118] [2025-03-17 18:53:47,851 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 18:53:47,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 18:53:47,859 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-17 18:53:47,865 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-17 18:53:47,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 18:53:47,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 18:53:47,903 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-17 18:53:47,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 18:53:47,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563045118] [2025-03-17 18:53:47,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563045118] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 18:53:47,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 18:53:47,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 18:53:47,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778205033] [2025-03-17 18:53:47,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 18:53:47,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 18:53:47,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 18:53:47,904 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 18:53:47,905 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 18:53:47,905 INFO L87 Difference]: Start difference. First operand 97 states and 138 transitions. Second operand has 3 states, 2 states have (on average 17.0) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-17 18:53:47,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 18:53:47,931 INFO L93 Difference]: Finished difference Result 105 states and 149 transitions. [2025-03-17 18:53:47,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 18:53:47,932 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 17.0) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 46 [2025-03-17 18:53:47,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 18:53:47,933 INFO L225 Difference]: With dead ends: 105 [2025-03-17 18:53:47,933 INFO L226 Difference]: Without dead ends: 104 [2025-03-17 18:53:47,933 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:53:47,934 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 3 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 18:53:47,934 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 253 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 18:53:47,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2025-03-17 18:53:47,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 101. [2025-03-17 18:53:47,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 87 states have (on average 1.4367816091954022) internal successors, (125), 94 states have internal predecessors, (125), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-17 18:53:47,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 143 transitions. [2025-03-17 18:53:47,940 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 143 transitions. Word has length 46 [2025-03-17 18:53:47,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 18:53:47,941 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 143 transitions. [2025-03-17 18:53:47,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 17.0) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-17 18:53:47,941 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 143 transitions. [2025-03-17 18:53:47,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-17 18:53:47,942 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 18:53:47,942 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:47,942 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 18:53:47,943 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-17 18:53:47,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 18:53:47,943 INFO L85 PathProgramCache]: Analyzing trace with hash -1347768638, now seen corresponding path program 1 times [2025-03-17 18:53:47,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 18:53:47,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648495936] [2025-03-17 18:53:47,943 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 18:53:47,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 18:53:47,953 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-17 18:53:47,959 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-17 18:53:47,960 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 18:53:47,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 18:53:47,983 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-17 18:53:47,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 18:53:47,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648495936] [2025-03-17 18:53:47,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648495936] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 18:53:47,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 18:53:47,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 18:53:47,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621748225] [2025-03-17 18:53:47,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 18:53:47,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 18:53:47,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 18:53:47,984 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 18:53:47,984 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 18:53:47,984 INFO L87 Difference]: Start difference. First operand 101 states and 143 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-17 18:53:48,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 18:53:48,004 INFO L93 Difference]: Finished difference Result 127 states and 174 transitions. [2025-03-17 18:53:48,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 18:53:48,004 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 46 [2025-03-17 18:53:48,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 18:53:48,005 INFO L225 Difference]: With dead ends: 127 [2025-03-17 18:53:48,005 INFO L226 Difference]: Without dead ends: 101 [2025-03-17 18:53:48,005 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:53:48,005 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 0 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 18:53:48,006 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 251 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 18:53:48,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-03-17 18:53:48,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2025-03-17 18:53:48,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 87 states have (on average 1.4252873563218391) internal successors, (124), 93 states have internal predecessors, (124), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-17 18:53:48,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 142 transitions. [2025-03-17 18:53:48,011 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 142 transitions. Word has length 46 [2025-03-17 18:53:48,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 18:53:48,011 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 142 transitions. [2025-03-17 18:53:48,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-17 18:53:48,011 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 142 transitions. [2025-03-17 18:53:48,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-17 18:53:48,012 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 18:53:48,012 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:48,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 18:53:48,012 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-17 18:53:48,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 18:53:48,012 INFO L85 PathProgramCache]: Analyzing trace with hash 679193875, now seen corresponding path program 1 times [2025-03-17 18:53:48,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 18:53:48,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321747838] [2025-03-17 18:53:48,013 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 18:53:48,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 18:53:48,020 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-17 18:53:48,043 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-17 18:53:48,044 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 18:53:48,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 18:53:48,071 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-17 18:53:48,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 18:53:48,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321747838] [2025-03-17 18:53:48,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321747838] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 18:53:48,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 18:53:48,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 18:53:48,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478881334] [2025-03-17 18:53:48,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 18:53:48,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 18:53:48,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 18:53:48,073 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 18:53:48,073 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 18:53:48,073 INFO L87 Difference]: Start difference. First operand 101 states and 142 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-17 18:53:48,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 18:53:48,093 INFO L93 Difference]: Finished difference Result 122 states and 167 transitions. [2025-03-17 18:53:48,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 18:53:48,095 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 50 [2025-03-17 18:53:48,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 18:53:48,096 INFO L225 Difference]: With dead ends: 122 [2025-03-17 18:53:48,096 INFO L226 Difference]: Without dead ends: 95 [2025-03-17 18:53:48,096 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:53:48,097 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 0 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 18:53:48,097 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 244 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 18:53:48,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2025-03-17 18:53:48,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2025-03-17 18:53:48,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 83 states have (on average 1.4096385542168675) internal successors, (117), 88 states have internal predecessors, (117), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-17 18:53:48,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 133 transitions. [2025-03-17 18:53:48,101 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 133 transitions. Word has length 50 [2025-03-17 18:53:48,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 18:53:48,101 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 133 transitions. [2025-03-17 18:53:48,101 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-17 18:53:48,102 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 133 transitions. [2025-03-17 18:53:48,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-17 18:53:48,102 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 18:53:48,102 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:48,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 18:53:48,103 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-17 18:53:48,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 18:53:48,103 INFO L85 PathProgramCache]: Analyzing trace with hash 845750808, now seen corresponding path program 1 times [2025-03-17 18:53:48,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 18:53:48,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289386520] [2025-03-17 18:53:48,103 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 18:53:48,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 18:53:48,110 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-17 18:53:48,115 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-17 18:53:48,115 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 18:53:48,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 18:53:48,136 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-17 18:53:48,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 18:53:48,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289386520] [2025-03-17 18:53:48,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289386520] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 18:53:48,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 18:53:48,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 18:53:48,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28681959] [2025-03-17 18:53:48,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 18:53:48,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 18:53:48,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 18:53:48,137 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 18:53:48,137 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 18:53:48,137 INFO L87 Difference]: Start difference. First operand 95 states and 133 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-17 18:53:48,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 18:53:48,155 INFO L93 Difference]: Finished difference Result 109 states and 149 transitions. [2025-03-17 18:53:48,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 18:53:48,156 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 50 [2025-03-17 18:53:48,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 18:53:48,156 INFO L225 Difference]: With dead ends: 109 [2025-03-17 18:53:48,156 INFO L226 Difference]: Without dead ends: 93 [2025-03-17 18:53:48,157 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:53:48,157 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 0 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 18:53:48,157 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 235 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 18:53:48,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2025-03-17 18:53:48,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2025-03-17 18:53:48,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 82 states have (on average 1.3902439024390243) internal successors, (114), 86 states have internal predecessors, (114), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-17 18:53:48,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 128 transitions. [2025-03-17 18:53:48,161 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 128 transitions. Word has length 50 [2025-03-17 18:53:48,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 18:53:48,161 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 128 transitions. [2025-03-17 18:53:48,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-17 18:53:48,161 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 128 transitions. [2025-03-17 18:53:48,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-17 18:53:48,162 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 18:53:48,162 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:48,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 18:53:48,162 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-17 18:53:48,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 18:53:48,163 INFO L85 PathProgramCache]: Analyzing trace with hash -1718220175, now seen corresponding path program 1 times [2025-03-17 18:53:48,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 18:53:48,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758409691] [2025-03-17 18:53:48,163 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 18:53:48,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 18:53:48,170 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-17 18:53:48,175 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-17 18:53:48,175 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 18:53:48,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 18:53:48,203 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-17 18:53:48,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 18:53:48,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758409691] [2025-03-17 18:53:48,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [758409691] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 18:53:48,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 18:53:48,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 18:53:48,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516716502] [2025-03-17 18:53:48,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 18:53:48,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 18:53:48,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 18:53:48,204 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 18:53:48,204 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 18:53:48,204 INFO L87 Difference]: Start difference. First operand 93 states and 128 transitions. Second operand has 3 states, 2 states have (on average 21.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-17 18:53:48,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 18:53:48,218 INFO L93 Difference]: Finished difference Result 93 states and 128 transitions. [2025-03-17 18:53:48,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 18:53:48,218 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 21.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 56 [2025-03-17 18:53:48,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 18:53:48,219 INFO L225 Difference]: With dead ends: 93 [2025-03-17 18:53:48,219 INFO L226 Difference]: Without dead ends: 92 [2025-03-17 18:53:48,219 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:53:48,219 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 4 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 18:53:48,219 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 226 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 18:53:48,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2025-03-17 18:53:48,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2025-03-17 18:53:48,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 82 states have (on average 1.3780487804878048) internal successors, (113), 85 states have internal predecessors, (113), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-17 18:53:48,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 127 transitions. [2025-03-17 18:53:48,223 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 127 transitions. Word has length 56 [2025-03-17 18:53:48,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 18:53:48,223 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 127 transitions. [2025-03-17 18:53:48,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 21.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-17 18:53:48,223 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 127 transitions. [2025-03-17 18:53:48,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-17 18:53:48,224 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 18:53:48,224 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:48,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 18:53:48,224 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-17 18:53:48,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 18:53:48,225 INFO L85 PathProgramCache]: Analyzing trace with hash -1725217886, now seen corresponding path program 1 times [2025-03-17 18:53:48,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 18:53:48,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028012034] [2025-03-17 18:53:48,225 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 18:53:48,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 18:53:48,232 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-17 18:53:48,236 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-17 18:53:48,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 18:53:48,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 18:53:48,269 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-17 18:53:48,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 18:53:48,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028012034] [2025-03-17 18:53:48,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028012034] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 18:53:48,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 18:53:48,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 18:53:48,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240209360] [2025-03-17 18:53:48,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 18:53:48,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 18:53:48,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 18:53:48,270 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 18:53:48,270 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 18:53:48,271 INFO L87 Difference]: Start difference. First operand 92 states and 127 transitions. Second operand has 3 states, 2 states have (on average 21.5) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-17 18:53:48,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 18:53:48,290 INFO L93 Difference]: Finished difference Result 97 states and 131 transitions. [2025-03-17 18:53:48,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 18:53:48,291 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 21.5) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 57 [2025-03-17 18:53:48,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 18:53:48,291 INFO L225 Difference]: With dead ends: 97 [2025-03-17 18:53:48,291 INFO L226 Difference]: Without dead ends: 92 [2025-03-17 18:53:48,292 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:53:48,292 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 0 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 18:53:48,292 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 233 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 18:53:48,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2025-03-17 18:53:48,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2025-03-17 18:53:48,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 82 states have (on average 1.3658536585365855) internal successors, (112), 85 states have internal predecessors, (112), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-17 18:53:48,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 126 transitions. [2025-03-17 18:53:48,298 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 126 transitions. Word has length 57 [2025-03-17 18:53:48,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 18:53:48,298 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 126 transitions. [2025-03-17 18:53:48,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 21.5) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-17 18:53:48,299 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 126 transitions. [2025-03-17 18:53:48,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-17 18:53:48,300 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 18:53:48,300 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:48,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-17 18:53:48,300 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-17 18:53:48,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 18:53:48,301 INFO L85 PathProgramCache]: Analyzing trace with hash -1881103184, now seen corresponding path program 1 times [2025-03-17 18:53:48,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 18:53:48,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905845283] [2025-03-17 18:53:48,301 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 18:53:48,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 18:53:48,308 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-17 18:53:48,313 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-17 18:53:48,313 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 18:53:48,313 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 18:53:48,339 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-17 18:53:48,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 18:53:48,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905845283] [2025-03-17 18:53:48,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905845283] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 18:53:48,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 18:53:48,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 18:53:48,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841537871] [2025-03-17 18:53:48,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 18:53:48,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 18:53:48,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 18:53:48,340 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 18:53:48,341 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 18:53:48,341 INFO L87 Difference]: Start difference. First operand 92 states and 126 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-17 18:53:48,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 18:53:48,356 INFO L93 Difference]: Finished difference Result 96 states and 130 transitions. [2025-03-17 18:53:48,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 18:53:48,357 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 58 [2025-03-17 18:53:48,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 18:53:48,358 INFO L225 Difference]: With dead ends: 96 [2025-03-17 18:53:48,358 INFO L226 Difference]: Without dead ends: 0 [2025-03-17 18:53:48,358 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:53:48,358 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 0 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 18:53:48,359 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 217 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 18:53:48,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-17 18:53:48,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-17 18:53:48,359 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:53:48,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-17 18:53:48,359 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 58 [2025-03-17 18:53:48,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 18:53:48,359 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-17 18:53:48,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-17 18:53:48,359 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-17 18:53:48,360 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-17 18:53:48,362 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2025-03-17 18:53:48,362 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2025-03-17 18:53:48,362 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2025-03-17 18:53:48,362 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2025-03-17 18:53:48,362 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2025-03-17 18:53:48,363 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2025-03-17 18:53:48,363 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2025-03-17 18:53:48,363 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2025-03-17 18:53:48,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-17 18:53:48,365 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 18:53:48,368 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-17 18:53:48,394 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 18:53:48,398 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 06:53:48 BoogieIcfgContainer [2025-03-17 18:53:48,398 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 18:53:48,399 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 18:53:48,399 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 18:53:48,399 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 18:53:48,400 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 06:53:46" (3/4) ... [2025-03-17 18:53:48,401 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-17 18:53:48,411 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure printLine [2025-03-17 18:53:48,411 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure printIntLine [2025-03-17 18:53:48,416 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2025-03-17 18:53:48,416 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2025-03-17 18:53:48,417 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-17 18:53:48,417 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-17 18:53:48,417 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-17 18:53:48,511 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-17 18:53:48,512 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-17 18:53:48,512 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 18:53:48,514 INFO L158 Benchmark]: Toolchain (without parser) took 3128.26ms. Allocated memory is still 142.6MB. Free memory was 101.6MB in the beginning and 104.4MB in the end (delta: -2.9MB). Peak memory consumption was 78.8MB. Max. memory is 16.1GB. [2025-03-17 18:53:48,514 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 201.3MB. Free memory is still 119.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 18:53:48,514 INFO L158 Benchmark]: CACSL2BoogieTranslator took 670.46ms. Allocated memory is still 142.6MB. Free memory was 101.6MB in the beginning and 39.6MB in the end (delta: 61.9MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. [2025-03-17 18:53:48,515 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.75ms. Allocated memory is still 142.6MB. Free memory was 39.6MB in the beginning and 36.5MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 18:53:48,515 INFO L158 Benchmark]: Boogie Preprocessor took 22.13ms. Allocated memory is still 142.6MB. Free memory was 36.5MB in the beginning and 34.7MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 18:53:48,516 INFO L158 Benchmark]: IcfgBuilder took 435.35ms. Allocated memory is still 142.6MB. Free memory was 34.7MB in the beginning and 77.5MB in the end (delta: -42.9MB). Peak memory consumption was 13.4MB. Max. memory is 16.1GB. [2025-03-17 18:53:48,516 INFO L158 Benchmark]: TraceAbstraction took 1839.72ms. Allocated memory is still 142.6MB. Free memory was 77.5MB in the beginning and 36.8MB in the end (delta: 40.7MB). Peak memory consumption was 40.2MB. Max. memory is 16.1GB. [2025-03-17 18:53:48,516 INFO L158 Benchmark]: Witness Printer took 113.06ms. Allocated memory is still 142.6MB. Free memory was 36.8MB in the beginning and 104.4MB in the end (delta: -67.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 18:53:48,517 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.28ms. Allocated memory is still 201.3MB. Free memory is still 119.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 670.46ms. Allocated memory is still 142.6MB. Free memory was 101.6MB in the beginning and 39.6MB in the end (delta: 61.9MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.75ms. Allocated memory is still 142.6MB. Free memory was 39.6MB in the beginning and 36.5MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 22.13ms. Allocated memory is still 142.6MB. Free memory was 36.5MB in the beginning and 34.7MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 435.35ms. Allocated memory is still 142.6MB. Free memory was 34.7MB in the beginning and 77.5MB in the end (delta: -42.9MB). Peak memory consumption was 13.4MB. Max. memory is 16.1GB. * TraceAbstraction took 1839.72ms. Allocated memory is still 142.6MB. Free memory was 77.5MB in the beginning and 36.8MB in the end (delta: 40.7MB). Peak memory consumption was 40.2MB. Max. memory is 16.1GB. * Witness Printer took 113.06ms. Allocated memory is still 142.6MB. Free memory was 36.8MB in the beginning and 104.4MB in the end (delta: -67.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 1653]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1653]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1627]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1627]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1597]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1597]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1569]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1569]: 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, 118 locations, 192 edges, 8 error locations. Started 1 CEGAR loops. OverallTime: 1.8s, OverallIterations: 17, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 167 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 161 mSDsluCounter, 4270 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2029 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 344 IncrementalHoareTripleChecker+Invalid, 350 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 2241 mSDtfsCounter, 344 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 43 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=118occurred in iteration=0, InterpolantAutomatonStates: 51, 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, 17 MinimizatonAttempts, 6 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 654 NumberOfCodeBlocks, 654 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 637 ConstructedInterpolants, 0 QuantifiedInterpolants, 725 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 PerfectInterpolantSequences, 128/128 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:53:48,533 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE