./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/nla-digbench-scaling/ps6-ll_valuebound20.c --full-output --architecture 32bit -------------------------------------------------------------------------------- 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/nla-digbench-scaling/ps6-ll_valuebound20.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-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 32bit --witnessprinter.graph.data.programhash 4b2ee659e7bd0f15011c822a777a938a0e6f5b3a8f826a051cccefa88973daa0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 11:25:20,164 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 11:25:20,210 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-04 11:25:20,213 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 11:25:20,214 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 11:25:20,236 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 11:25:20,237 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 11:25:20,238 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 11:25:20,238 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 11:25:20,238 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 11:25:20,239 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 11:25:20,239 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 11:25:20,239 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 11:25:20,239 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 11:25:20,240 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 11:25:20,240 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 11:25:20,240 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 11:25:20,240 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 11:25:20,240 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 11:25:20,240 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 11:25:20,240 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 11:25:20,240 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 11:25:20,241 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 11:25:20,241 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 11:25:20,241 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 11:25:20,241 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 11:25:20,241 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 11:25:20,241 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 11:25:20,241 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 11:25:20,241 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 11:25:20,241 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 11:25:20,242 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 11:25:20,242 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 11:25:20,242 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 11:25:20,242 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 11:25:20,242 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 11:25:20,242 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 11:25:20,242 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 11:25:20,242 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 11:25:20,242 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 11:25:20,242 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 11:25:20,242 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 11:25:20,243 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 11:25:20,243 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 11:25:20,243 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 11:25:20,243 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4b2ee659e7bd0f15011c822a777a938a0e6f5b3a8f826a051cccefa88973daa0 [2025-03-04 11:25:20,456 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 11:25:20,464 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 11:25:20,465 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 11:25:20,466 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 11:25:20,466 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 11:25:20,468 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/ps6-ll_valuebound20.c [2025-03-04 11:25:21,536 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/58c7d286c/2207ffe9c5594c28988d460642def29f/FLAG61aa8d900 [2025-03-04 11:25:21,747 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 11:25:21,747 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/ps6-ll_valuebound20.c [2025-03-04 11:25:21,758 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/58c7d286c/2207ffe9c5594c28988d460642def29f/FLAG61aa8d900 [2025-03-04 11:25:22,107 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/58c7d286c/2207ffe9c5594c28988d460642def29f [2025-03-04 11:25:22,108 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 11:25:22,109 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 11:25:22,110 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 11:25:22,110 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 11:25:22,113 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 11:25:22,113 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 11:25:22" (1/1) ... [2025-03-04 11:25:22,114 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f21bdaf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:25:22, skipping insertion in model container [2025-03-04 11:25:22,114 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 11:25:22" (1/1) ... [2025-03-04 11:25:22,122 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 11:25:22,225 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 11:25:22,234 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 11:25:22,250 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 11:25:22,261 INFO L204 MainTranslator]: Completed translation [2025-03-04 11:25:22,261 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:25:22 WrapperNode [2025-03-04 11:25:22,262 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 11:25:22,263 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 11:25:22,263 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 11:25:22,263 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 11:25:22,266 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:25:22" (1/1) ... [2025-03-04 11:25:22,271 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:25:22" (1/1) ... [2025-03-04 11:25:22,296 INFO L138 Inliner]: procedures = 14, calls = 13, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 141 [2025-03-04 11:25:22,296 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 11:25:22,296 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 11:25:22,296 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 11:25:22,296 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 11:25:22,304 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:25:22" (1/1) ... [2025-03-04 11:25:22,304 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:25:22" (1/1) ... [2025-03-04 11:25:22,308 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:25:22" (1/1) ... [2025-03-04 11:25:22,321 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-04 11:25:22,322 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:25:22" (1/1) ... [2025-03-04 11:25:22,323 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:25:22" (1/1) ... [2025-03-04 11:25:22,328 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:25:22" (1/1) ... [2025-03-04 11:25:22,328 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:25:22" (1/1) ... [2025-03-04 11:25:22,333 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:25:22" (1/1) ... [2025-03-04 11:25:22,333 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:25:22" (1/1) ... [2025-03-04 11:25:22,335 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 11:25:22,335 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 11:25:22,335 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 11:25:22,335 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 11:25:22,339 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:25:22" (1/1) ... [2025-03-04 11:25:22,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 11:25:22,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:25:22,365 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 11:25:22,368 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 11:25:22,387 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 11:25:22,387 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 11:25:22,387 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 11:25:22,387 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 11:25:22,387 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 11:25:22,387 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 11:25:22,387 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-04 11:25:22,387 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-04 11:25:22,423 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 11:25:22,425 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 11:25:22,836 INFO L? ?]: Removed 91 outVars from TransFormulas that were not future-live. [2025-03-04 11:25:22,836 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 11:25:22,848 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 11:25:22,848 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 11:25:22,848 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 11:25:22 BoogieIcfgContainer [2025-03-04 11:25:22,848 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 11:25:22,850 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 11:25:22,850 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 11:25:22,853 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 11:25:22,853 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 11:25:22" (1/3) ... [2025-03-04 11:25:22,854 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22e74132 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 11:25:22, skipping insertion in model container [2025-03-04 11:25:22,854 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:25:22" (2/3) ... [2025-03-04 11:25:22,854 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22e74132 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 11:25:22, skipping insertion in model container [2025-03-04 11:25:22,854 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 11:25:22" (3/3) ... [2025-03-04 11:25:22,856 INFO L128 eAbstractionObserver]: Analyzing ICFG ps6-ll_valuebound20.c [2025-03-04 11:25:22,865 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 11:25:22,867 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG ps6-ll_valuebound20.c that has 3 procedures, 227 locations, 1 initial locations, 1 loop locations, and 102 error locations. [2025-03-04 11:25:22,906 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 11:25:22,914 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;@547c2174, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 11:25:22,915 INFO L334 AbstractCegarLoop]: Starting to check reachability of 102 error locations. [2025-03-04 11:25:22,919 INFO L276 IsEmpty]: Start isEmpty. Operand has 227 states, 117 states have (on average 1.9059829059829059) internal successors, (223), 219 states have internal predecessors, (223), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-04 11:25:22,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-04 11:25:22,922 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:25:22,923 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:25:22,923 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr101ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 99 more)] === [2025-03-04 11:25:22,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:25:22,927 INFO L85 PathProgramCache]: Analyzing trace with hash -323029926, now seen corresponding path program 1 times [2025-03-04 11:25:22,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:25:22,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162961816] [2025-03-04 11:25:22,934 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:25:22,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:25:22,973 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 11:25:22,981 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 11:25:22,981 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:25:22,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:25:23,015 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 11:25:23,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:25:23,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162961816] [2025-03-04 11:25:23,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162961816] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:25:23,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [465288983] [2025-03-04 11:25:23,018 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:25:23,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:25:23,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:25:23,021 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 11:25:23,023 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 11:25:23,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 11:25:23,050 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 11:25:23,050 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:25:23,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:25:23,051 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 11:25:23,053 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:25:23,060 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 11:25:23,061 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:25:23,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [465288983] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:25:23,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 11:25:23,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 11:25:23,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550837026] [2025-03-04 11:25:23,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:25:23,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 11:25:23,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:25:23,078 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 11:25:23,078 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 11:25:23,080 INFO L87 Difference]: Start difference. First operand has 227 states, 117 states have (on average 1.9059829059829059) internal successors, (223), 219 states have internal predecessors, (223), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 11:25:23,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:25:23,099 INFO L93 Difference]: Finished difference Result 425 states and 466 transitions. [2025-03-04 11:25:23,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 11:25:23,100 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 14 [2025-03-04 11:25:23,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:25:23,105 INFO L225 Difference]: With dead ends: 425 [2025-03-04 11:25:23,105 INFO L226 Difference]: Without dead ends: 195 [2025-03-04 11:25:23,107 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 11:25:23,109 INFO L435 NwaCegarLoop]: 204 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:25:23,109 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:25:23,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2025-03-04 11:25:23,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 195. [2025-03-04 11:25:23,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 112 states have (on average 1.6875) internal successors, (189), 188 states have internal predecessors, (189), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-04 11:25:23,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 197 transitions. [2025-03-04 11:25:23,157 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 197 transitions. Word has length 14 [2025-03-04 11:25:23,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:25:23,158 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 197 transitions. [2025-03-04 11:25:23,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 11:25:23,158 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 197 transitions. [2025-03-04 11:25:23,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-04 11:25:23,159 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:25:23,159 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:25:23,164 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 11:25:23,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-04 11:25:23,359 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr101ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 99 more)] === [2025-03-04 11:25:23,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:25:23,360 INFO L85 PathProgramCache]: Analyzing trace with hash -518619910, now seen corresponding path program 1 times [2025-03-04 11:25:23,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:25:23,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967919125] [2025-03-04 11:25:23,360 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:25:23,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:25:23,363 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 11:25:23,369 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 11:25:23,369 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:25:23,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:25:23,426 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 11:25:23,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:25:23,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967919125] [2025-03-04 11:25:23,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967919125] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:25:23,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:25:23,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 11:25:23,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997522033] [2025-03-04 11:25:23,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:25:23,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 11:25:23,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:25:23,427 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 11:25:23,427 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 11:25:23,427 INFO L87 Difference]: Start difference. First operand 195 states and 197 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 11:25:23,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:25:23,781 INFO L93 Difference]: Finished difference Result 355 states and 363 transitions. [2025-03-04 11:25:23,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 11:25:23,781 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 14 [2025-03-04 11:25:23,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:25:23,783 INFO L225 Difference]: With dead ends: 355 [2025-03-04 11:25:23,783 INFO L226 Difference]: Without dead ends: 291 [2025-03-04 11:25:23,783 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 11:25:23,784 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 98 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 11:25:23,784 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 137 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 11:25:23,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2025-03-04 11:25:23,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 285. [2025-03-04 11:25:23,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 201 states have (on average 1.4328358208955223) internal successors, (288), 277 states have internal predecessors, (288), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-04 11:25:23,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 298 transitions. [2025-03-04 11:25:23,794 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 298 transitions. Word has length 14 [2025-03-04 11:25:23,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:25:23,794 INFO L471 AbstractCegarLoop]: Abstraction has 285 states and 298 transitions. [2025-03-04 11:25:23,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 11:25:23,795 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 298 transitions. [2025-03-04 11:25:23,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-04 11:25:23,795 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:25:23,796 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:25:23,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 11:25:23,796 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr63ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 99 more)] === [2025-03-04 11:25:23,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:25:23,796 INFO L85 PathProgramCache]: Analyzing trace with hash -1434906604, now seen corresponding path program 1 times [2025-03-04 11:25:23,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:25:23,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961347260] [2025-03-04 11:25:23,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:25:23,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:25:23,802 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-04 11:25:23,818 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-04 11:25:23,818 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:25:23,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:25:23,896 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 11:25:23,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:25:23,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961347260] [2025-03-04 11:25:23,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961347260] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:25:23,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:25:23,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 11:25:23,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276305406] [2025-03-04 11:25:23,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:25:23,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 11:25:23,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:25:23,898 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 11:25:23,898 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 11:25:23,899 INFO L87 Difference]: Start difference. First operand 285 states and 298 transitions. Second operand has 3 states, 2 states have (on average 22.5) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 11:25:23,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:25:23,946 INFO L93 Difference]: Finished difference Result 309 states and 316 transitions. [2025-03-04 11:25:23,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 11:25:23,947 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 22.5) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 52 [2025-03-04 11:25:23,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:25:23,948 INFO L225 Difference]: With dead ends: 309 [2025-03-04 11:25:23,948 INFO L226 Difference]: Without dead ends: 302 [2025-03-04 11:25:23,948 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 11:25:23,949 INFO L435 NwaCegarLoop]: 184 mSDtfsCounter, 68 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:25:23,949 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 359 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:25:23,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2025-03-04 11:25:23,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 284. [2025-03-04 11:25:23,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 200 states have (on average 1.405) internal successors, (281), 276 states have internal predecessors, (281), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-04 11:25:23,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 291 transitions. [2025-03-04 11:25:23,957 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 291 transitions. Word has length 52 [2025-03-04 11:25:23,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:25:23,957 INFO L471 AbstractCegarLoop]: Abstraction has 284 states and 291 transitions. [2025-03-04 11:25:23,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 22.5) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 11:25:23,958 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 291 transitions. [2025-03-04 11:25:23,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-03-04 11:25:23,958 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:25:23,958 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:25:23,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 11:25:23,959 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr61ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 99 more)] === [2025-03-04 11:25:23,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:25:23,959 INFO L85 PathProgramCache]: Analyzing trace with hash -260741166, now seen corresponding path program 1 times [2025-03-04 11:25:23,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:25:23,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847360206] [2025-03-04 11:25:23,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:25:23,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:25:23,965 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-04 11:25:23,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-04 11:25:23,982 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:25:23,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:25:24,068 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 11:25:24,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:25:24,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847360206] [2025-03-04 11:25:24,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847360206] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:25:24,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:25:24,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 11:25:24,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929774850] [2025-03-04 11:25:24,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:25:24,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 11:25:24,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:25:24,068 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 11:25:24,068 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 11:25:24,069 INFO L87 Difference]: Start difference. First operand 284 states and 291 transitions. Second operand has 4 states, 3 states have (on average 15.666666666666666) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 11:25:24,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:25:24,226 INFO L93 Difference]: Finished difference Result 304 states and 309 transitions. [2025-03-04 11:25:24,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 11:25:24,227 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 15.666666666666666) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 54 [2025-03-04 11:25:24,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:25:24,228 INFO L225 Difference]: With dead ends: 304 [2025-03-04 11:25:24,228 INFO L226 Difference]: Without dead ends: 261 [2025-03-04 11:25:24,228 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 11:25:24,229 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 150 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:25:24,229 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 284 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:25:24,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2025-03-04 11:25:24,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 243. [2025-03-04 11:25:24,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 159 states have (on average 1.4968553459119496) internal successors, (238), 235 states have internal predecessors, (238), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-04 11:25:24,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 248 transitions. [2025-03-04 11:25:24,238 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 248 transitions. Word has length 54 [2025-03-04 11:25:24,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:25:24,238 INFO L471 AbstractCegarLoop]: Abstraction has 243 states and 248 transitions. [2025-03-04 11:25:24,238 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 15.666666666666666) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 11:25:24,238 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 248 transitions. [2025-03-04 11:25:24,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-04 11:25:24,241 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:25:24,241 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:25:24,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 11:25:24,241 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr59ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 99 more)] === [2025-03-04 11:25:24,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:25:24,242 INFO L85 PathProgramCache]: Analyzing trace with hash -430482403, now seen corresponding path program 1 times [2025-03-04 11:25:24,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:25:24,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010285120] [2025-03-04 11:25:24,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:25:24,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:25:24,253 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-04 11:25:24,265 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-04 11:25:24,265 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:25:24,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:25:24,302 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 11:25:24,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:25:24,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010285120] [2025-03-04 11:25:24,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010285120] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:25:24,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:25:24,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 11:25:24,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086699534] [2025-03-04 11:25:24,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:25:24,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 11:25:24,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:25:24,303 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 11:25:24,303 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 11:25:24,303 INFO L87 Difference]: Start difference. First operand 243 states and 248 transitions. Second operand has 3 states, 2 states have (on average 26.5) internal successors, (53), 3 states have internal predecessors, (53), 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 11:25:24,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:25:24,317 INFO L93 Difference]: Finished difference Result 245 states and 248 transitions. [2025-03-04 11:25:24,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 11:25:24,318 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 26.5) internal successors, (53), 3 states have internal predecessors, (53), 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 62 [2025-03-04 11:25:24,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:25:24,319 INFO L225 Difference]: With dead ends: 245 [2025-03-04 11:25:24,319 INFO L226 Difference]: Without dead ends: 243 [2025-03-04 11:25:24,319 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 11:25:24,319 INFO L435 NwaCegarLoop]: 194 mSDtfsCounter, 1 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:25:24,320 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 383 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:25:24,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2025-03-04 11:25:24,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 243. [2025-03-04 11:25:24,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 159 states have (on average 1.4842767295597483) internal successors, (236), 235 states have internal predecessors, (236), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-04 11:25:24,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 246 transitions. [2025-03-04 11:25:24,333 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 246 transitions. Word has length 62 [2025-03-04 11:25:24,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:25:24,333 INFO L471 AbstractCegarLoop]: Abstraction has 243 states and 246 transitions. [2025-03-04 11:25:24,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 26.5) internal successors, (53), 3 states have internal predecessors, (53), 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 11:25:24,333 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 246 transitions. [2025-03-04 11:25:24,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-04 11:25:24,334 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:25:24,334 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:25:24,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 11:25:24,334 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr54ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 99 more)] === [2025-03-04 11:25:24,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:25:24,334 INFO L85 PathProgramCache]: Analyzing trace with hash -1400189158, now seen corresponding path program 1 times [2025-03-04 11:25:24,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:25:24,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769553334] [2025-03-04 11:25:24,335 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:25:24,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:25:24,345 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-04 11:25:24,358 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-04 11:25:24,358 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:25:24,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 11:25:24,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1930203731] [2025-03-04 11:25:24,359 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:25:24,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:25:24,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:25:24,362 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 11:25:24,364 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 11:25:24,390 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-04 11:25:24,402 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-04 11:25:24,402 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:25:24,402 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:25:24,403 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 11:25:24,404 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:25:24,473 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 11:25:24,473 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:25:24,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:25:24,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769553334] [2025-03-04 11:25:24,474 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 11:25:24,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1930203731] [2025-03-04 11:25:24,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1930203731] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:25:24,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:25:24,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 11:25:24,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225358698] [2025-03-04 11:25:24,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:25:24,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 11:25:24,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:25:24,475 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 11:25:24,475 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 11:25:24,476 INFO L87 Difference]: Start difference. First operand 243 states and 246 transitions. Second operand has 4 states, 3 states have (on average 19.333333333333332) internal successors, (58), 4 states have internal predecessors, (58), 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 11:25:24,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:25:24,839 INFO L93 Difference]: Finished difference Result 417 states and 430 transitions. [2025-03-04 11:25:24,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 11:25:24,839 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 19.333333333333332) internal successors, (58), 4 states have internal predecessors, (58), 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 67 [2025-03-04 11:25:24,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:25:24,841 INFO L225 Difference]: With dead ends: 417 [2025-03-04 11:25:24,842 INFO L226 Difference]: Without dead ends: 352 [2025-03-04 11:25:24,843 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 64 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 11:25:24,844 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 107 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 484 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 484 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 11:25:24,844 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 158 Invalid, 546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 484 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 11:25:24,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2025-03-04 11:25:24,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 346. [2025-03-04 11:25:24,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 260 states have (on average 1.35) internal successors, (351), 336 states have internal predecessors, (351), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-04 11:25:24,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 365 transitions. [2025-03-04 11:25:24,853 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 365 transitions. Word has length 67 [2025-03-04 11:25:24,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:25:24,853 INFO L471 AbstractCegarLoop]: Abstraction has 346 states and 365 transitions. [2025-03-04 11:25:24,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 19.333333333333332) internal successors, (58), 4 states have internal predecessors, (58), 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 11:25:24,853 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 365 transitions. [2025-03-04 11:25:24,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-04 11:25:24,854 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:25:24,854 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:25:24,859 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 11:25:25,058 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 11:25:25,058 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr47ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 99 more)] === [2025-03-04 11:25:25,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:25:25,058 INFO L85 PathProgramCache]: Analyzing trace with hash -328942383, now seen corresponding path program 1 times [2025-03-04 11:25:25,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:25:25,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306026442] [2025-03-04 11:25:25,058 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:25:25,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:25:25,064 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-04 11:25:25,080 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-04 11:25:25,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:25:25,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:25:25,145 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 11:25:25,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:25:25,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306026442] [2025-03-04 11:25:25,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306026442] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:25:25,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:25:25,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 11:25:25,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809800021] [2025-03-04 11:25:25,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:25:25,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 11:25:25,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:25:25,146 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 11:25:25,146 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 11:25:25,146 INFO L87 Difference]: Start difference. First operand 346 states and 365 transitions. Second operand has 4 states, 3 states have (on average 21.666666666666668) internal successors, (65), 4 states have internal predecessors, (65), 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 11:25:25,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:25:25,394 INFO L93 Difference]: Finished difference Result 347 states and 365 transitions. [2025-03-04 11:25:25,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 11:25:25,395 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 21.666666666666668) internal successors, (65), 4 states have internal predecessors, (65), 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 74 [2025-03-04 11:25:25,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:25:25,396 INFO L225 Difference]: With dead ends: 347 [2025-03-04 11:25:25,396 INFO L226 Difference]: Without dead ends: 346 [2025-03-04 11:25:25,396 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 11:25:25,397 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 53 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 11:25:25,397 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 338 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 11:25:25,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2025-03-04 11:25:25,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 346. [2025-03-04 11:25:25,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 260 states have (on average 1.3461538461538463) internal successors, (350), 336 states have internal predecessors, (350), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-04 11:25:25,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 364 transitions. [2025-03-04 11:25:25,404 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 364 transitions. Word has length 74 [2025-03-04 11:25:25,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:25:25,404 INFO L471 AbstractCegarLoop]: Abstraction has 346 states and 364 transitions. [2025-03-04 11:25:25,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 21.666666666666668) internal successors, (65), 4 states have internal predecessors, (65), 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 11:25:25,404 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 364 transitions. [2025-03-04 11:25:25,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-04 11:25:25,405 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:25:25,405 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:25:25,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 11:25:25,405 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr46ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 99 more)] === [2025-03-04 11:25:25,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:25:25,406 INFO L85 PathProgramCache]: Analyzing trace with hash -1607279214, now seen corresponding path program 1 times [2025-03-04 11:25:25,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:25:25,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837110564] [2025-03-04 11:25:25,406 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:25:25,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:25:25,411 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-04 11:25:25,415 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-04 11:25:25,415 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:25:25,415 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:25:25,465 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 11:25:25,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:25:25,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837110564] [2025-03-04 11:25:25,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837110564] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:25:25,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:25:25,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 11:25:25,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049084369] [2025-03-04 11:25:25,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:25:25,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 11:25:25,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:25:25,469 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 11:25:25,469 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 11:25:25,469 INFO L87 Difference]: Start difference. First operand 346 states and 364 transitions. Second operand has 4 states, 3 states have (on average 22.0) internal successors, (66), 4 states have internal predecessors, (66), 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 11:25:25,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:25:25,684 INFO L93 Difference]: Finished difference Result 347 states and 364 transitions. [2025-03-04 11:25:25,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 11:25:25,685 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 22.0) internal successors, (66), 4 states have internal predecessors, (66), 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 75 [2025-03-04 11:25:25,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:25:25,686 INFO L225 Difference]: With dead ends: 347 [2025-03-04 11:25:25,686 INFO L226 Difference]: Without dead ends: 346 [2025-03-04 11:25:25,686 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 11:25:25,686 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 46 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 11:25:25,687 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 347 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 11:25:25,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2025-03-04 11:25:25,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 346. [2025-03-04 11:25:25,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 260 states have (on average 1.3423076923076922) internal successors, (349), 336 states have internal predecessors, (349), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-04 11:25:25,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 363 transitions. [2025-03-04 11:25:25,702 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 363 transitions. Word has length 75 [2025-03-04 11:25:25,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:25:25,703 INFO L471 AbstractCegarLoop]: Abstraction has 346 states and 363 transitions. [2025-03-04 11:25:25,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 22.0) internal successors, (66), 4 states have internal predecessors, (66), 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 11:25:25,703 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 363 transitions. [2025-03-04 11:25:25,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-03-04 11:25:25,707 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:25:25,707 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-04 11:25:25,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 11:25:25,707 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr63ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 99 more)] === [2025-03-04 11:25:25,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:25:25,707 INFO L85 PathProgramCache]: Analyzing trace with hash -814884228, now seen corresponding path program 1 times [2025-03-04 11:25:25,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:25:25,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069857888] [2025-03-04 11:25:25,707 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:25:25,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:25:25,715 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-04 11:25:25,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-04 11:25:25,729 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:25:25,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 11:25:25,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2002571641] [2025-03-04 11:25:25,730 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:25:25,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:25:25,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:25:25,732 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 11:25:25,734 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 11:25:25,756 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-04 11:25:25,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-04 11:25:25,774 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:25:25,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:25:25,775 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 11:25:25,777 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:25:26,014 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 11:25:26,014 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:25:26,215 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 11:25:26,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:25:26,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069857888] [2025-03-04 11:25:26,215 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 11:25:26,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2002571641] [2025-03-04 11:25:26,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2002571641] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:25:26,215 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 11:25:26,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2025-03-04 11:25:26,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587354253] [2025-03-04 11:25:26,215 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 11:25:26,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 11:25:26,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:25:26,216 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 11:25:26,216 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-03-04 11:25:26,216 INFO L87 Difference]: Start difference. First operand 346 states and 363 transitions. Second operand has 8 states, 7 states have (on average 28.857142857142858) internal successors, (202), 8 states have internal predecessors, (202), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-04 11:25:27,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:25:27,071 INFO L93 Difference]: Finished difference Result 370 states and 381 transitions. [2025-03-04 11:25:27,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 11:25:27,072 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 28.857142857142858) internal successors, (202), 8 states have internal predecessors, (202), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 114 [2025-03-04 11:25:27,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:25:27,073 INFO L225 Difference]: With dead ends: 370 [2025-03-04 11:25:27,074 INFO L226 Difference]: Without dead ends: 361 [2025-03-04 11:25:27,074 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 220 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2025-03-04 11:25:27,075 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 387 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 771 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 387 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 792 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 771 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-04 11:25:27,075 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [387 Valid, 151 Invalid, 792 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 771 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-04 11:25:27,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2025-03-04 11:25:27,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 350. [2025-03-04 11:25:27,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 350 states, 267 states have (on average 1.3108614232209739) internal successors, (350), 340 states have internal predecessors, (350), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-04 11:25:27,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 364 transitions. [2025-03-04 11:25:27,084 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 364 transitions. Word has length 114 [2025-03-04 11:25:27,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:25:27,085 INFO L471 AbstractCegarLoop]: Abstraction has 350 states and 364 transitions. [2025-03-04 11:25:27,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 28.857142857142858) internal successors, (202), 8 states have internal predecessors, (202), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-04 11:25:27,085 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 364 transitions. [2025-03-04 11:25:27,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-04 11:25:27,086 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:25:27,086 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-04 11:25:27,092 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 11:25:27,287 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 11:25:27,287 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr61ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 99 more)] === [2025-03-04 11:25:27,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:25:27,288 INFO L85 PathProgramCache]: Analyzing trace with hash -1419691974, now seen corresponding path program 1 times [2025-03-04 11:25:27,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:25:27,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685965558] [2025-03-04 11:25:27,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:25:27,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:25:27,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-04 11:25:27,315 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-04 11:25:27,315 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:25:27,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 11:25:27,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1039100271] [2025-03-04 11:25:27,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:25:27,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:25:27,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:25:27,319 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 11:25:27,320 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 11:25:27,340 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-04 11:25:27,358 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-04 11:25:27,358 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:25:27,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:25:27,359 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 11:25:27,361 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:25:27,612 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 41 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 11:25:27,612 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:25:28,566 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 4 proven. 37 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 11:25:28,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:25:28,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685965558] [2025-03-04 11:25:28,566 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 11:25:28,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1039100271] [2025-03-04 11:25:28,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1039100271] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:25:28,567 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 11:25:28,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 8 [2025-03-04 11:25:28,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813607166] [2025-03-04 11:25:28,567 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 11:25:28,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 11:25:28,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:25:28,568 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 11:25:28,568 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2025-03-04 11:25:28,568 INFO L87 Difference]: Start difference. First operand 350 states and 364 transitions. Second operand has 9 states, 8 states have (on average 25.75) internal successors, (206), 9 states have internal predecessors, (206), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-04 11:25:31,110 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-04 11:25:35,512 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-04 11:25:41,703 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 5.99s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-04 11:25:45,163 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.14s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-04 11:25:47,970 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-04 11:25:50,633 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.71s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-04 11:25:56,332 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 5.70s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-04 11:26:03,851 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 5.91s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-04 11:26:11,252 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 5.85s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-04 11:26:16,340 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.77s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-04 11:26:20,380 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.88s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-04 11:26:25,558 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 5.18s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-04 11:26:30,801 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.49s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-04 11:26:36,390 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.75s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-04 11:26:41,169 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-04 11:26:47,082 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 5.91s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-04 11:26:52,685 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-04 11:26:57,417 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.73s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-04 11:27:01,920 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-04 11:27:06,447 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers []