./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_rand_predec_08_good.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_rand_predec_08_good.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 6e8bfcc3a67be4044ef797cd4040a11ac0a5b17debac9dd5344f9777da9bda4b --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 14:36:49,882 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 14:36:49,942 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-03-04 14:36:49,949 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 14:36:49,949 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 14:36:49,972 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 14:36:49,973 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 14:36:49,973 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 14:36:49,974 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 14:36:49,974 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 14:36:49,975 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 14:36:49,975 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 14:36:49,975 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 14:36:49,975 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 14:36:49,975 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 14:36:49,975 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 14:36:49,975 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 14:36:49,975 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 14:36:49,976 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 14:36:49,976 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 14:36:49,976 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 14:36:49,976 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 14:36:49,976 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 14:36:49,976 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 14:36:49,976 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 14:36:49,976 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 14:36:49,976 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 14:36:49,976 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 14:36:49,977 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 14:36:49,977 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 14:36:49,977 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 14:36:49,977 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 14:36:49,977 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 14:36:49,977 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 14:36:49,978 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 14:36:49,978 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 14:36:49,978 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 14:36:49,978 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 14:36:49,978 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 14:36:49,978 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 14:36:49,978 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 14:36:49,978 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 14:36:49,978 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 -> 6e8bfcc3a67be4044ef797cd4040a11ac0a5b17debac9dd5344f9777da9bda4b [2025-03-04 14:36:50,256 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 14:36:50,262 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 14:36:50,265 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 14:36:50,266 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 14:36:50,266 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 14:36:50,268 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_predec_08_good.i [2025-03-04 14:36:51,364 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/423a1d3e2/c29fe392d27547aa97f1f93385f97cef/FLAG862e241c6 [2025-03-04 14:36:51,730 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 14:36:51,730 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_rand_predec_08_good.i [2025-03-04 14:36:51,746 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/423a1d3e2/c29fe392d27547aa97f1f93385f97cef/FLAG862e241c6 [2025-03-04 14:36:51,939 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/423a1d3e2/c29fe392d27547aa97f1f93385f97cef [2025-03-04 14:36:51,942 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 14:36:51,943 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 14:36:51,944 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 14:36:51,944 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 14:36:51,947 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 14:36:51,948 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:36:51" (1/1) ... [2025-03-04 14:36:51,950 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@cf098e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:36:51, skipping insertion in model container [2025-03-04 14:36:51,950 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:36:51" (1/1) ... [2025-03-04 14:36:51,995 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 14:36:52,468 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 14:36:52,476 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 14:36:52,555 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 14:36:52,624 INFO L204 MainTranslator]: Completed translation [2025-03-04 14:36:52,625 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:36:52 WrapperNode [2025-03-04 14:36:52,625 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 14:36:52,626 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 14:36:52,626 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 14:36:52,626 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 14:36:52,630 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:36:52" (1/1) ... [2025-03-04 14:36:52,644 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:36:52" (1/1) ... [2025-03-04 14:36:52,663 INFO L138 Inliner]: procedures = 503, calls = 46, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 237 [2025-03-04 14:36:52,664 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 14:36:52,665 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 14:36:52,665 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 14:36:52,665 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 14:36:52,672 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:36:52" (1/1) ... [2025-03-04 14:36:52,673 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:36:52" (1/1) ... [2025-03-04 14:36:52,676 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:36:52" (1/1) ... [2025-03-04 14:36:52,690 INFO L175 MemorySlicer]: No memory access in input program. [2025-03-04 14:36:52,690 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:36:52" (1/1) ... [2025-03-04 14:36:52,691 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:36:52" (1/1) ... [2025-03-04 14:36:52,695 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:36:52" (1/1) ... [2025-03-04 14:36:52,697 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:36:52" (1/1) ... [2025-03-04 14:36:52,698 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:36:52" (1/1) ... [2025-03-04 14:36:52,699 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:36:52" (1/1) ... [2025-03-04 14:36:52,700 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 14:36:52,701 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 14:36:52,701 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 14:36:52,701 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 14:36:52,702 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:36:52" (1/1) ... [2025-03-04 14:36:52,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 14:36:52,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:36:52,732 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 14:36:52,735 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 14:36:52,770 INFO L130 BoogieDeclarations]: Found specification of procedure printIntLine [2025-03-04 14:36:52,770 INFO L138 BoogieDeclarations]: Found implementation of procedure printIntLine [2025-03-04 14:36:52,771 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2025-03-04 14:36:52,771 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2025-03-04 14:36:52,771 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 14:36:52,771 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 14:36:52,771 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 14:36:52,771 INFO L130 BoogieDeclarations]: Found specification of procedure staticReturnsTrue [2025-03-04 14:36:52,771 INFO L138 BoogieDeclarations]: Found implementation of procedure staticReturnsTrue [2025-03-04 14:36:52,771 INFO L130 BoogieDeclarations]: Found specification of procedure staticReturnsFalse [2025-03-04 14:36:52,771 INFO L138 BoogieDeclarations]: Found implementation of procedure staticReturnsFalse [2025-03-04 14:36:52,872 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 14:36:52,874 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 14:36:53,227 INFO L? ?]: Removed 100 outVars from TransFormulas that were not future-live. [2025-03-04 14:36:53,227 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 14:36:53,249 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 14:36:53,250 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 14:36:53,250 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:36:53 BoogieIcfgContainer [2025-03-04 14:36:53,250 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 14:36:53,252 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 14:36:53,252 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 14:36:53,256 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 14:36:53,256 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 02:36:51" (1/3) ... [2025-03-04 14:36:53,257 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44dbe734 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:36:53, skipping insertion in model container [2025-03-04 14:36:53,257 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:36:52" (2/3) ... [2025-03-04 14:36:53,258 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44dbe734 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:36:53, skipping insertion in model container [2025-03-04 14:36:53,258 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:36:53" (3/3) ... [2025-03-04 14:36:53,259 INFO L128 eAbstractionObserver]: Analyzing ICFG CWE191_Integer_Underflow__int_rand_predec_08_good.i [2025-03-04 14:36:53,270 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 14:36:53,271 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG CWE191_Integer_Underflow__int_rand_predec_08_good.i that has 5 procedures, 125 locations, 1 initial locations, 0 loop locations, and 8 error locations. [2025-03-04 14:36:53,313 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 14:36:53,322 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;@17e8559a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 14:36:53,323 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-03-04 14:36:53,327 INFO L276 IsEmpty]: Start isEmpty. Operand has 125 states, 94 states have (on average 1.4787234042553192) internal successors, (139), 106 states have internal predecessors, (139), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-04 14:36:53,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-04 14:36:53,333 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:36:53,333 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:36:53,334 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 14:36:53,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:36:53,338 INFO L85 PathProgramCache]: Analyzing trace with hash -1868042705, now seen corresponding path program 1 times [2025-03-04 14:36:53,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:36:53,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319783023] [2025-03-04 14:36:53,343 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:36:53,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:36:53,406 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 14:36:53,425 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 14:36:53,426 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:36:53,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:36:53,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 14:36:53,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:36:53,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319783023] [2025-03-04 14:36:53,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319783023] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:36:53,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:36:53,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 14:36:53,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398093426] [2025-03-04 14:36:53,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:36:53,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 14:36:53,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:36:53,595 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 14:36:53,596 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 14:36:53,597 INFO L87 Difference]: Start difference. First operand has 125 states, 94 states have (on average 1.4787234042553192) internal successors, (139), 106 states have internal predecessors, (139), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 14:36:53,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:36:53,651 INFO L93 Difference]: Finished difference Result 221 states and 305 transitions. [2025-03-04 14:36:53,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 14:36:53,653 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2025-03-04 14:36:53,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:36:53,657 INFO L225 Difference]: With dead ends: 221 [2025-03-04 14:36:53,658 INFO L226 Difference]: Without dead ends: 116 [2025-03-04 14:36:53,661 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 14:36:53,663 INFO L435 NwaCegarLoop]: 164 mSDtfsCounter, 0 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 487 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 14:36:53,663 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 487 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 14:36:53,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2025-03-04 14:36:53,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2025-03-04 14:36:53,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 88 states have (on average 1.4772727272727273) internal successors, (130), 99 states have internal predecessors, (130), 16 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-04 14:36:53,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 162 transitions. [2025-03-04 14:36:53,695 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 162 transitions. Word has length 22 [2025-03-04 14:36:53,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:36:53,697 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 162 transitions. [2025-03-04 14:36:53,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 14:36:53,697 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 162 transitions. [2025-03-04 14:36:53,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-04 14:36:53,698 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:36:53,698 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:36:53,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 14:36:53,699 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 14:36:53,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:36:53,700 INFO L85 PathProgramCache]: Analyzing trace with hash -1896149859, now seen corresponding path program 1 times [2025-03-04 14:36:53,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:36:53,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901144008] [2025-03-04 14:36:53,700 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:36:53,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:36:53,723 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-04 14:36:53,738 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 14:36:53,738 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:36:53,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:36:53,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 14:36:53,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:36:53,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901144008] [2025-03-04 14:36:53,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901144008] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:36:53,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:36:53,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 14:36:53,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232479611] [2025-03-04 14:36:53,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:36:53,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:36:53,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:36:53,786 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:36:53,786 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:36:53,786 INFO L87 Difference]: Start difference. First operand 116 states and 162 transitions. Second operand has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 14:36:53,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:36:53,825 INFO L93 Difference]: Finished difference Result 116 states and 162 transitions. [2025-03-04 14:36:53,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:36:53,826 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 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 28 [2025-03-04 14:36:53,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:36:53,827 INFO L225 Difference]: With dead ends: 116 [2025-03-04 14:36:53,828 INFO L226 Difference]: Without dead ends: 115 [2025-03-04 14:36:53,829 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:36:53,829 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 37 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 262 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-04 14:36:53,830 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 262 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 14:36:53,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2025-03-04 14:36:53,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2025-03-04 14:36:53,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 88 states have (on average 1.4659090909090908) internal successors, (129), 98 states have internal predecessors, (129), 16 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-04 14:36:53,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 161 transitions. [2025-03-04 14:36:53,841 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 161 transitions. Word has length 28 [2025-03-04 14:36:53,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:36:53,841 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 161 transitions. [2025-03-04 14:36:53,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 14:36:53,841 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 161 transitions. [2025-03-04 14:36:53,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-04 14:36:53,842 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:36:53,842 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:36:53,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 14:36:53,842 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-04 14:36:53,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:36:53,843 INFO L85 PathProgramCache]: Analyzing trace with hash 1348896591, now seen corresponding path program 1 times [2025-03-04 14:36:53,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:36:53,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754316724] [2025-03-04 14:36:53,843 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:36:53,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:36:53,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-04 14:36:53,863 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-04 14:36:53,863 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:36:53,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:36:53,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 14:36:53,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:36:53,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754316724] [2025-03-04 14:36:53,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754316724] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:36:53,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:36:53,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 14:36:53,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890611276] [2025-03-04 14:36:53,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:36:53,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:36:53,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:36:53,972 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:36:53,972 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:36:53,972 INFO L87 Difference]: Start difference. First operand 115 states and 161 transitions. Second operand has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 14:36:54,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:36:54,008 INFO L93 Difference]: Finished difference Result 116 states and 162 transitions. [2025-03-04 14:36:54,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:36:54,010 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 29 [2025-03-04 14:36:54,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:36:54,011 INFO L225 Difference]: With dead ends: 116 [2025-03-04 14:36:54,011 INFO L226 Difference]: Without dead ends: 115 [2025-03-04 14:36:54,012 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:36:54,012 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 37 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 256 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-04 14:36:54,012 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 256 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 14:36:54,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2025-03-04 14:36:54,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 114. [2025-03-04 14:36:54,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 88 states have (on average 1.4545454545454546) internal successors, (128), 97 states have internal predecessors, (128), 16 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-04 14:36:54,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 160 transitions. [2025-03-04 14:36:54,022 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 160 transitions. Word has length 29 [2025-03-04 14:36:54,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:36:54,022 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 160 transitions. [2025-03-04 14:36:54,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 14:36:54,022 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 160 transitions. [2025-03-04 14:36:54,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-04 14:36:54,023 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:36:54,023 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:36:54,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 14:36:54,025 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 14:36:54,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:36:54,025 INFO L85 PathProgramCache]: Analyzing trace with hash 88107485, now seen corresponding path program 1 times [2025-03-04 14:36:54,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:36:54,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754508302] [2025-03-04 14:36:54,025 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:36:54,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:36:54,041 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-04 14:36:54,048 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-04 14:36:54,049 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:36:54,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:36:54,124 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-04 14:36:54,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:36:54,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754508302] [2025-03-04 14:36:54,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754508302] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:36:54,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:36:54,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 14:36:54,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296086792] [2025-03-04 14:36:54,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:36:54,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 14:36:54,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:36:54,126 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 14:36:54,126 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 14:36:54,127 INFO L87 Difference]: Start difference. First operand 114 states and 160 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-04 14:36:54,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:36:54,166 INFO L93 Difference]: Finished difference Result 189 states and 260 transitions. [2025-03-04 14:36:54,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 14:36:54,168 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 46 [2025-03-04 14:36:54,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:36:54,169 INFO L225 Difference]: With dead ends: 189 [2025-03-04 14:36:54,170 INFO L226 Difference]: Without dead ends: 113 [2025-03-04 14:36:54,171 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 14:36:54,172 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 0 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 14:36:54,172 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 436 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 14:36:54,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2025-03-04 14:36:54,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2025-03-04 14:36:54,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 88 states have (on average 1.4431818181818181) internal successors, (127), 96 states have internal predecessors, (127), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-04 14:36:54,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 157 transitions. [2025-03-04 14:36:54,185 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 157 transitions. Word has length 46 [2025-03-04 14:36:54,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:36:54,185 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 157 transitions. [2025-03-04 14:36:54,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-04 14:36:54,186 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 157 transitions. [2025-03-04 14:36:54,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-04 14:36:54,187 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:36:54,188 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:36:54,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 14:36:54,189 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 14:36:54,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:36:54,190 INFO L85 PathProgramCache]: Analyzing trace with hash -1768619983, now seen corresponding path program 1 times [2025-03-04 14:36:54,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:36:54,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837833203] [2025-03-04 14:36:54,190 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:36:54,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:36:54,200 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-04 14:36:54,208 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-04 14:36:54,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:36:54,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:36:54,267 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-04 14:36:54,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:36:54,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837833203] [2025-03-04 14:36:54,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837833203] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:36:54,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1684869299] [2025-03-04 14:36:54,268 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:36:54,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:36:54,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:36:54,273 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 14:36:54,274 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 14:36:54,327 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-04 14:36:54,350 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-04 14:36:54,351 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:36:54,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:36:54,352 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 14:36:54,355 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:36:54,393 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-04 14:36:54,393 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 14:36:54,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1684869299] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:36:54,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 14:36:54,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-03-04 14:36:54,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014305023] [2025-03-04 14:36:54,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:36:54,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:36:54,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:36:54,395 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:36:54,395 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 14:36:54,395 INFO L87 Difference]: Start difference. First operand 113 states and 157 transitions. Second operand has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-04 14:36:54,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:36:54,428 INFO L93 Difference]: Finished difference Result 160 states and 214 transitions. [2025-03-04 14:36:54,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:36:54,429 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), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 47 [2025-03-04 14:36:54,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:36:54,430 INFO L225 Difference]: With dead ends: 160 [2025-03-04 14:36:54,430 INFO L226 Difference]: Without dead ends: 120 [2025-03-04 14:36:54,430 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 14:36:54,430 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 37 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 14:36:54,430 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 251 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 14:36:54,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2025-03-04 14:36:54,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 118. [2025-03-04 14:36:54,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 92 states have (on average 1.434782608695652) internal successors, (132), 100 states have internal predecessors, (132), 16 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-04 14:36:54,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 164 transitions. [2025-03-04 14:36:54,437 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 164 transitions. Word has length 47 [2025-03-04 14:36:54,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:36:54,437 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 164 transitions. [2025-03-04 14:36:54,437 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), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-04 14:36:54,438 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 164 transitions. [2025-03-04 14:36:54,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-04 14:36:54,438 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:36:54,439 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:36:54,446 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 14:36:54,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:36:54,640 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 14:36:54,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:36:54,641 INFO L85 PathProgramCache]: Analyzing trace with hash 1007355392, now seen corresponding path program 1 times [2025-03-04 14:36:54,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:36:54,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818570943] [2025-03-04 14:36:54,641 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:36:54,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:36:54,648 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-04 14:36:54,653 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-04 14:36:54,654 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:36:54,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:36:54,732 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-04 14:36:54,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:36:54,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818570943] [2025-03-04 14:36:54,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818570943] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:36:54,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [260660642] [2025-03-04 14:36:54,733 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:36:54,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:36:54,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:36:54,735 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 14:36:54,736 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 14:36:54,783 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-04 14:36:54,801 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-04 14:36:54,801 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:36:54,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:36:54,802 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 14:36:54,803 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:36:54,834 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-04 14:36:54,835 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 14:36:54,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [260660642] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:36:54,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 14:36:54,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-03-04 14:36:54,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894889024] [2025-03-04 14:36:54,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:36:54,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:36:54,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:36:54,836 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:36:54,836 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 14:36:54,836 INFO L87 Difference]: Start difference. First operand 118 states and 164 transitions. Second operand has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-04 14:36:54,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:36:54,865 INFO L93 Difference]: Finished difference Result 121 states and 167 transitions. [2025-03-04 14:36:54,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:36:54,866 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), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 48 [2025-03-04 14:36:54,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:36:54,867 INFO L225 Difference]: With dead ends: 121 [2025-03-04 14:36:54,867 INFO L226 Difference]: Without dead ends: 120 [2025-03-04 14:36:54,867 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 14:36:54,867 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 36 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 252 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-04 14:36:54,867 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 252 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 14:36:54,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2025-03-04 14:36:54,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 119. [2025-03-04 14:36:54,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 93 states have (on average 1.4301075268817205) internal successors, (133), 101 states have internal predecessors, (133), 16 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-04 14:36:54,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 165 transitions. [2025-03-04 14:36:54,873 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 165 transitions. Word has length 48 [2025-03-04 14:36:54,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:36:54,874 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 165 transitions. [2025-03-04 14:36:54,874 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), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-04 14:36:54,874 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 165 transitions. [2025-03-04 14:36:54,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-04 14:36:54,876 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:36:54,876 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:36:54,882 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 14:36:55,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-03-04 14:36:55,078 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-04 14:36:55,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:36:55,079 INFO L85 PathProgramCache]: Analyzing trace with hash 1531622572, now seen corresponding path program 1 times [2025-03-04 14:36:55,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:36:55,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013113358] [2025-03-04 14:36:55,079 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:36:55,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:36:55,086 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-04 14:36:55,091 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-04 14:36:55,091 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:36:55,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:36:55,125 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-04 14:36:55,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:36:55,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013113358] [2025-03-04 14:36:55,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1013113358] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:36:55,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:36:55,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 14:36:55,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461538622] [2025-03-04 14:36:55,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:36:55,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:36:55,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:36:55,127 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:36:55,128 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:36:55,128 INFO L87 Difference]: Start difference. First operand 119 states and 165 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, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-04 14:36:55,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:36:55,154 INFO L93 Difference]: Finished difference Result 120 states and 166 transitions. [2025-03-04 14:36:55,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:36:55,155 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, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 53 [2025-03-04 14:36:55,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:36:55,156 INFO L225 Difference]: With dead ends: 120 [2025-03-04 14:36:55,156 INFO L226 Difference]: Without dead ends: 119 [2025-03-04 14:36:55,156 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:36:55,156 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 41 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 14:36:55,156 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 250 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 14:36:55,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2025-03-04 14:36:55,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 118. [2025-03-04 14:36:55,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 93 states have (on average 1.4193548387096775) internal successors, (132), 100 states have internal predecessors, (132), 16 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-04 14:36:55,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 164 transitions. [2025-03-04 14:36:55,162 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 164 transitions. Word has length 53 [2025-03-04 14:36:55,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:36:55,162 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 164 transitions. [2025-03-04 14:36:55,162 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, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-04 14:36:55,163 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 164 transitions. [2025-03-04 14:36:55,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-03-04 14:36:55,163 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:36:55,163 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:36:55,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 14:36:55,164 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-04 14:36:55,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:36:55,164 INFO L85 PathProgramCache]: Analyzing trace with hash 235659493, now seen corresponding path program 1 times [2025-03-04 14:36:55,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:36:55,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842598102] [2025-03-04 14:36:55,164 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:36:55,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:36:55,172 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-04 14:36:55,185 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-04 14:36:55,185 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:36:55,185 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:36:55,237 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-04 14:36:55,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:36:55,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842598102] [2025-03-04 14:36:55,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842598102] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:36:55,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:36:55,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 14:36:55,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030012513] [2025-03-04 14:36:55,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:36:55,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:36:55,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:36:55,239 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:36:55,239 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:36:55,239 INFO L87 Difference]: Start difference. First operand 118 states and 164 transitions. Second operand has 3 states, 2 states have (on average 17.5) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-04 14:36:55,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:36:55,259 INFO L93 Difference]: Finished difference Result 119 states and 165 transitions. [2025-03-04 14:36:55,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:36:55,260 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 17.5) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 54 [2025-03-04 14:36:55,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:36:55,261 INFO L225 Difference]: With dead ends: 119 [2025-03-04 14:36:55,261 INFO L226 Difference]: Without dead ends: 118 [2025-03-04 14:36:55,261 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:36:55,261 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 38 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 245 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-04 14:36:55,262 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 245 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 14:36:55,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2025-03-04 14:36:55,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 115. [2025-03-04 14:36:55,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 91 states have (on average 1.4175824175824177) internal successors, (129), 97 states have internal predecessors, (129), 16 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-04 14:36:55,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 161 transitions. [2025-03-04 14:36:55,270 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 161 transitions. Word has length 54 [2025-03-04 14:36:55,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:36:55,270 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 161 transitions. [2025-03-04 14:36:55,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 17.5) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-04 14:36:55,270 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 161 transitions. [2025-03-04 14:36:55,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-03-04 14:36:55,271 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:36:55,271 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:36:55,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 14:36:55,271 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-04 14:36:55,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:36:55,272 INFO L85 PathProgramCache]: Analyzing trace with hash -1533097171, now seen corresponding path program 1 times [2025-03-04 14:36:55,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:36:55,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461894741] [2025-03-04 14:36:55,272 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:36:55,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:36:55,280 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-04 14:36:55,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-04 14:36:55,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:36:55,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:36:55,337 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-04 14:36:55,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:36:55,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461894741] [2025-03-04 14:36:55,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461894741] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:36:55,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2089254458] [2025-03-04 14:36:55,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:36:55,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:36:55,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:36:55,340 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 14:36:55,341 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 14:36:55,399 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-04 14:36:55,425 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-04 14:36:55,425 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:36:55,425 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:36:55,426 INFO L256 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 14:36:55,428 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:36:55,449 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-04 14:36:55,449 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 14:36:55,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2089254458] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:36:55,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 14:36:55,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-03-04 14:36:55,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71746522] [2025-03-04 14:36:55,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:36:55,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:36:55,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:36:55,450 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:36:55,450 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 14:36:55,451 INFO L87 Difference]: Start difference. First operand 115 states and 161 transitions. Second operand has 3 states, 2 states have (on average 16.0) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-04 14:36:55,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:36:55,476 INFO L93 Difference]: Finished difference Result 116 states and 162 transitions. [2025-03-04 14:36:55,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:36:55,476 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 16.0) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 59 [2025-03-04 14:36:55,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:36:55,477 INFO L225 Difference]: With dead ends: 116 [2025-03-04 14:36:55,477 INFO L226 Difference]: Without dead ends: 115 [2025-03-04 14:36:55,477 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 14:36:55,478 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 4 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 275 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-04 14:36:55,478 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 275 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 14:36:55,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2025-03-04 14:36:55,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 114. [2025-03-04 14:36:55,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 91 states have (on average 1.4065934065934067) internal successors, (128), 96 states have internal predecessors, (128), 16 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-04 14:36:55,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 160 transitions. [2025-03-04 14:36:55,485 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 160 transitions. Word has length 59 [2025-03-04 14:36:55,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:36:55,486 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 160 transitions. [2025-03-04 14:36:55,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 16.0) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-04 14:36:55,486 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 160 transitions. [2025-03-04 14:36:55,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-04 14:36:55,486 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:36:55,486 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:36:55,492 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-04 14:36:55,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:36:55,687 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 14:36:55,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:36:55,688 INFO L85 PathProgramCache]: Analyzing trace with hash -281372044, now seen corresponding path program 1 times [2025-03-04 14:36:55,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:36:55,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801074005] [2025-03-04 14:36:55,688 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:36:55,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:36:55,696 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-04 14:36:55,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-04 14:36:55,700 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:36:55,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:36:55,751 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-04 14:36:55,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:36:55,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801074005] [2025-03-04 14:36:55,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801074005] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:36:55,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1838278543] [2025-03-04 14:36:55,752 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:36:55,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:36:55,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:36:55,754 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 14:36:55,756 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 14:36:55,803 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-04 14:36:55,821 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-04 14:36:55,821 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:36:55,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:36:55,822 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 14:36:55,824 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:36:55,838 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-04 14:36:55,838 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 14:36:55,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1838278543] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:36:55,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 14:36:55,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-03-04 14:36:55,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442076460] [2025-03-04 14:36:55,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:36:55,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:36:55,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:36:55,839 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:36:55,839 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 14:36:55,839 INFO L87 Difference]: Start difference. First operand 114 states and 160 transitions. Second operand has 3 states, 2 states have (on average 16.5) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-04 14:36:55,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:36:55,863 INFO L93 Difference]: Finished difference Result 121 states and 169 transitions. [2025-03-04 14:36:55,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:36:55,864 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), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 60 [2025-03-04 14:36:55,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:36:55,865 INFO L225 Difference]: With dead ends: 121 [2025-03-04 14:36:55,865 INFO L226 Difference]: Without dead ends: 120 [2025-03-04 14:36:55,865 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 14:36:55,865 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 1 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 284 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-04 14:36:55,866 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 284 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 14:36:55,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2025-03-04 14:36:55,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 119. [2025-03-04 14:36:55,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 95 states have (on average 1.4) internal successors, (133), 99 states have internal predecessors, (133), 17 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-04 14:36:55,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 167 transitions. [2025-03-04 14:36:55,871 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 167 transitions. Word has length 60 [2025-03-04 14:36:55,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:36:55,871 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 167 transitions. [2025-03-04 14:36:55,872 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), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-04 14:36:55,872 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 167 transitions. [2025-03-04 14:36:55,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-04 14:36:55,872 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:36:55,872 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:36:55,879 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-04 14:36:56,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:36:56,073 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-04 14:36:56,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:36:56,074 INFO L85 PathProgramCache]: Analyzing trace with hash -1539108473, now seen corresponding path program 1 times [2025-03-04 14:36:56,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:36:56,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043401083] [2025-03-04 14:36:56,074 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:36:56,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:36:56,082 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-04 14:36:56,085 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-04 14:36:56,086 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:36:56,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:36:56,122 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-04 14:36:56,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:36:56,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043401083] [2025-03-04 14:36:56,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043401083] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:36:56,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1361850062] [2025-03-04 14:36:56,123 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:36:56,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:36:56,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:36:56,125 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 14:36:56,126 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 14:36:56,188 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-04 14:36:56,204 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-04 14:36:56,204 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:36:56,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:36:56,204 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 14:36:56,206 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:36:56,225 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-04 14:36:56,225 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 14:36:56,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1361850062] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:36:56,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 14:36:56,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-03-04 14:36:56,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399107479] [2025-03-04 14:36:56,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:36:56,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:36:56,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:36:56,226 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:36:56,226 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 14:36:56,226 INFO L87 Difference]: Start difference. First operand 119 states and 167 transitions. Second operand has 3 states, 2 states have (on average 16.5) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-04 14:36:56,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:36:56,243 INFO L93 Difference]: Finished difference Result 120 states and 168 transitions. [2025-03-04 14:36:56,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:36:56,244 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), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 65 [2025-03-04 14:36:56,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:36:56,245 INFO L225 Difference]: With dead ends: 120 [2025-03-04 14:36:56,245 INFO L226 Difference]: Without dead ends: 119 [2025-03-04 14:36:56,245 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 14:36:56,245 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 1 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 275 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-04 14:36:56,245 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 275 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 14:36:56,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2025-03-04 14:36:56,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 113. [2025-03-04 14:36:56,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 91 states have (on average 1.3956043956043955) internal successors, (127), 95 states have internal predecessors, (127), 16 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-04 14:36:56,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 159 transitions. [2025-03-04 14:36:56,250 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 159 transitions. Word has length 65 [2025-03-04 14:36:56,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:36:56,250 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 159 transitions. [2025-03-04 14:36:56,250 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), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-04 14:36:56,250 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 159 transitions. [2025-03-04 14:36:56,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-04 14:36:56,251 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:36:56,251 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:36:56,257 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-04 14:36:56,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-04 14:36:56,452 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 14:36:56,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:36:56,452 INFO L85 PathProgramCache]: Analyzing trace with hash 918028049, now seen corresponding path program 1 times [2025-03-04 14:36:56,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:36:56,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287521795] [2025-03-04 14:36:56,452 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:36:56,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:36:56,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-04 14:36:56,462 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-04 14:36:56,462 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:36:56,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:36:56,495 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2025-03-04 14:36:56,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:36:56,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287521795] [2025-03-04 14:36:56,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287521795] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:36:56,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1731431912] [2025-03-04 14:36:56,496 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:36:56,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:36:56,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:36:56,498 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 14:36:56,503 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 14:36:56,545 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-04 14:36:56,564 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-04 14:36:56,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:36:56,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:36:56,566 INFO L256 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 14:36:56,567 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:36:56,586 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2025-03-04 14:36:56,586 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 14:36:56,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1731431912] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:36:56,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 14:36:56,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-03-04 14:36:56,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92415144] [2025-03-04 14:36:56,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:36:56,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:36:56,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:36:56,587 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:36:56,587 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 14:36:56,587 INFO L87 Difference]: Start difference. First operand 113 states and 159 transitions. Second operand has 3 states, 2 states have (on average 18.5) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-04 14:36:56,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:36:56,611 INFO L93 Difference]: Finished difference Result 113 states and 159 transitions. [2025-03-04 14:36:56,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:36:56,612 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 18.5) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 72 [2025-03-04 14:36:56,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:36:56,613 INFO L225 Difference]: With dead ends: 113 [2025-03-04 14:36:56,613 INFO L226 Difference]: Without dead ends: 112 [2025-03-04 14:36:56,613 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 14:36:56,613 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 3 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 276 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-04 14:36:56,613 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 276 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 14:36:56,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2025-03-04 14:36:56,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2025-03-04 14:36:56,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 91 states have (on average 1.3846153846153846) internal successors, (126), 94 states have internal predecessors, (126), 16 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-04 14:36:56,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 158 transitions. [2025-03-04 14:36:56,620 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 158 transitions. Word has length 72 [2025-03-04 14:36:56,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:36:56,621 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 158 transitions. [2025-03-04 14:36:56,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 18.5) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-04 14:36:56,621 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 158 transitions. [2025-03-04 14:36:56,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-04 14:36:56,622 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:36:56,622 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:36:56,629 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-04 14:36:56,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:36:56,823 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 14:36:56,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:36:56,824 INFO L85 PathProgramCache]: Analyzing trace with hash -1605901567, now seen corresponding path program 1 times [2025-03-04 14:36:56,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:36:56,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585028615] [2025-03-04 14:36:56,824 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:36:56,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:36:56,831 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-04 14:36:56,835 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-04 14:36:56,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:36:56,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:36:56,870 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2025-03-04 14:36:56,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:36:56,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585028615] [2025-03-04 14:36:56,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585028615] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:36:56,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2016233533] [2025-03-04 14:36:56,870 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:36:56,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:36:56,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:36:56,872 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 14:36:56,874 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 14:36:56,917 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-04 14:36:56,935 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-04 14:36:56,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:36:56,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:36:56,936 INFO L256 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 14:36:56,940 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:36:56,960 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2025-03-04 14:36:56,960 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 14:36:56,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2016233533] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:36:56,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 14:36:56,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-03-04 14:36:56,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377407951] [2025-03-04 14:36:56,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:36:56,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:36:56,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:36:56,961 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:36:56,961 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 14:36:56,961 INFO L87 Difference]: Start difference. First operand 112 states and 158 transitions. Second operand has 3 states, 2 states have (on average 19.0) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-04 14:36:56,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:36:56,982 INFO L93 Difference]: Finished difference Result 118 states and 164 transitions. [2025-03-04 14:36:56,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:36:56,982 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 19.0) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 73 [2025-03-04 14:36:56,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:36:56,983 INFO L225 Difference]: With dead ends: 118 [2025-03-04 14:36:56,983 INFO L226 Difference]: Without dead ends: 112 [2025-03-04 14:36:56,983 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 14:36:56,984 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 0 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 287 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-04 14:36:56,984 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 287 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 14:36:56,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2025-03-04 14:36:56,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2025-03-04 14:36:56,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 91 states have (on average 1.3736263736263736) internal successors, (125), 94 states have internal predecessors, (125), 16 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-04 14:36:56,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 157 transitions. [2025-03-04 14:36:56,989 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 157 transitions. Word has length 73 [2025-03-04 14:36:56,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:36:56,990 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 157 transitions. [2025-03-04 14:36:56,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 19.0) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-04 14:36:56,990 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 157 transitions. [2025-03-04 14:36:56,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-04 14:36:56,991 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:36:56,991 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:36:56,998 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-04 14:36:57,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:36:57,192 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 14:36:57,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:36:57,193 INFO L85 PathProgramCache]: Analyzing trace with hash 881611266, now seen corresponding path program 1 times [2025-03-04 14:36:57,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:36:57,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220908704] [2025-03-04 14:36:57,193 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:36:57,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:36:57,200 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-04 14:36:57,203 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-04 14:36:57,203 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:36:57,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:36:57,239 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2025-03-04 14:36:57,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:36:57,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220908704] [2025-03-04 14:36:57,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220908704] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:36:57,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1136311338] [2025-03-04 14:36:57,239 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:36:57,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:36:57,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:36:57,242 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 14:36:57,244 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-04 14:36:57,290 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-04 14:36:57,308 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-04 14:36:57,309 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:36:57,309 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:36:57,310 INFO L256 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 14:36:57,311 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:36:57,325 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2025-03-04 14:36:57,325 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 14:36:57,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1136311338] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:36:57,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 14:36:57,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-03-04 14:36:57,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264842297] [2025-03-04 14:36:57,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:36:57,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:36:57,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:36:57,326 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:36:57,326 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 14:36:57,326 INFO L87 Difference]: Start difference. First operand 112 states and 157 transitions. Second operand has 3 states, 2 states have (on average 19.0) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-04 14:36:57,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:36:57,340 INFO L93 Difference]: Finished difference Result 112 states and 157 transitions. [2025-03-04 14:36:57,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:36:57,341 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 19.0) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 73 [2025-03-04 14:36:57,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:36:57,341 INFO L225 Difference]: With dead ends: 112 [2025-03-04 14:36:57,341 INFO L226 Difference]: Without dead ends: 0 [2025-03-04 14:36:57,342 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 14:36:57,342 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 0 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 14:36:57,342 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 275 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 14:36:57,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-04 14:36:57,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-04 14:36:57,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 14:36:57,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-04 14:36:57,343 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 73 [2025-03-04 14:36:57,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:36:57,343 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 14:36:57,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 19.0) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-04 14:36:57,343 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-04 14:36:57,343 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-04 14:36:57,345 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2025-03-04 14:36:57,346 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2025-03-04 14:36:57,346 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2025-03-04 14:36:57,346 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2025-03-04 14:36:57,346 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2025-03-04 14:36:57,346 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2025-03-04 14:36:57,346 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2025-03-04 14:36:57,346 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2025-03-04 14:36:57,352 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-04 14:36:57,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-04 14:36:57,550 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:36:57,551 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-04 14:36:57,600 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 14:36:57,604 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 02:36:57 BoogieIcfgContainer [2025-03-04 14:36:57,604 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 14:36:57,604 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 14:36:57,604 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 14:36:57,604 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 14:36:57,605 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:36:53" (3/4) ... [2025-03-04 14:36:57,606 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-04 14:36:57,615 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure printLine [2025-03-04 14:36:57,615 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure staticReturnsFalse [2025-03-04 14:36:57,615 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure printIntLine [2025-03-04 14:36:57,615 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure staticReturnsTrue [2025-03-04 14:36:57,619 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2025-03-04 14:36:57,619 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2025-03-04 14:36:57,619 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-04 14:36:57,619 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-04 14:36:57,697 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 14:36:57,698 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-04 14:36:57,698 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 14:36:57,699 INFO L158 Benchmark]: Toolchain (without parser) took 5755.22ms. Allocated memory was 142.6MB in the beginning and 385.9MB in the end (delta: 243.3MB). Free memory was 110.3MB in the beginning and 229.6MB in the end (delta: -119.3MB). Peak memory consumption was 123.4MB. Max. memory is 16.1GB. [2025-03-04 14:36:57,699 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 201.3MB. Free memory is still 124.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 14:36:57,699 INFO L158 Benchmark]: CACSL2BoogieTranslator took 681.54ms. Allocated memory is still 142.6MB. Free memory was 110.3MB in the beginning and 49.6MB in the end (delta: 60.7MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. [2025-03-04 14:36:57,699 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.36ms. Allocated memory is still 142.6MB. Free memory was 49.6MB in the beginning and 46.2MB in the end (delta: 3.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 14:36:57,700 INFO L158 Benchmark]: Boogie Preprocessor took 35.71ms. Allocated memory is still 142.6MB. Free memory was 46.2MB in the beginning and 44.7MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 14:36:57,700 INFO L158 Benchmark]: IcfgBuilder took 549.29ms. Allocated memory is still 142.6MB. Free memory was 44.2MB in the beginning and 86.7MB in the end (delta: -42.6MB). Peak memory consumption was 14.1MB. Max. memory is 16.1GB. [2025-03-04 14:36:57,700 INFO L158 Benchmark]: TraceAbstraction took 4351.87ms. Allocated memory was 142.6MB in the beginning and 385.9MB in the end (delta: 243.3MB). Free memory was 86.0MB in the beginning and 237.5MB in the end (delta: -151.5MB). Peak memory consumption was 92.5MB. Max. memory is 16.1GB. [2025-03-04 14:36:57,701 INFO L158 Benchmark]: Witness Printer took 93.24ms. Allocated memory is still 385.9MB. Free memory was 237.5MB in the beginning and 229.6MB in the end (delta: 7.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 14:36:57,703 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.24ms. Allocated memory is still 201.3MB. Free memory is still 124.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 681.54ms. Allocated memory is still 142.6MB. Free memory was 110.3MB in the beginning and 49.6MB in the end (delta: 60.7MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.36ms. Allocated memory is still 142.6MB. Free memory was 49.6MB in the beginning and 46.2MB in the end (delta: 3.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 35.71ms. Allocated memory is still 142.6MB. Free memory was 46.2MB in the beginning and 44.7MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 549.29ms. Allocated memory is still 142.6MB. Free memory was 44.2MB in the beginning and 86.7MB in the end (delta: -42.6MB). Peak memory consumption was 14.1MB. Max. memory is 16.1GB. * TraceAbstraction took 4351.87ms. Allocated memory was 142.6MB in the beginning and 385.9MB in the end (delta: 243.3MB). Free memory was 86.0MB in the beginning and 237.5MB in the end (delta: -151.5MB). Peak memory consumption was 92.5MB. Max. memory is 16.1GB. * Witness Printer took 93.24ms. Allocated memory is still 385.9MB. Free memory was 237.5MB in the beginning and 229.6MB in the end (delta: 7.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 1636]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1636]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1619]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1619]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1594]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1594]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1572]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1572]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 125 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 4.3s, OverallIterations: 14, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 244 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 235 mSDsluCounter, 4111 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2063 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 310 IncrementalHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 2048 mSDtfsCounter, 310 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 537 GetRequests, 505 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=125occurred in iteration=0, InterpolantAutomatonStates: 44, 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, 14 MinimizatonAttempts, 16 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 1226 NumberOfCodeBlocks, 1226 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 1204 ConstructedInterpolants, 0 QuantifiedInterpolants, 1456 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1513 ConjunctsInSsa, 16 ConjunctsInUnsatCore, 22 InterpolantComputations, 14 PerfectInterpolantSequences, 529/569 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-04 14:36:57,716 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