./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/nla-digbench-scaling/mannadiv_unwindbound5.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/mannadiv_unwindbound5.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 aad83614f5b3454ec30b386336992d9fee88422d967149e7e88efe6256830f00 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 15:30:32,707 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 15:30:32,763 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-17 15:30:32,768 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 15:30:32,768 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 15:30:32,794 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 15:30:32,794 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 15:30:32,794 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 15:30:32,795 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 15:30:32,795 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 15:30:32,795 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 15:30:32,795 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 15:30:32,795 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 15:30:32,795 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 15:30:32,795 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 15:30:32,795 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 15:30:32,795 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 15:30:32,795 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 15:30:32,795 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 15:30:32,795 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 15:30:32,795 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 15:30:32,795 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 15:30:32,796 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 15:30:32,796 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 15:30:32,796 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-17 15:30:32,796 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 15:30:32,796 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 15:30:32,796 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 15:30:32,796 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 15:30:32,796 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 15:30:32,796 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 15:30:32,796 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 15:30:32,796 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 15:30:32,796 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 15:30:32,796 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 15:30:32,796 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 15:30:32,798 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 15:30:32,798 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 15:30:32,798 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 15:30:32,798 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 15:30:32,798 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 15:30:32,798 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 15:30:32,798 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 15:30:32,798 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 15:30:32,798 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 15:30:32,798 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 -> aad83614f5b3454ec30b386336992d9fee88422d967149e7e88efe6256830f00 [2025-03-17 15:30:33,033 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 15:30:33,038 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 15:30:33,040 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 15:30:33,041 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 15:30:33,041 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 15:30:33,042 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/mannadiv_unwindbound5.c [2025-03-17 15:30:34,229 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7e25b15ec/b1615750b0b84b5ba0d3bb94dd6603ea/FLAG1f3a5acee [2025-03-17 15:30:34,447 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 15:30:34,449 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/mannadiv_unwindbound5.c [2025-03-17 15:30:34,454 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7e25b15ec/b1615750b0b84b5ba0d3bb94dd6603ea/FLAG1f3a5acee [2025-03-17 15:30:34,795 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7e25b15ec/b1615750b0b84b5ba0d3bb94dd6603ea [2025-03-17 15:30:34,797 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 15:30:34,797 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 15:30:34,798 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 15:30:34,798 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 15:30:34,801 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 15:30:34,802 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:30:34" (1/1) ... [2025-03-17 15:30:34,802 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1998856b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:30:34, skipping insertion in model container [2025-03-17 15:30:34,802 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:30:34" (1/1) ... [2025-03-17 15:30:34,813 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 15:30:34,923 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 15:30:34,930 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 15:30:34,939 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 15:30:34,949 INFO L204 MainTranslator]: Completed translation [2025-03-17 15:30:34,949 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:30:34 WrapperNode [2025-03-17 15:30:34,949 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 15:30:34,950 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 15:30:34,950 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 15:30:34,950 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 15:30:34,954 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:30:34" (1/1) ... [2025-03-17 15:30:34,958 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:30:34" (1/1) ... [2025-03-17 15:30:34,968 INFO L138 Inliner]: procedures = 14, calls = 12, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 75 [2025-03-17 15:30:34,968 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 15:30:34,968 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 15:30:34,968 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 15:30:34,969 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 15:30:34,974 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:30:34" (1/1) ... [2025-03-17 15:30:34,974 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:30:34" (1/1) ... [2025-03-17 15:30:34,975 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:30:34" (1/1) ... [2025-03-17 15:30:34,981 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-17 15:30:34,981 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:30:34" (1/1) ... [2025-03-17 15:30:34,981 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:30:34" (1/1) ... [2025-03-17 15:30:34,983 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:30:34" (1/1) ... [2025-03-17 15:30:34,983 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:30:34" (1/1) ... [2025-03-17 15:30:34,984 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:30:34" (1/1) ... [2025-03-17 15:30:34,984 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:30:34" (1/1) ... [2025-03-17 15:30:34,985 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 15:30:34,986 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 15:30:34,986 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 15:30:34,986 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 15:30:34,986 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:30:34" (1/1) ... [2025-03-17 15:30:34,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 15:30:34,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:30:35,009 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 15:30:35,013 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 15:30:35,027 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 15:30:35,028 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 15:30:35,028 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 15:30:35,028 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 15:30:35,028 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 15:30:35,028 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 15:30:35,028 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-17 15:30:35,028 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-17 15:30:35,065 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 15:30:35,067 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 15:30:35,217 INFO L? ?]: Removed 46 outVars from TransFormulas that were not future-live. [2025-03-17 15:30:35,217 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 15:30:35,228 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 15:30:35,228 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 15:30:35,229 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:30:35 BoogieIcfgContainer [2025-03-17 15:30:35,229 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 15:30:35,230 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 15:30:35,230 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 15:30:35,233 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 15:30:35,234 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 03:30:34" (1/3) ... [2025-03-17 15:30:35,234 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c4ccee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:30:35, skipping insertion in model container [2025-03-17 15:30:35,234 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:30:34" (2/3) ... [2025-03-17 15:30:35,234 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c4ccee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:30:35, skipping insertion in model container [2025-03-17 15:30:35,234 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:30:35" (3/3) ... [2025-03-17 15:30:35,235 INFO L128 eAbstractionObserver]: Analyzing ICFG mannadiv_unwindbound5.c [2025-03-17 15:30:35,244 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 15:30:35,246 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG mannadiv_unwindbound5.c that has 3 procedures, 65 locations, 1 initial locations, 1 loop locations, and 22 error locations. [2025-03-17 15:30:35,287 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 15:30:35,298 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;@723b1c42, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 15:30:35,300 INFO L334 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2025-03-17 15:30:35,303 INFO L276 IsEmpty]: Start isEmpty. Operand has 65 states, 36 states have (on average 1.7777777777777777) internal successors, (64), 58 states have internal predecessors, (64), 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-17 15:30:35,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-17 15:30:35,307 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:30:35,308 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:30:35,308 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-03-17 15:30:35,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:30:35,312 INFO L85 PathProgramCache]: Analyzing trace with hash 969790049, now seen corresponding path program 1 times [2025-03-17 15:30:35,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:30:35,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887864504] [2025-03-17 15:30:35,318 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:30:35,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:30:35,365 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-17 15:30:35,374 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-17 15:30:35,375 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:30:35,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:30:35,403 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-17 15:30:35,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:30:35,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887864504] [2025-03-17 15:30:35,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887864504] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:30:35,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [13058077] [2025-03-17 15:30:35,406 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:30:35,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:30:35,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:30:35,409 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-17 15:30:35,411 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-17 15:30:35,445 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-17 15:30:35,462 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-17 15:30:35,462 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:30:35,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:30:35,464 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 15:30:35,467 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:30:35,476 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-17 15:30:35,478 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 15:30:35,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [13058077] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:30:35,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 15:30:35,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 15:30:35,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993710657] [2025-03-17 15:30:35,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:30:35,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 15:30:35,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:30:35,498 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 15:30:35,499 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 15:30:35,501 INFO L87 Difference]: Start difference. First operand has 65 states, 36 states have (on average 1.7777777777777777) internal successors, (64), 58 states have internal predecessors, (64), 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) 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-17 15:30:35,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:30:35,516 INFO L93 Difference]: Finished difference Result 128 states and 145 transitions. [2025-03-17 15:30:35,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 15:30:35,518 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-17 15:30:35,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:30:35,522 INFO L225 Difference]: With dead ends: 128 [2025-03-17 15:30:35,523 INFO L226 Difference]: Without dead ends: 61 [2025-03-17 15:30:35,526 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-17 15:30:35,529 INFO L435 NwaCegarLoop]: 69 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, 69 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-17 15:30:35,531 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 15:30:35,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2025-03-17 15:30:35,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2025-03-17 15:30:35,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 34 states have (on average 1.7058823529411764) internal successors, (58), 55 states have internal predecessors, (58), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 15:30:35,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 64 transitions. [2025-03-17 15:30:35,563 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 64 transitions. Word has length 14 [2025-03-17 15:30:35,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:30:35,563 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 64 transitions. [2025-03-17 15:30:35,563 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-17 15:30:35,563 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 64 transitions. [2025-03-17 15:30:35,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-17 15:30:35,564 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:30:35,564 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:30:35,571 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 15:30:35,768 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-17 15:30:35,769 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-03-17 15:30:35,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:30:35,769 INFO L85 PathProgramCache]: Analyzing trace with hash -798532159, now seen corresponding path program 1 times [2025-03-17 15:30:35,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:30:35,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340643162] [2025-03-17 15:30:35,770 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:30:35,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:30:35,776 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-17 15:30:35,789 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-17 15:30:35,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:30:35,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:30:35,853 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 15:30:35,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:30:35,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340643162] [2025-03-17 15:30:35,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340643162] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:30:35,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:30:35,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 15:30:35,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860864421] [2025-03-17 15:30:35,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:30:35,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 15:30:35,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:30:35,854 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 15:30:35,854 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 15:30:35,854 INFO L87 Difference]: Start difference. First operand 61 states and 64 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 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-17 15:30:35,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:30:35,921 INFO L93 Difference]: Finished difference Result 75 states and 78 transitions. [2025-03-17 15:30:35,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 15:30:35,924 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 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-17 15:30:35,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:30:35,925 INFO L225 Difference]: With dead ends: 75 [2025-03-17 15:30:35,925 INFO L226 Difference]: Without dead ends: 65 [2025-03-17 15:30:35,925 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 15:30:35,925 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 9 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 15:30:35,926 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 168 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 15:30:35,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2025-03-17 15:30:35,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2025-03-17 15:30:35,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 38 states have (on average 1.631578947368421) internal successors, (62), 59 states have internal predecessors, (62), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 15:30:35,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 68 transitions. [2025-03-17 15:30:35,937 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 68 transitions. Word has length 14 [2025-03-17 15:30:35,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:30:35,938 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 68 transitions. [2025-03-17 15:30:35,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 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-17 15:30:35,939 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 68 transitions. [2025-03-17 15:30:35,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-17 15:30:35,940 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:30:35,941 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:30:35,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 15:30:35,941 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-03-17 15:30:35,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:30:35,942 INFO L85 PathProgramCache]: Analyzing trace with hash 752322576, now seen corresponding path program 1 times [2025-03-17 15:30:35,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:30:35,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983021491] [2025-03-17 15:30:35,942 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:30:35,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:30:35,949 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-17 15:30:35,970 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-17 15:30:35,970 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:30:35,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 15:30:35,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1340579442] [2025-03-17 15:30:35,972 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:30:35,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:30:35,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:30:35,975 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-17 15:30:35,977 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-17 15:30:35,998 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-17 15:30:36,010 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-17 15:30:36,011 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:30:36,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:30:36,011 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 15:30:36,012 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:30:36,033 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 15:30:36,033 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 15:30:36,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:30:36,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983021491] [2025-03-17 15:30:36,034 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-17 15:30:36,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1340579442] [2025-03-17 15:30:36,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1340579442] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:30:36,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:30:36,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 15:30:36,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602373033] [2025-03-17 15:30:36,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:30:36,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 15:30:36,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:30:36,035 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 15:30:36,035 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 15:30:36,035 INFO L87 Difference]: Start difference. First operand 65 states and 68 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 15:30:36,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:30:36,120 INFO L93 Difference]: Finished difference Result 104 states and 116 transitions. [2025-03-17 15:30:36,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 15:30:36,122 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 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 17 [2025-03-17 15:30:36,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:30:36,122 INFO L225 Difference]: With dead ends: 104 [2025-03-17 15:30:36,123 INFO L226 Difference]: Without dead ends: 98 [2025-03-17 15:30:36,124 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 15:30:36,124 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 29 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:30:36,124 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 89 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:30:36,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-03-17 15:30:36,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 88. [2025-03-17 15:30:36,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 60 states have (on average 1.65) internal successors, (99), 81 states have internal predecessors, (99), 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-17 15:30:36,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 107 transitions. [2025-03-17 15:30:36,134 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 107 transitions. Word has length 17 [2025-03-17 15:30:36,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:30:36,135 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 107 transitions. [2025-03-17 15:30:36,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 15:30:36,135 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 107 transitions. [2025-03-17 15:30:36,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-17 15:30:36,135 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:30:36,135 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:30:36,141 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-17 15:30:36,335 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,SelfDestructingSolverStorable2 [2025-03-17 15:30:36,336 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-03-17 15:30:36,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:30:36,337 INFO L85 PathProgramCache]: Analyzing trace with hash 1427490222, now seen corresponding path program 1 times [2025-03-17 15:30:36,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:30:36,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168054106] [2025-03-17 15:30:36,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:30:36,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:30:36,345 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-17 15:30:36,356 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-17 15:30:36,356 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:30:36,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:30:36,457 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 15:30:36,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:30:36,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168054106] [2025-03-17 15:30:36,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168054106] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:30:36,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:30:36,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 15:30:36,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191250805] [2025-03-17 15:30:36,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:30:36,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 15:30:36,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:30:36,460 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 15:30:36,460 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 15:30:36,460 INFO L87 Difference]: Start difference. First operand 88 states and 107 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 15:30:36,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:30:36,573 INFO L93 Difference]: Finished difference Result 138 states and 175 transitions. [2025-03-17 15:30:36,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 15:30:36,573 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 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 19 [2025-03-17 15:30:36,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:30:36,575 INFO L225 Difference]: With dead ends: 138 [2025-03-17 15:30:36,575 INFO L226 Difference]: Without dead ends: 131 [2025-03-17 15:30:36,575 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-17 15:30:36,575 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 28 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:30:36,576 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 108 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:30:36,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2025-03-17 15:30:36,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 124. [2025-03-17 15:30:36,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 94 states have (on average 1.5957446808510638) internal successors, (150), 115 states have internal predecessors, (150), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-17 15:30:36,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 162 transitions. [2025-03-17 15:30:36,591 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 162 transitions. Word has length 19 [2025-03-17 15:30:36,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:30:36,591 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 162 transitions. [2025-03-17 15:30:36,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 15:30:36,592 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 162 transitions. [2025-03-17 15:30:36,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-17 15:30:36,592 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:30:36,592 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:30:36,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 15:30:36,592 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-03-17 15:30:36,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:30:36,593 INFO L85 PathProgramCache]: Analyzing trace with hash 1302523931, now seen corresponding path program 1 times [2025-03-17 15:30:36,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:30:36,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63382561] [2025-03-17 15:30:36,593 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:30:36,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:30:36,596 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-17 15:30:36,601 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-17 15:30:36,601 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:30:36,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:30:36,655 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 15:30:36,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:30:36,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63382561] [2025-03-17 15:30:36,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63382561] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:30:36,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:30:36,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 15:30:36,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768980391] [2025-03-17 15:30:36,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:30:36,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 15:30:36,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:30:36,656 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 15:30:36,656 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 15:30:36,657 INFO L87 Difference]: Start difference. First operand 124 states and 162 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 15:30:36,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:30:36,818 INFO L93 Difference]: Finished difference Result 135 states and 165 transitions. [2025-03-17 15:30:36,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 15:30:36,818 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 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 20 [2025-03-17 15:30:36,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:30:36,819 INFO L225 Difference]: With dead ends: 135 [2025-03-17 15:30:36,819 INFO L226 Difference]: Without dead ends: 126 [2025-03-17 15:30:36,819 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-17 15:30:36,820 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 29 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 15:30:36,820 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 112 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 15:30:36,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2025-03-17 15:30:36,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 120. [2025-03-17 15:30:36,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 90 states have (on average 1.5666666666666667) internal successors, (141), 111 states have internal predecessors, (141), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-17 15:30:36,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 153 transitions. [2025-03-17 15:30:36,832 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 153 transitions. Word has length 20 [2025-03-17 15:30:36,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:30:36,832 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 153 transitions. [2025-03-17 15:30:36,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 15:30:36,833 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 153 transitions. [2025-03-17 15:30:36,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-17 15:30:36,833 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:30:36,833 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:30:36,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 15:30:36,834 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-03-17 15:30:36,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:30:36,834 INFO L85 PathProgramCache]: Analyzing trace with hash 1723536204, now seen corresponding path program 1 times [2025-03-17 15:30:36,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:30:36,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643783681] [2025-03-17 15:30:36,834 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:30:36,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:30:36,838 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-17 15:30:36,846 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-17 15:30:36,846 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:30:36,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:30:36,982 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 15:30:36,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:30:36,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643783681] [2025-03-17 15:30:36,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [643783681] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:30:36,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [13554132] [2025-03-17 15:30:36,983 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:30:36,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:30:36,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:30:36,985 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-17 15:30:36,986 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-17 15:30:37,009 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-17 15:30:37,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-17 15:30:37,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:30:37,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:30:37,019 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 15:30:37,020 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:30:37,142 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 15:30:37,143 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 15:30:37,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [13554132] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:30:37,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 15:30:37,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2025-03-17 15:30:37,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449076249] [2025-03-17 15:30:37,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:30:37,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 15:30:37,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:30:37,144 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 15:30:37,144 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-17 15:30:37,144 INFO L87 Difference]: Start difference. First operand 120 states and 153 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 15:30:37,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:30:37,249 INFO L93 Difference]: Finished difference Result 123 states and 157 transitions. [2025-03-17 15:30:37,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 15:30:37,249 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 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 21 [2025-03-17 15:30:37,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:30:37,250 INFO L225 Difference]: With dead ends: 123 [2025-03-17 15:30:37,250 INFO L226 Difference]: Without dead ends: 122 [2025-03-17 15:30:37,250 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-03-17 15:30:37,251 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 81 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:30:37,251 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 73 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:30:37,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2025-03-17 15:30:37,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 120. [2025-03-17 15:30:37,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 90 states have (on average 1.5555555555555556) internal successors, (140), 111 states have internal predecessors, (140), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-17 15:30:37,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 152 transitions. [2025-03-17 15:30:37,265 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 152 transitions. Word has length 21 [2025-03-17 15:30:37,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:30:37,266 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 152 transitions. [2025-03-17 15:30:37,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 15:30:37,266 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 152 transitions. [2025-03-17 15:30:37,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-17 15:30:37,266 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:30:37,266 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:30:37,273 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-17 15:30:37,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:30:37,471 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-03-17 15:30:37,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:30:37,472 INFO L85 PathProgramCache]: Analyzing trace with hash 1890014777, now seen corresponding path program 1 times [2025-03-17 15:30:37,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:30:37,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619223863] [2025-03-17 15:30:37,472 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:30:37,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:30:37,475 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-17 15:30:37,485 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-17 15:30:37,485 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:30:37,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 15:30:37,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [83797833] [2025-03-17 15:30:37,486 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:30:37,486 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:30:37,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:30:37,493 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-17 15:30:37,496 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-17 15:30:37,514 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-17 15:30:37,522 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-17 15:30:37,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:30:37,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:30:37,523 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 15:30:37,524 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:30:37,610 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 15:30:37,611 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 15:30:37,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:30:37,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619223863] [2025-03-17 15:30:37,611 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-17 15:30:37,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [83797833] [2025-03-17 15:30:37,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [83797833] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:30:37,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:30:37,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 15:30:37,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067037766] [2025-03-17 15:30:37,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:30:37,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 15:30:37,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:30:37,612 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 15:30:37,612 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 15:30:37,613 INFO L87 Difference]: Start difference. First operand 120 states and 152 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 15:30:37,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:30:37,706 INFO L93 Difference]: Finished difference Result 121 states and 152 transitions. [2025-03-17 15:30:37,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 15:30:37,706 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 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 22 [2025-03-17 15:30:37,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:30:37,707 INFO L225 Difference]: With dead ends: 121 [2025-03-17 15:30:37,707 INFO L226 Difference]: Without dead ends: 120 [2025-03-17 15:30:37,707 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 15:30:37,708 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 74 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:30:37,708 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 78 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:30:37,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2025-03-17 15:30:37,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2025-03-17 15:30:37,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 90 states have (on average 1.5444444444444445) internal successors, (139), 111 states have internal predecessors, (139), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-17 15:30:37,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 151 transitions. [2025-03-17 15:30:37,714 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 151 transitions. Word has length 22 [2025-03-17 15:30:37,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:30:37,715 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 151 transitions. [2025-03-17 15:30:37,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 15:30:37,715 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 151 transitions. [2025-03-17 15:30:37,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-17 15:30:37,715 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:30:37,715 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] [2025-03-17 15:30:37,721 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-17 15:30:37,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:30:37,916 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-03-17 15:30:37,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:30:37,917 INFO L85 PathProgramCache]: Analyzing trace with hash 117501827, now seen corresponding path program 1 times [2025-03-17 15:30:37,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:30:37,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890563148] [2025-03-17 15:30:37,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:30:37,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:30:37,920 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-17 15:30:37,924 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-17 15:30:37,925 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:30:37,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:30:37,997 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 15:30:37,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:30:37,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890563148] [2025-03-17 15:30:37,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890563148] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:30:37,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1401893131] [2025-03-17 15:30:37,998 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:30:37,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:30:37,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:30:38,000 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 15:30:38,001 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-17 15:30:38,022 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-17 15:30:38,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-17 15:30:38,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:30:38,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:30:38,032 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-17 15:30:38,033 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:30:38,066 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 15:30:38,067 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:30:38,158 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 15:30:38,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1401893131] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:30:38,158 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 15:30:38,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2025-03-17 15:30:38,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745754146] [2025-03-17 15:30:38,158 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 15:30:38,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 15:30:38,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:30:38,159 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 15:30:38,159 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-17 15:30:38,159 INFO L87 Difference]: Start difference. First operand 120 states and 151 transitions. Second operand has 9 states, 8 states have (on average 6.0) internal successors, (48), 7 states have internal predecessors, (48), 5 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-17 15:30:38,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:30:38,256 INFO L93 Difference]: Finished difference Result 191 states and 238 transitions. [2025-03-17 15:30:38,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 15:30:38,258 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.0) internal successors, (48), 7 states have internal predecessors, (48), 5 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) Word has length 34 [2025-03-17 15:30:38,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:30:38,259 INFO L225 Difference]: With dead ends: 191 [2025-03-17 15:30:38,259 INFO L226 Difference]: Without dead ends: 189 [2025-03-17 15:30:38,260 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-03-17 15:30:38,260 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 150 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:30:38,261 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 242 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:30:38,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2025-03-17 15:30:38,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 167. [2025-03-17 15:30:38,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 135 states have (on average 1.548148148148148) internal successors, (209), 156 states have internal predecessors, (209), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-17 15:30:38,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 225 transitions. [2025-03-17 15:30:38,276 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 225 transitions. Word has length 34 [2025-03-17 15:30:38,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:30:38,277 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 225 transitions. [2025-03-17 15:30:38,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.0) internal successors, (48), 7 states have internal predecessors, (48), 5 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-17 15:30:38,277 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 225 transitions. [2025-03-17 15:30:38,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-17 15:30:38,277 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:30:38,278 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:30:38,284 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-17 15:30:38,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:30:38,478 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-03-17 15:30:38,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:30:38,479 INFO L85 PathProgramCache]: Analyzing trace with hash -652410679, now seen corresponding path program 1 times [2025-03-17 15:30:38,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:30:38,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238988540] [2025-03-17 15:30:38,479 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:30:38,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:30:38,483 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-17 15:30:38,487 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-17 15:30:38,487 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:30:38,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:30:38,516 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 15:30:38,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:30:38,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238988540] [2025-03-17 15:30:38,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238988540] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:30:38,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:30:38,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 15:30:38,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948829480] [2025-03-17 15:30:38,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:30:38,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 15:30:38,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:30:38,517 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 15:30:38,517 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 15:30:38,517 INFO L87 Difference]: Start difference. First operand 167 states and 225 transitions. Second operand has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 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-17 15:30:38,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:30:38,550 INFO L93 Difference]: Finished difference Result 177 states and 234 transitions. [2025-03-17 15:30:38,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 15:30:38,551 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 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 35 [2025-03-17 15:30:38,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:30:38,552 INFO L225 Difference]: With dead ends: 177 [2025-03-17 15:30:38,552 INFO L226 Difference]: Without dead ends: 175 [2025-03-17 15:30:38,552 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 15:30:38,552 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 80 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 15:30:38,552 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 76 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 15:30:38,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2025-03-17 15:30:38,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 165. [2025-03-17 15:30:38,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 135 states have (on average 1.511111111111111) internal successors, (204), 154 states have internal predecessors, (204), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-17 15:30:38,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 220 transitions. [2025-03-17 15:30:38,562 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 220 transitions. Word has length 35 [2025-03-17 15:30:38,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:30:38,562 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 220 transitions. [2025-03-17 15:30:38,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 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-17 15:30:38,562 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 220 transitions. [2025-03-17 15:30:38,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-17 15:30:38,563 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:30:38,563 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-17 15:30:38,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 15:30:38,563 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-03-17 15:30:38,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:30:38,563 INFO L85 PathProgramCache]: Analyzing trace with hash 98563431, now seen corresponding path program 1 times [2025-03-17 15:30:38,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:30:38,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451999072] [2025-03-17 15:30:38,563 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:30:38,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:30:38,567 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-17 15:30:38,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-17 15:30:38,569 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:30:38,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:30:38,642 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 15:30:38,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:30:38,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451999072] [2025-03-17 15:30:38,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [451999072] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:30:38,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1219043969] [2025-03-17 15:30:38,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:30:38,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:30:38,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:30:38,645 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 15:30:38,647 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-17 15:30:38,665 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-17 15:30:38,674 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-17 15:30:38,674 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:30:38,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:30:38,675 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 15:30:38,676 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:30:38,727 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 15:30:38,728 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 15:30:38,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1219043969] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:30:38,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 15:30:38,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2025-03-17 15:30:38,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571373897] [2025-03-17 15:30:38,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:30:38,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 15:30:38,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:30:38,729 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 15:30:38,731 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-03-17 15:30:38,731 INFO L87 Difference]: Start difference. First operand 165 states and 220 transitions. Second operand has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-17 15:30:38,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:30:38,754 INFO L93 Difference]: Finished difference Result 165 states and 220 transitions. [2025-03-17 15:30:38,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 15:30:38,755 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 37 [2025-03-17 15:30:38,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:30:38,756 INFO L225 Difference]: With dead ends: 165 [2025-03-17 15:30:38,757 INFO L226 Difference]: Without dead ends: 164 [2025-03-17 15:30:38,758 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-03-17 15:30:38,758 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 42 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 109 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-17 15:30:38,758 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 109 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 15:30:38,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2025-03-17 15:30:38,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2025-03-17 15:30:38,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 135 states have (on average 1.474074074074074) internal successors, (199), 153 states have internal predecessors, (199), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-17 15:30:38,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 215 transitions. [2025-03-17 15:30:38,767 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 215 transitions. Word has length 37 [2025-03-17 15:30:38,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:30:38,767 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 215 transitions. [2025-03-17 15:30:38,767 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-17 15:30:38,768 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 215 transitions. [2025-03-17 15:30:38,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-17 15:30:38,768 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:30:38,768 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-17 15:30:38,775 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-17 15:30:38,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:30:38,969 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-03-17 15:30:38,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:30:38,969 INFO L85 PathProgramCache]: Analyzing trace with hash -1239500916, now seen corresponding path program 1 times [2025-03-17 15:30:38,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:30:38,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472938997] [2025-03-17 15:30:38,970 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:30:38,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:30:38,973 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-17 15:30:38,976 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-17 15:30:38,976 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:30:38,976 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:30:39,024 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 15:30:39,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:30:39,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472938997] [2025-03-17 15:30:39,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472938997] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:30:39,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1459864890] [2025-03-17 15:30:39,025 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:30:39,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:30:39,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:30:39,027 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 15:30:39,029 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-17 15:30:39,049 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-17 15:30:39,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-17 15:30:39,059 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:30:39,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:30:39,059 INFO L256 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 15:30:39,060 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:30:39,099 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 15:30:39,100 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 15:30:39,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1459864890] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:30:39,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 15:30:39,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2025-03-17 15:30:39,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349790347] [2025-03-17 15:30:39,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:30:39,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 15:30:39,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:30:39,101 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 15:30:39,101 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-03-17 15:30:39,101 INFO L87 Difference]: Start difference. First operand 164 states and 215 transitions. Second operand has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-17 15:30:39,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:30:39,140 INFO L93 Difference]: Finished difference Result 174 states and 224 transitions. [2025-03-17 15:30:39,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 15:30:39,142 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 38 [2025-03-17 15:30:39,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:30:39,143 INFO L225 Difference]: With dead ends: 174 [2025-03-17 15:30:39,143 INFO L226 Difference]: Without dead ends: 173 [2025-03-17 15:30:39,143 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-17 15:30:39,143 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 39 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 15:30:39,143 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 185 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 15:30:39,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2025-03-17 15:30:39,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 163. [2025-03-17 15:30:39,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 135 states have (on average 1.4370370370370371) internal successors, (194), 152 states have internal predecessors, (194), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-17 15:30:39,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 210 transitions. [2025-03-17 15:30:39,151 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 210 transitions. Word has length 38 [2025-03-17 15:30:39,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:30:39,151 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 210 transitions. [2025-03-17 15:30:39,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-17 15:30:39,151 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 210 transitions. [2025-03-17 15:30:39,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-17 15:30:39,152 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:30:39,152 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-17 15:30:39,158 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-17 15:30:39,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:30:39,353 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-03-17 15:30:39,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:30:39,353 INFO L85 PathProgramCache]: Analyzing trace with hash -1454438748, now seen corresponding path program 1 times [2025-03-17 15:30:39,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:30:39,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418507168] [2025-03-17 15:30:39,353 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:30:39,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:30:39,356 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-17 15:30:39,360 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-17 15:30:39,361 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:30:39,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:30:39,429 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 15:30:39,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:30:39,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418507168] [2025-03-17 15:30:39,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418507168] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:30:39,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1275275771] [2025-03-17 15:30:39,429 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:30:39,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:30:39,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:30:39,431 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 15:30:39,433 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-17 15:30:39,453 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-17 15:30:39,466 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-17 15:30:39,466 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:30:39,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:30:39,467 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 15:30:39,468 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:30:39,535 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 15:30:39,535 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:30:39,599 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 15:30:39,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1275275771] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:30:39,599 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 15:30:39,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 6] total 13 [2025-03-17 15:30:39,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686307679] [2025-03-17 15:30:39,599 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 15:30:39,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 15:30:39,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:30:39,600 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 15:30:39,600 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2025-03-17 15:30:39,600 INFO L87 Difference]: Start difference. First operand 163 states and 210 transitions. Second operand has 13 states, 13 states have (on average 5.153846153846154) internal successors, (67), 13 states have internal predecessors, (67), 5 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2025-03-17 15:30:39,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:30:39,689 INFO L93 Difference]: Finished difference Result 305 states and 362 transitions. [2025-03-17 15:30:39,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-17 15:30:39,689 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.153846153846154) internal successors, (67), 13 states have internal predecessors, (67), 5 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) Word has length 40 [2025-03-17 15:30:39,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:30:39,690 INFO L225 Difference]: With dead ends: 305 [2025-03-17 15:30:39,690 INFO L226 Difference]: Without dead ends: 293 [2025-03-17 15:30:39,691 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=114, Invalid=228, Unknown=0, NotChecked=0, Total=342 [2025-03-17 15:30:39,691 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 103 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 15:30:39,691 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 342 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 15:30:39,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2025-03-17 15:30:39,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 251. [2025-03-17 15:30:39,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 217 states have (on average 1.4101382488479262) internal successors, (306), 234 states have internal predecessors, (306), 11 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-17 15:30:39,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 328 transitions. [2025-03-17 15:30:39,702 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 328 transitions. Word has length 40 [2025-03-17 15:30:39,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:30:39,702 INFO L471 AbstractCegarLoop]: Abstraction has 251 states and 328 transitions. [2025-03-17 15:30:39,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.153846153846154) internal successors, (67), 13 states have internal predecessors, (67), 5 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2025-03-17 15:30:39,702 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 328 transitions. [2025-03-17 15:30:39,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-17 15:30:39,702 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:30:39,702 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-17 15:30:39,708 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-17 15:30:39,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-17 15:30:39,907 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-03-17 15:30:39,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:30:39,907 INFO L85 PathProgramCache]: Analyzing trace with hash -1454438742, now seen corresponding path program 1 times [2025-03-17 15:30:39,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:30:39,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924450854] [2025-03-17 15:30:39,907 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:30:39,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:30:39,911 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-17 15:30:39,922 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-17 15:30:39,922 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:30:39,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 15:30:39,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [392700144] [2025-03-17 15:30:39,922 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:30:39,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:30:39,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:30:39,924 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 15:30:39,926 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-17 15:30:39,944 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-17 15:30:39,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-17 15:30:39,953 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:30:39,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:30:39,953 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 15:30:39,955 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:30:40,068 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 15:30:40,069 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:30:40,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:30:40,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924450854] [2025-03-17 15:30:40,209 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-17 15:30:40,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [392700144] [2025-03-17 15:30:40,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [392700144] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:30:40,209 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-17 15:30:40,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2025-03-17 15:30:40,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182367783] [2025-03-17 15:30:40,209 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-17 15:30:40,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 15:30:40,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:30:40,210 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 15:30:40,210 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-03-17 15:30:40,210 INFO L87 Difference]: Start difference. First operand 251 states and 328 transitions. Second operand has 6 states, 5 states have (on average 6.2) internal successors, (31), 6 states have internal predecessors, (31), 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-17 15:30:40,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:30:40,335 INFO L93 Difference]: Finished difference Result 258 states and 331 transitions. [2025-03-17 15:30:40,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 15:30:40,336 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.2) internal successors, (31), 6 states have internal predecessors, (31), 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 40 [2025-03-17 15:30:40,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:30:40,338 INFO L225 Difference]: With dead ends: 258 [2025-03-17 15:30:40,338 INFO L226 Difference]: Without dead ends: 251 [2025-03-17 15:30:40,338 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2025-03-17 15:30:40,338 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 43 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:30:40,339 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 77 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:30:40,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2025-03-17 15:30:40,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 247. [2025-03-17 15:30:40,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 218 states have (on average 1.3073394495412844) internal successors, (285), 230 states have internal predecessors, (285), 11 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-17 15:30:40,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 307 transitions. [2025-03-17 15:30:40,351 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 307 transitions. Word has length 40 [2025-03-17 15:30:40,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:30:40,351 INFO L471 AbstractCegarLoop]: Abstraction has 247 states and 307 transitions. [2025-03-17 15:30:40,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.2) internal successors, (31), 6 states have internal predecessors, (31), 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-17 15:30:40,351 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 307 transitions. [2025-03-17 15:30:40,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-17 15:30:40,352 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:30:40,352 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-17 15:30:40,359 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-17 15:30:40,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-17 15:30:40,557 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-03-17 15:30:40,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:30:40,558 INFO L85 PathProgramCache]: Analyzing trace with hash -2137928029, now seen corresponding path program 1 times [2025-03-17 15:30:40,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:30:40,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966472860] [2025-03-17 15:30:40,558 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:30:40,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:30:40,562 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-17 15:30:40,568 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-17 15:30:40,568 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:30:40,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 15:30:40,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [501049075] [2025-03-17 15:30:40,569 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:30:40,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:30:40,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:30:40,572 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 15:30:40,574 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-17 15:30:40,593 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-17 15:30:40,603 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-17 15:30:40,603 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:30:40,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:30:40,604 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 15:30:40,605 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:30:40,723 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 15:30:40,723 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:30:40,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:30:40,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966472860] [2025-03-17 15:30:40,893 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-17 15:30:40,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [501049075] [2025-03-17 15:30:40,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [501049075] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:30:40,893 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-17 15:30:40,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2025-03-17 15:30:40,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419546589] [2025-03-17 15:30:40,893 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-17 15:30:40,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 15:30:40,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:30:40,893 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 15:30:40,894 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-03-17 15:30:40,894 INFO L87 Difference]: Start difference. First operand 247 states and 307 transitions. Second operand has 6 states, 5 states have (on average 6.4) internal successors, (32), 6 states have internal predecessors, (32), 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-17 15:30:40,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:30:40,996 INFO L93 Difference]: Finished difference Result 335 states and 415 transitions. [2025-03-17 15:30:40,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 15:30:40,996 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.4) internal successors, (32), 6 states have internal predecessors, (32), 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 41 [2025-03-17 15:30:40,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:30:40,997 INFO L225 Difference]: With dead ends: 335 [2025-03-17 15:30:40,998 INFO L226 Difference]: Without dead ends: 330 [2025-03-17 15:30:40,998 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-03-17 15:30:40,998 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 102 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:30:40,998 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 128 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:30:40,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2025-03-17 15:30:41,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 314. [2025-03-17 15:30:41,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 314 states, 282 states have (on average 1.2872340425531914) internal successors, (363), 294 states have internal predecessors, (363), 14 states have call successors, (14), 5 states have call predecessors, (14), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-17 15:30:41,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 391 transitions. [2025-03-17 15:30:41,008 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 391 transitions. Word has length 41 [2025-03-17 15:30:41,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:30:41,008 INFO L471 AbstractCegarLoop]: Abstraction has 314 states and 391 transitions. [2025-03-17 15:30:41,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.4) internal successors, (32), 6 states have internal predecessors, (32), 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-17 15:30:41,008 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 391 transitions. [2025-03-17 15:30:41,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-17 15:30:41,009 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:30:41,009 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-17 15:30:41,015 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-17 15:30:41,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-17 15:30:41,209 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-03-17 15:30:41,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:30:41,210 INFO L85 PathProgramCache]: Analyzing trace with hash -1007179481, now seen corresponding path program 1 times [2025-03-17 15:30:41,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:30:41,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923440684] [2025-03-17 15:30:41,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:30:41,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:30:41,212 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-17 15:30:41,216 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-17 15:30:41,216 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:30:41,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:30:41,290 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 15:30:41,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:30:41,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923440684] [2025-03-17 15:30:41,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923440684] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:30:41,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [766264779] [2025-03-17 15:30:41,290 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:30:41,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:30:41,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:30:41,292 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 15:30:41,294 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-17 15:30:41,312 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-17 15:30:41,321 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-17 15:30:41,321 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:30:41,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:30:41,322 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 15:30:41,322 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:30:41,419 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 15:30:41,419 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 15:30:41,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [766264779] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:30:41,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 15:30:41,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 7 [2025-03-17 15:30:41,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119064038] [2025-03-17 15:30:41,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:30:41,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 15:30:41,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:30:41,420 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 15:30:41,420 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-03-17 15:30:41,420 INFO L87 Difference]: Start difference. First operand 314 states and 391 transitions. Second operand has 5 states, 4 states have (on average 8.25) internal successors, (33), 5 states have internal predecessors, (33), 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-17 15:30:41,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:30:41,503 INFO L93 Difference]: Finished difference Result 314 states and 391 transitions. [2025-03-17 15:30:41,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 15:30:41,504 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.25) internal successors, (33), 5 states have internal predecessors, (33), 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 42 [2025-03-17 15:30:41,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:30:41,505 INFO L225 Difference]: With dead ends: 314 [2025-03-17 15:30:41,505 INFO L226 Difference]: Without dead ends: 312 [2025-03-17 15:30:41,505 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-03-17 15:30:41,506 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 32 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:30:41,506 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 77 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:30:41,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2025-03-17 15:30:41,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 309. [2025-03-17 15:30:41,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 279 states have (on average 1.2759856630824373) internal successors, (356), 289 states have internal predecessors, (356), 14 states have call successors, (14), 5 states have call predecessors, (14), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-17 15:30:41,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 384 transitions. [2025-03-17 15:30:41,528 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 384 transitions. Word has length 42 [2025-03-17 15:30:41,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:30:41,528 INFO L471 AbstractCegarLoop]: Abstraction has 309 states and 384 transitions. [2025-03-17 15:30:41,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.25) internal successors, (33), 5 states have internal predecessors, (33), 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-17 15:30:41,529 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 384 transitions. [2025-03-17 15:30:41,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-17 15:30:41,529 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:30:41,529 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-17 15:30:41,535 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-17 15:30:41,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-17 15:30:41,730 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-03-17 15:30:41,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:30:41,730 INFO L85 PathProgramCache]: Analyzing trace with hash -1157792830, now seen corresponding path program 1 times [2025-03-17 15:30:41,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:30:41,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458727803] [2025-03-17 15:30:41,731 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:30:41,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:30:41,735 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-17 15:30:41,740 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-17 15:30:41,741 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:30:41,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:30:41,889 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 15:30:41,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:30:41,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458727803] [2025-03-17 15:30:41,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458727803] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:30:41,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1817797260] [2025-03-17 15:30:41,890 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:30:41,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:30:41,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:30:41,892 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 15:30:41,894 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-17 15:30:41,913 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-17 15:30:41,922 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-17 15:30:41,922 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:30:41,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:30:41,923 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 15:30:41,924 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:30:41,997 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 15:30:41,998 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:30:42,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1817797260] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:30:42,086 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 15:30:42,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 3] total 11 [2025-03-17 15:30:42,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379437405] [2025-03-17 15:30:42,087 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 15:30:42,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 15:30:42,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:30:42,087 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 15:30:42,087 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2025-03-17 15:30:42,088 INFO L87 Difference]: Start difference. First operand 309 states and 384 transitions. Second operand has 12 states, 11 states have (on average 5.818181818181818) internal successors, (64), 11 states have internal predecessors, (64), 4 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-17 15:30:42,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:30:42,473 INFO L93 Difference]: Finished difference Result 332 states and 399 transitions. [2025-03-17 15:30:42,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-17 15:30:42,473 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.818181818181818) internal successors, (64), 11 states have internal predecessors, (64), 4 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 43 [2025-03-17 15:30:42,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:30:42,474 INFO L225 Difference]: With dead ends: 332 [2025-03-17 15:30:42,474 INFO L226 Difference]: Without dead ends: 313 [2025-03-17 15:30:42,475 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=182, Invalid=468, Unknown=0, NotChecked=0, Total=650 [2025-03-17 15:30:42,475 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 138 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 15:30:42,475 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 190 Invalid, 378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 15:30:42,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2025-03-17 15:30:42,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 297. [2025-03-17 15:30:42,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 267 states have (on average 1.2134831460674158) internal successors, (324), 278 states have internal predecessors, (324), 14 states have call successors, (14), 5 states have call predecessors, (14), 5 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-17 15:30:42,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 352 transitions. [2025-03-17 15:30:42,487 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 352 transitions. Word has length 43 [2025-03-17 15:30:42,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:30:42,487 INFO L471 AbstractCegarLoop]: Abstraction has 297 states and 352 transitions. [2025-03-17 15:30:42,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.818181818181818) internal successors, (64), 11 states have internal predecessors, (64), 4 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-17 15:30:42,487 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 352 transitions. [2025-03-17 15:30:42,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-17 15:30:42,487 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:30:42,487 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-17 15:30:42,493 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-03-17 15:30:42,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-17 15:30:42,688 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-03-17 15:30:42,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:30:42,688 INFO L85 PathProgramCache]: Analyzing trace with hash -943868698, now seen corresponding path program 1 times [2025-03-17 15:30:42,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:30:42,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979352228] [2025-03-17 15:30:42,689 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:30:42,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:30:42,695 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-17 15:30:42,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-17 15:30:42,701 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:30:42,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:30:42,804 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 15:30:42,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:30:42,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979352228] [2025-03-17 15:30:42,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979352228] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:30:42,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [40495972] [2025-03-17 15:30:42,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:30:42,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:30:42,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:30:42,806 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 15:30:42,809 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-17 15:30:42,825 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-17 15:30:42,834 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-17 15:30:42,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:30:42,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:30:42,835 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-17 15:30:42,836 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:30:42,938 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 15:30:42,938 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:30:43,125 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 15:30:43,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [40495972] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:30:43,125 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 15:30:43,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2025-03-17 15:30:43,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761683160] [2025-03-17 15:30:43,126 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 15:30:43,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-17 15:30:43,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:30:43,127 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-17 15:30:43,127 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2025-03-17 15:30:43,127 INFO L87 Difference]: Start difference. First operand 297 states and 352 transitions. Second operand has 17 states, 16 states have (on average 4.0) internal successors, (64), 16 states have internal predecessors, (64), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 15:30:43,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:30:43,416 INFO L93 Difference]: Finished difference Result 302 states and 354 transitions. [2025-03-17 15:30:43,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-17 15:30:43,417 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 4.0) internal successors, (64), 16 states have internal predecessors, (64), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 44 [2025-03-17 15:30:43,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:30:43,419 INFO L225 Difference]: With dead ends: 302 [2025-03-17 15:30:43,419 INFO L226 Difference]: Without dead ends: 299 [2025-03-17 15:30:43,419 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 75 SyntacticMatches, 5 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=159, Invalid=491, Unknown=0, NotChecked=0, Total=650 [2025-03-17 15:30:43,420 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 136 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 293 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 15:30:43,420 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 194 Invalid, 313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 293 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 15:30:43,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2025-03-17 15:30:43,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 294. [2025-03-17 15:30:43,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 267 states have (on average 1.149812734082397) internal successors, (307), 275 states have internal predecessors, (307), 14 states have call successors, (14), 5 states have call predecessors, (14), 5 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-17 15:30:43,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 335 transitions. [2025-03-17 15:30:43,432 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 335 transitions. Word has length 44 [2025-03-17 15:30:43,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:30:43,432 INFO L471 AbstractCegarLoop]: Abstraction has 294 states and 335 transitions. [2025-03-17 15:30:43,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 4.0) internal successors, (64), 16 states have internal predecessors, (64), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 15:30:43,432 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 335 transitions. [2025-03-17 15:30:43,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-17 15:30:43,432 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:30:43,433 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-17 15:30:43,438 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-03-17 15:30:43,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-17 15:30:43,637 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-03-17 15:30:43,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:30:43,637 INFO L85 PathProgramCache]: Analyzing trace with hash 804841439, now seen corresponding path program 1 times [2025-03-17 15:30:43,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:30:43,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731044689] [2025-03-17 15:30:43,637 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:30:43,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:30:43,640 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-17 15:30:43,645 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-17 15:30:43,646 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:30:43,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 15:30:43,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [213523823] [2025-03-17 15:30:43,646 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:30:43,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:30:43,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:30:43,648 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 15:30:43,651 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-17 15:30:43,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-17 15:30:43,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-17 15:30:43,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:30:43,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:30:43,679 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-17 15:30:43,680 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:30:43,842 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 15:30:43,842 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:30:43,931 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 15:30:43,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:30:43,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731044689] [2025-03-17 15:30:43,931 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-17 15:30:43,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [213523823] [2025-03-17 15:30:43,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [213523823] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:30:43,932 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 15:30:43,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2025-03-17 15:30:43,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628514894] [2025-03-17 15:30:43,932 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 15:30:43,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 15:30:43,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:30:43,932 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 15:30:43,933 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-03-17 15:30:43,933 INFO L87 Difference]: Start difference. First operand 294 states and 335 transitions. Second operand has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 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-17 15:30:44,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:30:44,148 INFO L93 Difference]: Finished difference Result 394 states and 449 transitions. [2025-03-17 15:30:44,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 15:30:44,149 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 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 45 [2025-03-17 15:30:44,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:30:44,150 INFO L225 Difference]: With dead ends: 394 [2025-03-17 15:30:44,150 INFO L226 Difference]: Without dead ends: 274 [2025-03-17 15:30:44,152 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 78 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=228, Unknown=0, NotChecked=0, Total=306 [2025-03-17 15:30:44,152 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 104 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:30:44,152 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 112 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:30:44,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2025-03-17 15:30:44,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 272. [2025-03-17 15:30:44,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 247 states have (on average 1.1093117408906883) internal successors, (274), 254 states have internal predecessors, (274), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-17 15:30:44,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 300 transitions. [2025-03-17 15:30:44,167 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 300 transitions. Word has length 45 [2025-03-17 15:30:44,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:30:44,167 INFO L471 AbstractCegarLoop]: Abstraction has 272 states and 300 transitions. [2025-03-17 15:30:44,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 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-17 15:30:44,167 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 300 transitions. [2025-03-17 15:30:44,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-17 15:30:44,168 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:30:44,168 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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] [2025-03-17 15:30:44,174 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-03-17 15:30:44,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:30:44,373 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-03-17 15:30:44,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:30:44,374 INFO L85 PathProgramCache]: Analyzing trace with hash 318611261, now seen corresponding path program 2 times [2025-03-17 15:30:44,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:30:44,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040882805] [2025-03-17 15:30:44,374 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 15:30:44,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:30:44,379 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 64 statements into 2 equivalence classes. [2025-03-17 15:30:44,387 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 64 of 64 statements. [2025-03-17 15:30:44,387 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 15:30:44,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 15:30:44,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [525653412] [2025-03-17 15:30:44,389 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 15:30:44,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:30:44,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:30:44,391 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 15:30:44,392 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-17 15:30:44,410 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 64 statements into 2 equivalence classes. [2025-03-17 15:30:44,423 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 64 of 64 statements. [2025-03-17 15:30:44,423 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 15:30:44,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:30:44,424 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-17 15:30:44,426 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:30:44,554 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-17 15:30:44,554 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:30:44,746 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-17 15:30:44,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:30:44,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040882805] [2025-03-17 15:30:44,747 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-17 15:30:44,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [525653412] [2025-03-17 15:30:44,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [525653412] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:30:44,747 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 15:30:44,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2025-03-17 15:30:44,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332200271] [2025-03-17 15:30:44,747 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 15:30:44,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 15:30:44,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:30:44,749 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 15:30:44,749 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-03-17 15:30:44,749 INFO L87 Difference]: Start difference. First operand 272 states and 300 transitions. Second operand has 10 states, 9 states have (on average 10.333333333333334) internal successors, (93), 10 states have internal predecessors, (93), 5 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-17 15:30:45,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:30:45,118 INFO L93 Difference]: Finished difference Result 441 states and 506 transitions. [2025-03-17 15:30:45,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-17 15:30:45,119 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 10.333333333333334) internal successors, (93), 10 states have internal predecessors, (93), 5 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 64 [2025-03-17 15:30:45,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:30:45,120 INFO L225 Difference]: With dead ends: 441 [2025-03-17 15:30:45,120 INFO L226 Difference]: Without dead ends: 428 [2025-03-17 15:30:45,120 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2025-03-17 15:30:45,120 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 161 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 15:30:45,121 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 287 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 347 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 15:30:45,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2025-03-17 15:30:45,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 390. [2025-03-17 15:30:45,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 359 states have (on average 1.128133704735376) internal successors, (405), 366 states have internal predecessors, (405), 19 states have call successors, (19), 5 states have call predecessors, (19), 5 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-17 15:30:45,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 443 transitions. [2025-03-17 15:30:45,137 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 443 transitions. Word has length 64 [2025-03-17 15:30:45,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:30:45,137 INFO L471 AbstractCegarLoop]: Abstraction has 390 states and 443 transitions. [2025-03-17 15:30:45,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 10.333333333333334) internal successors, (93), 10 states have internal predecessors, (93), 5 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-17 15:30:45,138 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 443 transitions. [2025-03-17 15:30:45,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-17 15:30:45,138 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:30:45,138 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:30:45,144 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-03-17 15:30:45,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:30:45,339 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-03-17 15:30:45,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:30:45,339 INFO L85 PathProgramCache]: Analyzing trace with hash 1539851055, now seen corresponding path program 1 times [2025-03-17 15:30:45,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:30:45,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354236282] [2025-03-17 15:30:45,339 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:30:45,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:30:45,342 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-17 15:30:45,346 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-17 15:30:45,346 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:30:45,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:30:45,397 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 47 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-17 15:30:45,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:30:45,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354236282] [2025-03-17 15:30:45,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354236282] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:30:45,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1944620986] [2025-03-17 15:30:45,397 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:30:45,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:30:45,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:30:45,399 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 15:30:45,401 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-03-17 15:30:45,424 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-17 15:30:45,438 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-17 15:30:45,438 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:30:45,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:30:45,439 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 15:30:45,440 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:30:45,496 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 47 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-17 15:30:45,496 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:30:45,563 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 47 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-17 15:30:45,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1944620986] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:30:45,563 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 15:30:45,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2025-03-17 15:30:45,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437161168] [2025-03-17 15:30:45,563 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 15:30:45,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 15:30:45,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:30:45,564 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 15:30:45,564 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2025-03-17 15:30:45,564 INFO L87 Difference]: Start difference. First operand 390 states and 443 transitions. Second operand has 9 states, 8 states have (on average 15.5) internal successors, (124), 9 states have internal predecessors, (124), 8 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2025-03-17 15:30:45,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:30:45,699 INFO L93 Difference]: Finished difference Result 1011 states and 1242 transitions. [2025-03-17 15:30:45,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 15:30:45,700 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 15.5) internal successors, (124), 9 states have internal predecessors, (124), 8 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) Word has length 76 [2025-03-17 15:30:45,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:30:45,706 INFO L225 Difference]: With dead ends: 1011 [2025-03-17 15:30:45,706 INFO L226 Difference]: Without dead ends: 1009 [2025-03-17 15:30:45,707 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2025-03-17 15:30:45,708 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 54 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:30:45,708 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 146 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:30:45,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1009 states. [2025-03-17 15:30:45,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1009 to 989. [2025-03-17 15:30:45,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 989 states, 926 states have (on average 1.1339092872570193) internal successors, (1050), 931 states have internal predecessors, (1050), 52 states have call successors, (52), 5 states have call predecessors, (52), 5 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-17 15:30:45,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 989 states to 989 states and 1154 transitions. [2025-03-17 15:30:45,750 INFO L78 Accepts]: Start accepts. Automaton has 989 states and 1154 transitions. Word has length 76 [2025-03-17 15:30:45,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:30:45,750 INFO L471 AbstractCegarLoop]: Abstraction has 989 states and 1154 transitions. [2025-03-17 15:30:45,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 15.5) internal successors, (124), 9 states have internal predecessors, (124), 8 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2025-03-17 15:30:45,751 INFO L276 IsEmpty]: Start isEmpty. Operand 989 states and 1154 transitions. [2025-03-17 15:30:45,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-17 15:30:45,751 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:30:45,751 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:30:45,758 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2025-03-17 15:30:45,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:30:45,958 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-03-17 15:30:45,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:30:45,958 INFO L85 PathProgramCache]: Analyzing trace with hash 2112994946, now seen corresponding path program 1 times [2025-03-17 15:30:45,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:30:45,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957467072] [2025-03-17 15:30:45,958 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:30:45,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:30:45,962 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-17 15:30:45,967 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-17 15:30:45,967 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:30:45,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:30:46,049 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 56 proven. 15 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-17 15:30:46,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:30:46,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957467072] [2025-03-17 15:30:46,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957467072] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:30:46,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1962821292] [2025-03-17 15:30:46,050 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:30:46,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:30:46,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:30:46,051 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 15:30:46,053 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-03-17 15:30:46,074 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-17 15:30:46,088 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-17 15:30:46,088 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:30:46,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:30:46,089 INFO L256 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-17 15:30:46,090 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:30:46,152 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 56 proven. 15 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-17 15:30:46,152 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:30:46,216 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 24 proven. 47 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-17 15:30:46,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1962821292] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:30:46,216 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 15:30:46,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2025-03-17 15:30:46,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314853373] [2025-03-17 15:30:46,216 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 15:30:46,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 15:30:46,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:30:46,217 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 15:30:46,217 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-17 15:30:46,217 INFO L87 Difference]: Start difference. First operand 989 states and 1154 transitions. Second operand has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 6 states have internal predecessors, (86), 5 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-17 15:30:46,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:30:46,292 INFO L93 Difference]: Finished difference Result 1219 states and 1416 transitions. [2025-03-17 15:30:46,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 15:30:46,293 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 6 states have internal predecessors, (86), 5 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 89 [2025-03-17 15:30:46,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:30:46,295 INFO L225 Difference]: With dead ends: 1219 [2025-03-17 15:30:46,295 INFO L226 Difference]: Without dead ends: 684 [2025-03-17 15:30:46,297 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-17 15:30:46,297 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 13 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:30:46,297 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 149 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:30:46,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 684 states. [2025-03-17 15:30:46,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 684 to 681. [2025-03-17 15:30:46,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 681 states, 635 states have (on average 1.1118110236220473) internal successors, (706), 640 states have internal predecessors, (706), 35 states have call successors, (35), 5 states have call predecessors, (35), 5 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2025-03-17 15:30:46,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 681 states to 681 states and 776 transitions. [2025-03-17 15:30:46,321 INFO L78 Accepts]: Start accepts. Automaton has 681 states and 776 transitions. Word has length 89 [2025-03-17 15:30:46,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:30:46,321 INFO L471 AbstractCegarLoop]: Abstraction has 681 states and 776 transitions. [2025-03-17 15:30:46,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 6 states have internal predecessors, (86), 5 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-17 15:30:46,321 INFO L276 IsEmpty]: Start isEmpty. Operand 681 states and 776 transitions. [2025-03-17 15:30:46,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-17 15:30:46,322 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:30:46,322 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:30:46,328 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2025-03-17 15:30:46,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:30:46,523 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-03-17 15:30:46,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:30:46,523 INFO L85 PathProgramCache]: Analyzing trace with hash 1996868931, now seen corresponding path program 2 times [2025-03-17 15:30:46,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:30:46,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69518914] [2025-03-17 15:30:46,523 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 15:30:46,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:30:46,527 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 89 statements into 2 equivalence classes. [2025-03-17 15:30:46,548 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 89 of 89 statements. [2025-03-17 15:30:46,549 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 15:30:46,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:30:46,758 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 14 proven. 27 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-03-17 15:30:46,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:30:46,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69518914] [2025-03-17 15:30:46,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69518914] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:30:46,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [545701428] [2025-03-17 15:30:46,758 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 15:30:46,759 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:30:46,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:30:46,760 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 15:30:46,762 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-03-17 15:30:46,785 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 89 statements into 2 equivalence classes. [2025-03-17 15:30:46,799 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 89 of 89 statements. [2025-03-17 15:30:46,799 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 15:30:46,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:30:46,800 INFO L256 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-17 15:30:46,801 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:30:46,936 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 6 proven. 73 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-17 15:30:46,936 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:30:47,125 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 6 proven. 73 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-17 15:30:47,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [545701428] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:30:47,126 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 15:30:47,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 22 [2025-03-17 15:30:47,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253790025] [2025-03-17 15:30:47,126 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 15:30:47,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-17 15:30:47,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:30:47,127 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-17 15:30:47,127 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=429, Unknown=0, NotChecked=0, Total=506 [2025-03-17 15:30:47,127 INFO L87 Difference]: Start difference. First operand 681 states and 776 transitions. Second operand has 23 states, 22 states have (on average 7.909090909090909) internal successors, (174), 22 states have internal predecessors, (174), 10 states have call successors, (11), 1 states have call predecessors, (11), 3 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2025-03-17 15:30:48,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:30:48,273 INFO L93 Difference]: Finished difference Result 989 states and 1117 transitions. [2025-03-17 15:30:48,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2025-03-17 15:30:48,277 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 7.909090909090909) internal successors, (174), 22 states have internal predecessors, (174), 10 states have call successors, (11), 1 states have call predecessors, (11), 3 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) Word has length 89 [2025-03-17 15:30:48,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:30:48,280 INFO L225 Difference]: With dead ends: 989 [2025-03-17 15:30:48,281 INFO L226 Difference]: Without dead ends: 971 [2025-03-17 15:30:48,282 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 167 SyntacticMatches, 1 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1729 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1258, Invalid=4144, Unknown=0, NotChecked=0, Total=5402 [2025-03-17 15:30:48,283 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 455 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 414 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 455 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 15:30:48,284 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [455 Valid, 261 Invalid, 455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 414 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 15:30:48,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 971 states. [2025-03-17 15:30:48,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 971 to 675. [2025-03-17 15:30:48,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 675 states, 631 states have (on average 1.057052297939778) internal successors, (667), 634 states have internal predecessors, (667), 35 states have call successors, (35), 5 states have call predecessors, (35), 5 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2025-03-17 15:30:48,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 675 states to 675 states and 737 transitions. [2025-03-17 15:30:48,316 INFO L78 Accepts]: Start accepts. Automaton has 675 states and 737 transitions. Word has length 89 [2025-03-17 15:30:48,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:30:48,316 INFO L471 AbstractCegarLoop]: Abstraction has 675 states and 737 transitions. [2025-03-17 15:30:48,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 7.909090909090909) internal successors, (174), 22 states have internal predecessors, (174), 10 states have call successors, (11), 1 states have call predecessors, (11), 3 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2025-03-17 15:30:48,316 INFO L276 IsEmpty]: Start isEmpty. Operand 675 states and 737 transitions. [2025-03-17 15:30:48,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-17 15:30:48,317 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:30:48,317 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:30:48,323 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2025-03-17 15:30:48,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:30:48,518 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-03-17 15:30:48,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:30:48,518 INFO L85 PathProgramCache]: Analyzing trace with hash 1204914597, now seen corresponding path program 1 times [2025-03-17 15:30:48,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:30:48,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63390728] [2025-03-17 15:30:48,518 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:30:48,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:30:48,523 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-17 15:30:48,527 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-17 15:30:48,527 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:30:48,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:30:48,576 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 108 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-17 15:30:48,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:30:48,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63390728] [2025-03-17 15:30:48,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63390728] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:30:48,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [984270987] [2025-03-17 15:30:48,576 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:30:48,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:30:48,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:30:48,578 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 15:30:48,580 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-03-17 15:30:48,600 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-17 15:30:48,629 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-17 15:30:48,629 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:30:48,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:30:48,630 INFO L256 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 15:30:48,631 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:30:48,693 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 108 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-17 15:30:48,693 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:30:48,798 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 108 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-17 15:30:48,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [984270987] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:30:48,798 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 15:30:48,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-17 15:30:48,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546471207] [2025-03-17 15:30:48,799 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 15:30:48,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 15:30:48,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:30:48,799 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 15:30:48,799 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2025-03-17 15:30:48,800 INFO L87 Difference]: Start difference. First operand 675 states and 737 transitions. Second operand has 11 states, 10 states have (on average 16.6) internal successors, (166), 11 states have internal predecessors, (166), 10 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2025-03-17 15:30:48,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:30:48,929 INFO L93 Difference]: Finished difference Result 1610 states and 1789 transitions. [2025-03-17 15:30:48,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 15:30:48,930 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 16.6) internal successors, (166), 11 states have internal predecessors, (166), 10 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) Word has length 102 [2025-03-17 15:30:48,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:30:48,935 INFO L225 Difference]: With dead ends: 1610 [2025-03-17 15:30:48,935 INFO L226 Difference]: Without dead ends: 1609 [2025-03-17 15:30:48,936 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 198 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2025-03-17 15:30:48,936 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 110 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:30:48,936 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 192 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:30:48,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1609 states. [2025-03-17 15:30:48,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1609 to 1589. [2025-03-17 15:30:48,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1589 states, 1497 states have (on average 1.0668002672010688) internal successors, (1597), 1500 states have internal predecessors, (1597), 83 states have call successors, (83), 5 states have call predecessors, (83), 5 states have return successors, (83), 83 states have call predecessors, (83), 83 states have call successors, (83) [2025-03-17 15:30:48,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1589 states to 1589 states and 1763 transitions. [2025-03-17 15:30:48,989 INFO L78 Accepts]: Start accepts. Automaton has 1589 states and 1763 transitions. Word has length 102 [2025-03-17 15:30:48,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:30:48,990 INFO L471 AbstractCegarLoop]: Abstraction has 1589 states and 1763 transitions. [2025-03-17 15:30:48,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 16.6) internal successors, (166), 11 states have internal predecessors, (166), 10 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2025-03-17 15:30:48,990 INFO L276 IsEmpty]: Start isEmpty. Operand 1589 states and 1763 transitions. [2025-03-17 15:30:48,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-17 15:30:48,991 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:30:48,991 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:30:48,999 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2025-03-17 15:30:49,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:30:49,191 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-03-17 15:30:49,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:30:49,192 INFO L85 PathProgramCache]: Analyzing trace with hash -983238787, now seen corresponding path program 1 times [2025-03-17 15:30:49,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:30:49,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662570937] [2025-03-17 15:30:49,192 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:30:49,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:30:49,199 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-17 15:30:49,205 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-17 15:30:49,205 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:30:49,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:30:49,273 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 80 proven. 30 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-17 15:30:49,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:30:49,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662570937] [2025-03-17 15:30:49,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662570937] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:30:49,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [572909058] [2025-03-17 15:30:49,273 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:30:49,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:30:49,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:30:49,275 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 15:30:49,277 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-03-17 15:30:49,299 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-17 15:30:49,315 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-17 15:30:49,316 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:30:49,316 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:30:49,316 INFO L256 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 15:30:49,317 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:30:49,401 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 92 proven. 30 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-17 15:30:49,401 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:30:49,485 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 80 proven. 30 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-17 15:30:49,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [572909058] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:30:49,485 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 15:30:49,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2025-03-17 15:30:49,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312542449] [2025-03-17 15:30:49,485 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 15:30:49,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 15:30:49,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:30:49,486 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 15:30:49,486 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-17 15:30:49,487 INFO L87 Difference]: Start difference. First operand 1589 states and 1763 transitions. Second operand has 9 states, 9 states have (on average 14.777777777777779) internal successors, (133), 9 states have internal predecessors, (133), 8 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2025-03-17 15:30:49,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:30:49,641 INFO L93 Difference]: Finished difference Result 1670 states and 1849 transitions. [2025-03-17 15:30:49,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 15:30:49,642 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 14.777777777777779) internal successors, (133), 9 states have internal predecessors, (133), 8 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) Word has length 110 [2025-03-17 15:30:49,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:30:49,646 INFO L225 Difference]: With dead ends: 1670 [2025-03-17 15:30:49,646 INFO L226 Difference]: Without dead ends: 1516 [2025-03-17 15:30:49,647 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 214 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-03-17 15:30:49,648 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 55 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:30:49,648 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 212 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:30:49,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1516 states. [2025-03-17 15:30:49,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1516 to 1512. [2025-03-17 15:30:49,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1512 states, 1423 states have (on average 1.0583274771609277) internal successors, (1506), 1426 states have internal predecessors, (1506), 80 states have call successors, (80), 5 states have call predecessors, (80), 5 states have return successors, (80), 80 states have call predecessors, (80), 80 states have call successors, (80) [2025-03-17 15:30:49,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1512 states to 1512 states and 1666 transitions. [2025-03-17 15:30:49,699 INFO L78 Accepts]: Start accepts. Automaton has 1512 states and 1666 transitions. Word has length 110 [2025-03-17 15:30:49,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:30:49,699 INFO L471 AbstractCegarLoop]: Abstraction has 1512 states and 1666 transitions. [2025-03-17 15:30:49,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.777777777777779) internal successors, (133), 9 states have internal predecessors, (133), 8 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2025-03-17 15:30:49,699 INFO L276 IsEmpty]: Start isEmpty. Operand 1512 states and 1666 transitions. [2025-03-17 15:30:49,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-17 15:30:49,700 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:30:49,700 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:30:49,710 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2025-03-17 15:30:49,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-03-17 15:30:49,901 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-03-17 15:30:49,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:30:49,901 INFO L85 PathProgramCache]: Analyzing trace with hash 2118793859, now seen corresponding path program 2 times [2025-03-17 15:30:49,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:30:49,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813617291] [2025-03-17 15:30:49,901 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 15:30:49,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:30:49,908 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 133 statements into 2 equivalence classes. [2025-03-17 15:30:49,914 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 133 of 133 statements. [2025-03-17 15:30:49,914 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 15:30:49,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:30:50,000 INFO L134 CoverageAnalysis]: Checked inductivity of 230 backedges. 58 proven. 128 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2025-03-17 15:30:50,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:30:50,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813617291] [2025-03-17 15:30:50,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813617291] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:30:50,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1945161669] [2025-03-17 15:30:50,001 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 15:30:50,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:30:50,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:30:50,003 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 15:30:50,005 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2025-03-17 15:30:50,026 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 133 statements into 2 equivalence classes. [2025-03-17 15:30:50,046 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 133 of 133 statements. [2025-03-17 15:30:50,047 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 15:30:50,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:30:50,048 INFO L256 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-17 15:30:50,050 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:30:50,188 INFO L134 CoverageAnalysis]: Checked inductivity of 230 backedges. 73 proven. 113 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2025-03-17 15:30:50,188 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:30:50,302 INFO L134 CoverageAnalysis]: Checked inductivity of 230 backedges. 73 proven. 113 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2025-03-17 15:30:50,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1945161669] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:30:50,302 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 15:30:50,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 12 [2025-03-17 15:30:50,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910244021] [2025-03-17 15:30:50,303 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 15:30:50,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 15:30:50,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:30:50,303 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 15:30:50,303 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2025-03-17 15:30:50,304 INFO L87 Difference]: Start difference. First operand 1512 states and 1666 transitions. Second operand has 12 states, 12 states have (on average 14.583333333333334) internal successors, (175), 12 states have internal predecessors, (175), 10 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2025-03-17 15:30:50,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:30:50,549 INFO L93 Difference]: Finished difference Result 3378 states and 3735 transitions. [2025-03-17 15:30:50,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 15:30:50,555 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 14.583333333333334) internal successors, (175), 12 states have internal predecessors, (175), 10 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) Word has length 133 [2025-03-17 15:30:50,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:30:50,563 INFO L225 Difference]: With dead ends: 3378 [2025-03-17 15:30:50,563 INFO L226 Difference]: Without dead ends: 2442 [2025-03-17 15:30:50,566 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 257 SyntacticMatches, 5 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2025-03-17 15:30:50,567 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 43 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 351 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 15:30:50,567 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 348 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 351 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 15:30:50,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2442 states. [2025-03-17 15:30:50,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2442 to 1780. [2025-03-17 15:30:50,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1780 states, 1677 states have (on average 1.05664877757901) internal successors, (1772), 1680 states have internal predecessors, (1772), 94 states have call successors, (94), 5 states have call predecessors, (94), 5 states have return successors, (94), 94 states have call predecessors, (94), 94 states have call successors, (94) [2025-03-17 15:30:50,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1780 states to 1780 states and 1960 transitions. [2025-03-17 15:30:50,635 INFO L78 Accepts]: Start accepts. Automaton has 1780 states and 1960 transitions. Word has length 133 [2025-03-17 15:30:50,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:30:50,635 INFO L471 AbstractCegarLoop]: Abstraction has 1780 states and 1960 transitions. [2025-03-17 15:30:50,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 14.583333333333334) internal successors, (175), 12 states have internal predecessors, (175), 10 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2025-03-17 15:30:50,635 INFO L276 IsEmpty]: Start isEmpty. Operand 1780 states and 1960 transitions. [2025-03-17 15:30:50,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-17 15:30:50,637 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:30:50,637 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:30:50,643 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2025-03-17 15:30:50,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2025-03-17 15:30:50,841 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-03-17 15:30:50,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:30:50,841 INFO L85 PathProgramCache]: Analyzing trace with hash 84695262, now seen corresponding path program 1 times [2025-03-17 15:30:50,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:30:50,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815765748] [2025-03-17 15:30:50,842 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:30:50,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:30:50,849 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-17 15:30:50,857 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-17 15:30:50,859 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:30:50,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:30:51,040 INFO L134 CoverageAnalysis]: Checked inductivity of 373 backedges. 285 proven. 24 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2025-03-17 15:30:51,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:30:51,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815765748] [2025-03-17 15:30:51,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815765748] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:30:51,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [136135805] [2025-03-17 15:30:51,041 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:30:51,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:30:51,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:30:51,043 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 15:30:51,045 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2025-03-17 15:30:51,067 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-17 15:30:51,089 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-17 15:30:51,090 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:30:51,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:30:51,091 INFO L256 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-17 15:30:51,092 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:30:51,214 INFO L134 CoverageAnalysis]: Checked inductivity of 373 backedges. 364 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 15:30:51,214 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:30:51,385 INFO L134 CoverageAnalysis]: Checked inductivity of 373 backedges. 304 proven. 5 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2025-03-17 15:30:51,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [136135805] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:30:51,385 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 15:30:51,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 14] total 17 [2025-03-17 15:30:51,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312790823] [2025-03-17 15:30:51,385 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 15:30:51,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-17 15:30:51,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:30:51,386 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-17 15:30:51,386 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2025-03-17 15:30:51,386 INFO L87 Difference]: Start difference. First operand 1780 states and 1960 transitions. Second operand has 17 states, 17 states have (on average 8.764705882352942) internal successors, (149), 17 states have internal predecessors, (149), 8 states have call successors, (18), 8 states have call predecessors, (18), 8 states have return successors, (18), 8 states have call predecessors, (18), 8 states have call successors, (18) [2025-03-17 15:30:51,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:30:51,552 INFO L93 Difference]: Finished difference Result 1877 states and 2058 transitions. [2025-03-17 15:30:51,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-17 15:30:51,553 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 8.764705882352942) internal successors, (149), 17 states have internal predecessors, (149), 8 states have call successors, (18), 8 states have call predecessors, (18), 8 states have return successors, (18), 8 states have call predecessors, (18), 8 states have call successors, (18) Word has length 156 [2025-03-17 15:30:51,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:30:51,554 INFO L225 Difference]: With dead ends: 1877 [2025-03-17 15:30:51,554 INFO L226 Difference]: Without dead ends: 0 [2025-03-17 15:30:51,556 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 335 GetRequests, 299 SyntacticMatches, 11 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 235 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=199, Invalid=503, Unknown=0, NotChecked=0, Total=702 [2025-03-17 15:30:51,556 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 53 mSDsluCounter, 854 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 983 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:30:51,556 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 983 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:30:51,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-17 15:30:51,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-17 15:30:51,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:30:51,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-17 15:30:51,557 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 156 [2025-03-17 15:30:51,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:30:51,557 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-17 15:30:51,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 8.764705882352942) internal successors, (149), 17 states have internal predecessors, (149), 8 states have call successors, (18), 8 states have call predecessors, (18), 8 states have return successors, (18), 8 states have call predecessors, (18), 8 states have call successors, (18) [2025-03-17 15:30:51,558 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-17 15:30:51,558 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-17 15:30:51,560 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 22 remaining) [2025-03-17 15:30:51,560 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 22 remaining) [2025-03-17 15:30:51,560 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 22 remaining) [2025-03-17 15:30:51,560 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 22 remaining) [2025-03-17 15:30:51,560 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 22 remaining) [2025-03-17 15:30:51,560 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 22 remaining) [2025-03-17 15:30:51,560 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 22 remaining) [2025-03-17 15:30:51,560 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 22 remaining) [2025-03-17 15:30:51,561 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 22 remaining) [2025-03-17 15:30:51,561 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 22 remaining) [2025-03-17 15:30:51,561 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 22 remaining) [2025-03-17 15:30:51,561 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 22 remaining) [2025-03-17 15:30:51,561 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 22 remaining) [2025-03-17 15:30:51,561 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 22 remaining) [2025-03-17 15:30:51,561 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 22 remaining) [2025-03-17 15:30:51,561 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 22 remaining) [2025-03-17 15:30:51,561 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 22 remaining) [2025-03-17 15:30:51,561 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 22 remaining) [2025-03-17 15:30:51,561 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 22 remaining) [2025-03-17 15:30:51,561 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 22 remaining) [2025-03-17 15:30:51,561 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 22 remaining) [2025-03-17 15:30:51,561 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 22 remaining) [2025-03-17 15:30:51,568 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2025-03-17 15:30:51,764 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-03-17 15:30:51,767 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:30:51,768 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-17 15:30:53,694 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 15:30:53,724 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 03:30:53 BoogieIcfgContainer [2025-03-17 15:30:53,727 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 15:30:53,728 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 15:30:53,728 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 15:30:53,728 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 15:30:53,729 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:30:35" (3/4) ... [2025-03-17 15:30:53,730 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-17 15:30:53,735 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2025-03-17 15:30:53,735 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2025-03-17 15:30:53,740 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2025-03-17 15:30:53,740 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-17 15:30:53,740 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-17 15:30:53,740 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-17 15:30:53,820 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-17 15:30:53,821 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-17 15:30:53,821 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 15:30:53,821 INFO L158 Benchmark]: Toolchain (without parser) took 19023.93ms. Allocated memory was 142.6MB in the beginning and 327.2MB in the end (delta: 184.5MB). Free memory was 113.7MB in the beginning and 244.8MB in the end (delta: -131.1MB). Peak memory consumption was 52.0MB. Max. memory is 16.1GB. [2025-03-17 15:30:53,822 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 201.3MB. Free memory is still 123.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 15:30:53,822 INFO L158 Benchmark]: CACSL2BoogieTranslator took 151.32ms. Allocated memory is still 142.6MB. Free memory was 113.2MB in the beginning and 102.4MB in the end (delta: 10.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 15:30:53,823 INFO L158 Benchmark]: Boogie Procedure Inliner took 17.89ms. Allocated memory is still 142.6MB. Free memory was 102.4MB in the beginning and 101.4MB in the end (delta: 984.5kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 15:30:53,823 INFO L158 Benchmark]: Boogie Preprocessor took 16.61ms. Allocated memory is still 142.6MB. Free memory was 101.4MB in the beginning and 100.4MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 15:30:53,823 INFO L158 Benchmark]: IcfgBuilder took 243.21ms. Allocated memory is still 142.6MB. Free memory was 100.4MB in the beginning and 85.8MB in the end (delta: 14.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 15:30:53,823 INFO L158 Benchmark]: TraceAbstraction took 18496.93ms. Allocated memory was 142.6MB in the beginning and 327.2MB in the end (delta: 184.5MB). Free memory was 85.3MB in the beginning and 253.2MB in the end (delta: -167.8MB). Peak memory consumption was 164.6MB. Max. memory is 16.1GB. [2025-03-17 15:30:53,824 INFO L158 Benchmark]: Witness Printer took 93.08ms. Allocated memory is still 327.2MB. Free memory was 253.2MB in the beginning and 244.8MB in the end (delta: 8.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 15:30:53,824 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23ms. Allocated memory is still 201.3MB. Free memory is still 123.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 151.32ms. Allocated memory is still 142.6MB. Free memory was 113.2MB in the beginning and 102.4MB in the end (delta: 10.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 17.89ms. Allocated memory is still 142.6MB. Free memory was 102.4MB in the beginning and 101.4MB in the end (delta: 984.5kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 16.61ms. Allocated memory is still 142.6MB. Free memory was 101.4MB in the beginning and 100.4MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 243.21ms. Allocated memory is still 142.6MB. Free memory was 100.4MB in the beginning and 85.8MB in the end (delta: 14.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 18496.93ms. Allocated memory was 142.6MB in the beginning and 327.2MB in the end (delta: 184.5MB). Free memory was 85.3MB in the beginning and 253.2MB in the end (delta: -167.8MB). Peak memory consumption was 164.6MB. Max. memory is 16.1GB. * Witness Printer took 93.08ms. Allocated memory is still 327.2MB. Free memory was 253.2MB in the beginning and 244.8MB in the end (delta: 8.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 50]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 50]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 50]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 50]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 44]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 44]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 42]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 42]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 47]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 47]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 41]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 41]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 65 locations, 76 edges, 22 error locations. Started 1 CEGAR loops. OverallTime: 16.5s, OverallIterations: 26, TraceHistogramMax: 7, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 4.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2174 SdHoareTripleChecker+Valid, 2.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2163 mSDsluCounter, 5007 SdHoareTripleChecker+Invalid, 2.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3717 mSDsCounter, 182 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3549 IncrementalHoareTripleChecker+Invalid, 3731 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 182 mSolverCounterUnsat, 1290 mSDtfsCounter, 3549 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2529 GetRequests, 2200 SyntacticMatches, 26 SemanticMatches, 303 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2462 ImplicationChecksByTransitivity, 2.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1780occurred in iteration=25, InterpolantAutomatonStates: 248, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 26 MinimizatonAttempts, 1198 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 5.5s InterpolantComputationTime, 2682 NumberOfCodeBlocks, 2682 NumberOfCodeBlocksAsserted, 54 NumberOfCheckSat, 3381 ConstructedInterpolants, 7 QuantifiedInterpolants, 11458 SizeOfPredicates, 34 NumberOfNonLiveVariables, 2718 ConjunctsInSsa, 146 ConjunctsInUnsatCore, 54 InterpolantComputations, 11 PerfectInterpolantSequences, 2325/3690 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 22 specifications checked. All of them hold - InvariantResult [Line: 36]: Location Invariant Derived location invariant: (((((((((((((((((((((((((((((0 <= x1) && (2 <= counter)) && (2 <= x2)) && (y2 == 0)) && (counter <= 3)) && (y1 == 1)) && (((long long) x2 + y3) <= 2147483647)) && (x1 <= ((long long) 2 + y3))) && (x2 <= 1073741823)) && (0 <= y3)) || (((((((((((0 <= x1) && (x2 == 1)) && (y2 == 0)) && (counter <= 5)) && (x1 <= ((long long) 2147483645 + y3))) && (4 <= counter)) && (y1 <= 2147483643)) && (x1 <= 2147483647)) && (((long long) y1 + y3) <= 2147483647)) && (1 <= y1)) && (0 <= y3))) || ((((((((0 <= x1) && (((long long) x2 + y3) <= 2147483645)) && (2 == y2)) && (counter == 5)) && (y1 == 1)) && (3 <= x2)) && (x1 <= 2147483647)) && (0 <= y3))) || ((((((((((0 <= x1) && (x2 == 1)) && (x1 <= ((long long) y3 + 2147483646))) && (counter == 5)) && (y2 == 0)) && (y1 <= 2147483644)) && (x1 <= 2147483647)) && (((long long) y1 + y3) <= 2147483647)) && (1 <= y1)) && (0 <= y3))) || (((((((((((0 <= x1) && (x2 == 1)) && (y2 == 0)) && (counter <= 5)) && (x1 <= ((long long) y3 + 2147483644))) && (x1 <= 2147483647)) && (((long long) y1 + y3) <= 2147483647)) && (3 <= counter)) && (1 <= y1)) && (y1 <= 3)) && (0 <= y3))) || ((((((((((0 <= x1) && (x1 <= ((long long) y3 + 2147483646))) && (x2 <= 2147483647)) && (counter == 5)) && (2 <= y2)) && (y1 == 0)) && (y2 <= 2147483646)) && (((long long) y2 + y3) <= 2147483647)) && (x1 <= 2147483647)) && (0 <= y3))) || ((((((((((0 <= x1) && (2 == x2)) && (y1 == 1)) && (counter <= 4)) && (y2 == 1)) && (x1 <= ((long long) y3 + 2147483644))) && (x1 <= 2147483647)) && (y3 <= 2147483644)) && (3 <= counter)) && (0 <= y3))) || ((((((((0 <= x1) && (x2 == 1)) && (y2 == 0)) && (y1 == 1)) && (x1 <= ((long long) y3 + 1))) && (y3 <= 2147483646)) && (counter == 1)) && (0 <= y3))) || (((((((((((0 <= x1) && (x2 <= 2147483647)) && (2 <= y2)) && (y1 == 0)) && (counter <= 5)) && (y2 <= 3)) && (((long long) y2 + y3) <= 2147483647)) && (x1 <= ((long long) y3 + 2147483644))) && (x1 <= 2147483647)) && (3 <= counter)) && (0 <= y3))) || (((((((((0 <= x1) && (2 <= x2)) && (counter == 5)) && (y2 == 1)) && ((((long long) x2 * y1) + y3) <= 2147483646)) && (x1 <= 2147483647)) && (y1 <= 2)) && (1 <= y1)) && (0 <= y3))) || ((((((((0 <= x1) && (x2 <= 2147483647)) && (x1 <= ((long long) y3 + 1))) && (y2 == 1)) && (y1 == 0)) && (y3 <= 2147483646)) && (counter == 1)) && (0 <= y3))) || (((((((((((0 <= x1) && (y2 <= 2147483644)) && (2 <= x2)) && (x1 <= ((long long) y3 + 2147483646))) && (counter == 5)) && (y1 == 1)) && (2 <= y2)) && ((((long long) x2 + y2) + y3) <= 2147483647)) && (x1 <= 2147483647)) && (x2 <= 1073741823)) && (0 <= y3))) || (((((((((0 <= x1) && (((long long) x2 + y3) <= 2147483646)) && (y1 == 1)) && (y2 == 1)) && (3 <= x2)) && (counter <= 5)) && (4 <= counter)) && (x1 <= 2147483647)) && (0 <= y3))) || (((((((((0 <= x1) && (2 <= counter)) && (2 == y2)) && (x2 <= 2147483647)) && (counter <= 3)) && (y1 == 0)) && (x1 <= ((long long) 2 + y3))) && (y3 <= 2147483645)) && (0 <= y3))) || (((((((((0 <= x1) && (2 <= counter)) && (2 == y1)) && (x2 == 1)) && (y2 == 0)) && (counter <= 3)) && (x1 <= ((long long) 2 + y3))) && (y3 <= 2147483645)) && (0 <= y3))) || ((((((((((0 <= x1) && (2 <= x2)) && (y2 == 0)) && ((((long long) x2 * y1) + y3) <= 2147483647)) && (counter <= 5)) && (4 <= counter)) && (x1 <= 2147483647)) && (y1 <= 2)) && (1 <= y1)) && (0 <= y3))) || (((((((((((0 <= x1) && (2 <= x2)) && (((long long) x2 + y3) <= 2147483645)) && (2 == y2)) && (y1 == 1)) && (counter <= 5)) && (x1 <= ((long long) 2147483645 + y3))) && (4 <= counter)) && (x1 <= 2147483647)) && (x2 <= 1073741823)) && (0 <= y3))) || (((((((0 <= x1) && (y3 <= 2147483647)) && (x2 <= 2147483647)) && (y2 == 0)) && (x1 <= y3)) && (y1 == 0)) && (counter == 0))) || ((((((((((0 <= x1) && (x2 <= 2147483647)) && (counter == 4)) && (2 <= y2)) && (y1 == 0)) && (((long long) y2 + y3) <= 2147483647)) && (x1 <= ((long long) 2147483645 + y3))) && (x1 <= 2147483647)) && (y2 <= 2147483645)) && (0 <= y3))) || (((((((((0 <= x1) && (y2 == 0)) && (y1 == 1)) && ((((long long) x2 * y1) + y3) <= 2147483647)) && (3 <= x2)) && (counter <= 5)) && (x1 <= 2147483647)) && (3 <= counter)) && (0 <= y3))) RESULT: Ultimate proved your program to be correct! [2025-03-17 15:30:53,856 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE