./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/xcsp/AllInterval-007.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/xcsp/AllInterval-007.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 79ad480fc17f59cc4e46ec2dbc023b5da3460c72b3c8ca1cc6dbc35a93f8cf64 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 11:35:31,572 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 11:35:31,609 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-04 11:35:31,612 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 11:35:31,612 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 11:35:31,633 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 11:35:31,634 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 11:35:31,634 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 11:35:31,634 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 11:35:31,634 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 11:35:31,634 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 11:35:31,634 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 11:35:31,634 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 11:35:31,635 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 11:35:31,635 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 11:35:31,635 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 11:35:31,635 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 11:35:31,635 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 11:35:31,635 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 11:35:31,635 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 11:35:31,635 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 11:35:31,635 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 11:35:31,635 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 11:35:31,635 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 11:35:31,635 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 11:35:31,635 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 11:35:31,636 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 11:35:31,636 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 11:35:31,636 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 11:35:31,636 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 11:35:31,636 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 11:35:31,636 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 11:35:31,636 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 11:35:31,636 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 11:35:31,636 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 11:35:31,636 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 11:35:31,636 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 11:35:31,636 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 11:35:31,636 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 11:35:31,636 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 11:35:31,636 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 11:35:31,636 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 11:35:31,637 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 11:35:31,637 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 11:35:31,637 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 11:35:31,637 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 -> 79ad480fc17f59cc4e46ec2dbc023b5da3460c72b3c8ca1cc6dbc35a93f8cf64 [2025-03-04 11:35:31,848 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 11:35:31,857 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 11:35:31,860 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 11:35:31,861 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 11:35:31,861 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 11:35:31,862 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/xcsp/AllInterval-007.c [2025-03-04 11:35:32,971 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dccefd566/4a2cd18d9d69467aaced344ff4f94211/FLAG3f7dad5f3 [2025-03-04 11:35:33,185 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 11:35:33,185 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/xcsp/AllInterval-007.c [2025-03-04 11:35:33,196 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dccefd566/4a2cd18d9d69467aaced344ff4f94211/FLAG3f7dad5f3 [2025-03-04 11:35:33,534 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dccefd566/4a2cd18d9d69467aaced344ff4f94211 [2025-03-04 11:35:33,536 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 11:35:33,537 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 11:35:33,537 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 11:35:33,537 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 11:35:33,540 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 11:35:33,541 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 11:35:33" (1/1) ... [2025-03-04 11:35:33,541 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ab9032c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:35:33, skipping insertion in model container [2025-03-04 11:35:33,541 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 11:35:33" (1/1) ... [2025-03-04 11:35:33,550 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 11:35:33,665 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 11:35:33,673 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 11:35:33,699 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 11:35:33,713 INFO L204 MainTranslator]: Completed translation [2025-03-04 11:35:33,714 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:35:33 WrapperNode [2025-03-04 11:35:33,715 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 11:35:33,715 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 11:35:33,715 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 11:35:33,715 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 11:35:33,720 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:35:33" (1/1) ... [2025-03-04 11:35:33,726 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:35:33" (1/1) ... [2025-03-04 11:35:33,748 INFO L138 Inliner]: procedures = 13, calls = 76, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 211 [2025-03-04 11:35:33,749 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 11:35:33,749 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 11:35:33,749 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 11:35:33,749 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 11:35:33,755 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:35:33" (1/1) ... [2025-03-04 11:35:33,755 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:35:33" (1/1) ... [2025-03-04 11:35:33,757 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:35:33" (1/1) ... [2025-03-04 11:35:33,766 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-04 11:35:33,767 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:35:33" (1/1) ... [2025-03-04 11:35:33,767 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:35:33" (1/1) ... [2025-03-04 11:35:33,770 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:35:33" (1/1) ... [2025-03-04 11:35:33,770 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:35:33" (1/1) ... [2025-03-04 11:35:33,771 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:35:33" (1/1) ... [2025-03-04 11:35:33,772 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:35:33" (1/1) ... [2025-03-04 11:35:33,773 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 11:35:33,774 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 11:35:33,774 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 11:35:33,774 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 11:35:33,775 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:35:33" (1/1) ... [2025-03-04 11:35:33,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 11:35:33,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:35:33,810 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 11:35:33,815 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 11:35:33,833 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 11:35:33,833 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 11:35:33,834 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 11:35:33,834 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 11:35:33,834 INFO L130 BoogieDeclarations]: Found specification of procedure assume [2025-03-04 11:35:33,834 INFO L138 BoogieDeclarations]: Found implementation of procedure assume [2025-03-04 11:35:33,885 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 11:35:33,887 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 11:35:34,143 INFO L? ?]: Removed 60 outVars from TransFormulas that were not future-live. [2025-03-04 11:35:34,144 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 11:35:34,159 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 11:35:34,159 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 11:35:34,160 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 11:35:34 BoogieIcfgContainer [2025-03-04 11:35:34,160 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 11:35:34,161 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 11:35:34,161 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 11:35:34,164 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 11:35:34,165 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 11:35:33" (1/3) ... [2025-03-04 11:35:34,165 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ec97d2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 11:35:34, skipping insertion in model container [2025-03-04 11:35:34,165 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:35:33" (2/3) ... [2025-03-04 11:35:34,166 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ec97d2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 11:35:34, skipping insertion in model container [2025-03-04 11:35:34,166 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 11:35:34" (3/3) ... [2025-03-04 11:35:34,167 INFO L128 eAbstractionObserver]: Analyzing ICFG AllInterval-007.c [2025-03-04 11:35:34,177 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 11:35:34,180 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG AllInterval-007.c that has 2 procedures, 153 locations, 1 initial locations, 0 loop locations, and 24 error locations. [2025-03-04 11:35:34,223 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 11:35:34,235 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;@4423b319, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 11:35:34,235 INFO L334 AbstractCegarLoop]: Starting to check reachability of 24 error locations. [2025-03-04 11:35:34,239 INFO L276 IsEmpty]: Start isEmpty. Operand has 153 states, 59 states have (on average 1.5254237288135593) internal successors, (90), 83 states have internal predecessors, (90), 68 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 68 states have call predecessors, (68), 68 states have call successors, (68) [2025-03-04 11:35:34,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2025-03-04 11:35:34,256 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:35:34,257 INFO L218 NwaCegarLoop]: trace histogram [62, 62, 62, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:35:34,258 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-03-04 11:35:34,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:35:34,262 INFO L85 PathProgramCache]: Analyzing trace with hash -76087298, now seen corresponding path program 1 times [2025-03-04 11:35:34,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:35:34,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857782033] [2025-03-04 11:35:34,270 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:34,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:35:34,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 327 statements into 1 equivalence classes. [2025-03-04 11:35:34,374 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 327 of 327 statements. [2025-03-04 11:35:34,375 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:34,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:34,575 INFO L134 CoverageAnalysis]: Checked inductivity of 7564 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 7442 trivial. 0 not checked. [2025-03-04 11:35:34,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:35:34,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857782033] [2025-03-04 11:35:34,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857782033] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:35:34,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [689546604] [2025-03-04 11:35:34,577 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:34,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:35:34,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:35:34,580 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:35:34,596 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 11:35:34,678 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 327 statements into 1 equivalence classes. [2025-03-04 11:35:34,776 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 327 of 327 statements. [2025-03-04 11:35:34,776 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:34,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:34,778 INFO L256 TraceCheckSpWp]: Trace formula consists of 611 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 11:35:34,792 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:35:34,836 INFO L134 CoverageAnalysis]: Checked inductivity of 7564 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 7442 trivial. 0 not checked. [2025-03-04 11:35:34,840 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:35:34,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [689546604] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:35:34,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 11:35:34,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 11:35:34,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345710882] [2025-03-04 11:35:34,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:35:34,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 11:35:34,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:35:34,865 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 11:35:34,866 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 11:35:34,868 INFO L87 Difference]: Start difference. First operand has 153 states, 59 states have (on average 1.5254237288135593) internal successors, (90), 83 states have internal predecessors, (90), 68 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 68 states have call predecessors, (68), 68 states have call successors, (68) Second operand has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (62), 2 states have call predecessors, (62), 1 states have return successors, (62), 1 states have call predecessors, (62), 2 states have call successors, (62) [2025-03-04 11:35:34,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:35:34,905 INFO L93 Difference]: Finished difference Result 299 states and 513 transitions. [2025-03-04 11:35:34,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 11:35:34,906 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (62), 2 states have call predecessors, (62), 1 states have return successors, (62), 1 states have call predecessors, (62), 2 states have call successors, (62) Word has length 327 [2025-03-04 11:35:34,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:35:34,913 INFO L225 Difference]: With dead ends: 299 [2025-03-04 11:35:34,914 INFO L226 Difference]: Without dead ends: 146 [2025-03-04 11:35:34,918 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 328 GetRequests, 328 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 11:35:34,922 INFO L435 NwaCegarLoop]: 221 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, 221 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:35:34,922 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:35:34,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2025-03-04 11:35:34,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2025-03-04 11:35:34,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 54 states have (on average 1.5185185185185186) internal successors, (82), 77 states have internal predecessors, (82), 67 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 67 states have call predecessors, (67), 67 states have call successors, (67) [2025-03-04 11:35:34,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 216 transitions. [2025-03-04 11:35:34,974 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 216 transitions. Word has length 327 [2025-03-04 11:35:34,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:35:34,975 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 216 transitions. [2025-03-04 11:35:34,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (62), 2 states have call predecessors, (62), 1 states have return successors, (62), 1 states have call predecessors, (62), 2 states have call successors, (62) [2025-03-04 11:35:34,975 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 216 transitions. [2025-03-04 11:35:34,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2025-03-04 11:35:34,979 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:35:34,979 INFO L218 NwaCegarLoop]: trace histogram [62, 62, 62, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:35:34,986 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 11:35:35,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-04 11:35:35,180 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-03-04 11:35:35,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:35:35,180 INFO L85 PathProgramCache]: Analyzing trace with hash -312781154, now seen corresponding path program 1 times [2025-03-04 11:35:35,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:35:35,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730571293] [2025-03-04 11:35:35,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:35,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:35:35,202 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 327 statements into 1 equivalence classes. [2025-03-04 11:35:35,293 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 327 of 327 statements. [2025-03-04 11:35:35,295 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:35,295 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:35,850 INFO L134 CoverageAnalysis]: Checked inductivity of 7564 backedges. 6 proven. 354 refuted. 0 times theorem prover too weak. 7204 trivial. 0 not checked. [2025-03-04 11:35:35,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:35:35,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730571293] [2025-03-04 11:35:35,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730571293] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:35:35,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1564099081] [2025-03-04 11:35:35,850 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:35,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:35:35,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:35:35,855 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:35:35,857 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 11:35:35,916 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 327 statements into 1 equivalence classes. [2025-03-04 11:35:35,986 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 327 of 327 statements. [2025-03-04 11:35:35,986 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:35,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:35,990 INFO L256 TraceCheckSpWp]: Trace formula consists of 611 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 11:35:35,998 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:35:36,408 INFO L134 CoverageAnalysis]: Checked inductivity of 7564 backedges. 0 proven. 183 refuted. 0 times theorem prover too weak. 7381 trivial. 0 not checked. [2025-03-04 11:35:36,408 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:35:36,844 INFO L134 CoverageAnalysis]: Checked inductivity of 7564 backedges. 0 proven. 183 refuted. 0 times theorem prover too weak. 7381 trivial. 0 not checked. [2025-03-04 11:35:36,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1564099081] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:35:36,844 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:35:36,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-03-04 11:35:36,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667521024] [2025-03-04 11:35:36,844 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:35:36,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 11:35:36,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:35:36,849 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 11:35:36,849 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-03-04 11:35:36,849 INFO L87 Difference]: Start difference. First operand 146 states and 216 transitions. Second operand has 10 states, 9 states have (on average 6.111111111111111) internal successors, (55), 9 states have internal predecessors, (55), 6 states have call successors, (183), 1 states have call predecessors, (183), 2 states have return successors, (184), 5 states have call predecessors, (184), 6 states have call successors, (184) [2025-03-04 11:35:37,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:35:37,290 INFO L93 Difference]: Finished difference Result 146 states and 216 transitions. [2025-03-04 11:35:37,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 11:35:37,293 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.111111111111111) internal successors, (55), 9 states have internal predecessors, (55), 6 states have call successors, (183), 1 states have call predecessors, (183), 2 states have return successors, (184), 5 states have call predecessors, (184), 6 states have call successors, (184) Word has length 327 [2025-03-04 11:35:37,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:35:37,296 INFO L225 Difference]: With dead ends: 146 [2025-03-04 11:35:37,296 INFO L226 Difference]: Without dead ends: 145 [2025-03-04 11:35:37,299 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 660 GetRequests, 651 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-03-04 11:35:37,299 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 2 mSDsluCounter, 734 mSDsCounter, 0 mSdLazyCounter, 534 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 878 SdHoareTripleChecker+Invalid, 534 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 534 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 11:35:37,299 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 878 Invalid, 534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 534 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 11:35:37,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2025-03-04 11:35:37,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2025-03-04 11:35:37,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 54 states have (on average 1.5) internal successors, (81), 76 states have internal predecessors, (81), 67 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 67 states have call predecessors, (67), 67 states have call successors, (67) [2025-03-04 11:35:37,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 215 transitions. [2025-03-04 11:35:37,320 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 215 transitions. Word has length 327 [2025-03-04 11:35:37,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:35:37,322 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 215 transitions. [2025-03-04 11:35:37,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.111111111111111) internal successors, (55), 9 states have internal predecessors, (55), 6 states have call successors, (183), 1 states have call predecessors, (183), 2 states have return successors, (184), 5 states have call predecessors, (184), 6 states have call successors, (184) [2025-03-04 11:35:37,322 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 215 transitions. [2025-03-04 11:35:37,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2025-03-04 11:35:37,326 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:35:37,326 INFO L218 NwaCegarLoop]: trace histogram [62, 62, 62, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:35:37,336 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 11:35:37,527 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,SelfDestructingSolverStorable1 [2025-03-04 11:35:37,527 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-03-04 11:35:37,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:35:37,528 INFO L85 PathProgramCache]: Analyzing trace with hash -1106281140, now seen corresponding path program 1 times [2025-03-04 11:35:37,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:35:37,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275048367] [2025-03-04 11:35:37,528 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:37,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:35:37,543 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 328 statements into 1 equivalence classes. [2025-03-04 11:35:37,572 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 328 of 328 statements. [2025-03-04 11:35:37,572 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:37,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:37,895 INFO L134 CoverageAnalysis]: Checked inductivity of 7564 backedges. 6 proven. 177 refuted. 0 times theorem prover too weak. 7381 trivial. 0 not checked. [2025-03-04 11:35:37,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:35:37,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275048367] [2025-03-04 11:35:37,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275048367] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:35:37,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1972456196] [2025-03-04 11:35:37,896 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:37,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:35:37,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:35:37,898 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:35:37,900 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 11:35:37,945 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 328 statements into 1 equivalence classes. [2025-03-04 11:35:38,013 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 328 of 328 statements. [2025-03-04 11:35:38,013 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:38,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:38,016 INFO L256 TraceCheckSpWp]: Trace formula consists of 612 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 11:35:38,025 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:35:38,332 INFO L134 CoverageAnalysis]: Checked inductivity of 7564 backedges. 6 proven. 177 refuted. 0 times theorem prover too weak. 7381 trivial. 0 not checked. [2025-03-04 11:35:38,333 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:35:38,651 INFO L134 CoverageAnalysis]: Checked inductivity of 7564 backedges. 6 proven. 177 refuted. 0 times theorem prover too weak. 7381 trivial. 0 not checked. [2025-03-04 11:35:38,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1972456196] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:35:38,655 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:35:38,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9 [2025-03-04 11:35:38,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498317733] [2025-03-04 11:35:38,655 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:35:38,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 11:35:38,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:35:38,657 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 11:35:38,657 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-03-04 11:35:38,657 INFO L87 Difference]: Start difference. First operand 145 states and 215 transitions. Second operand has 10 states, 8 states have (on average 7.125) internal successors, (57), 10 states have internal predecessors, (57), 5 states have call successors, (181), 1 states have call predecessors, (181), 2 states have return successors, (182), 4 states have call predecessors, (182), 5 states have call successors, (182) [2025-03-04 11:35:39,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:35:39,014 INFO L93 Difference]: Finished difference Result 145 states and 215 transitions. [2025-03-04 11:35:39,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 11:35:39,015 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 7.125) internal successors, (57), 10 states have internal predecessors, (57), 5 states have call successors, (181), 1 states have call predecessors, (181), 2 states have return successors, (182), 4 states have call predecessors, (182), 5 states have call successors, (182) Word has length 328 [2025-03-04 11:35:39,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:35:39,018 INFO L225 Difference]: With dead ends: 145 [2025-03-04 11:35:39,020 INFO L226 Difference]: Without dead ends: 144 [2025-03-04 11:35:39,020 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 660 GetRequests, 651 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-03-04 11:35:39,021 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 0 mSDsluCounter, 730 mSDsCounter, 0 mSdLazyCounter, 528 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 874 SdHoareTripleChecker+Invalid, 528 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 528 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 11:35:39,021 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 874 Invalid, 528 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 528 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 11:35:39,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2025-03-04 11:35:39,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2025-03-04 11:35:39,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 54 states have (on average 1.4814814814814814) internal successors, (80), 75 states have internal predecessors, (80), 67 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 67 states have call predecessors, (67), 67 states have call successors, (67) [2025-03-04 11:35:39,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 214 transitions. [2025-03-04 11:35:39,036 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 214 transitions. Word has length 328 [2025-03-04 11:35:39,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:35:39,037 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 214 transitions. [2025-03-04 11:35:39,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 7.125) internal successors, (57), 10 states have internal predecessors, (57), 5 states have call successors, (181), 1 states have call predecessors, (181), 2 states have return successors, (182), 4 states have call predecessors, (182), 5 states have call successors, (182) [2025-03-04 11:35:39,038 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 214 transitions. [2025-03-04 11:35:39,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2025-03-04 11:35:39,040 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:35:39,041 INFO L218 NwaCegarLoop]: trace histogram [62, 62, 62, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:35:39,048 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-04 11:35:39,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:35:39,246 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-03-04 11:35:39,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:35:39,248 INFO L85 PathProgramCache]: Analyzing trace with hash 2015715178, now seen corresponding path program 1 times [2025-03-04 11:35:39,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:35:39,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610074849] [2025-03-04 11:35:39,248 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:39,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:35:39,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 330 statements into 1 equivalence classes. [2025-03-04 11:35:39,268 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 330 of 330 statements. [2025-03-04 11:35:39,268 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:39,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:39,337 INFO L134 CoverageAnalysis]: Checked inductivity of 7564 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7564 trivial. 0 not checked. [2025-03-04 11:35:39,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:35:39,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610074849] [2025-03-04 11:35:39,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610074849] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:35:39,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:35:39,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 11:35:39,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814215327] [2025-03-04 11:35:39,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:35:39,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 11:35:39,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:35:39,338 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 11:35:39,338 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 11:35:39,338 INFO L87 Difference]: Start difference. First operand 144 states and 214 transitions. Second operand has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (62), 1 states have call predecessors, (62), 1 states have return successors, (62), 1 states have call predecessors, (62), 1 states have call successors, (62) [2025-03-04 11:35:39,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:35:39,395 INFO L93 Difference]: Finished difference Result 144 states and 214 transitions. [2025-03-04 11:35:39,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 11:35:39,396 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (62), 1 states have call predecessors, (62), 1 states have return successors, (62), 1 states have call predecessors, (62), 1 states have call successors, (62) Word has length 330 [2025-03-04 11:35:39,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:35:39,398 INFO L225 Difference]: With dead ends: 144 [2025-03-04 11:35:39,399 INFO L226 Difference]: Without dead ends: 138 [2025-03-04 11:35:39,399 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 11:35:39,400 INFO L435 NwaCegarLoop]: 191 mSDtfsCounter, 6 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:35:39,401 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 358 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:35:39,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2025-03-04 11:35:39,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2025-03-04 11:35:39,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 54 states have (on average 1.3703703703703705) internal successors, (74), 69 states have internal predecessors, (74), 67 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 67 states have call predecessors, (67), 67 states have call successors, (67) [2025-03-04 11:35:39,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 208 transitions. [2025-03-04 11:35:39,423 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 208 transitions. Word has length 330 [2025-03-04 11:35:39,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:35:39,424 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 208 transitions. [2025-03-04 11:35:39,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (62), 1 states have call predecessors, (62), 1 states have return successors, (62), 1 states have call predecessors, (62), 1 states have call successors, (62) [2025-03-04 11:35:39,424 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 208 transitions. [2025-03-04 11:35:39,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 332 [2025-03-04 11:35:39,427 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:35:39,427 INFO L218 NwaCegarLoop]: trace histogram [62, 62, 62, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:35:39,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 11:35:39,427 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-03-04 11:35:39,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:35:39,428 INFO L85 PathProgramCache]: Analyzing trace with hash -1937338885, now seen corresponding path program 1 times [2025-03-04 11:35:39,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:35:39,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018840719] [2025-03-04 11:35:39,428 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:39,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:35:39,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 331 statements into 1 equivalence classes. [2025-03-04 11:35:39,457 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 331 of 331 statements. [2025-03-04 11:35:39,457 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:39,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:39,721 INFO L134 CoverageAnalysis]: Checked inductivity of 7564 backedges. 6 proven. 354 refuted. 0 times theorem prover too weak. 7204 trivial. 0 not checked. [2025-03-04 11:35:39,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:35:39,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018840719] [2025-03-04 11:35:39,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018840719] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:35:39,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [196060147] [2025-03-04 11:35:39,721 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:39,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:35:39,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:35:39,726 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:35:39,727 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 11:35:39,764 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 331 statements into 1 equivalence classes. [2025-03-04 11:35:39,818 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 331 of 331 statements. [2025-03-04 11:35:39,818 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:39,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:39,822 INFO L256 TraceCheckSpWp]: Trace formula consists of 617 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 11:35:39,826 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:35:40,055 INFO L134 CoverageAnalysis]: Checked inductivity of 7564 backedges. 0 proven. 183 refuted. 0 times theorem prover too weak. 7381 trivial. 0 not checked. [2025-03-04 11:35:40,055 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:35:40,348 INFO L134 CoverageAnalysis]: Checked inductivity of 7564 backedges. 0 proven. 183 refuted. 0 times theorem prover too weak. 7381 trivial. 0 not checked. [2025-03-04 11:35:40,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [196060147] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:35:40,348 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:35:40,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2025-03-04 11:35:40,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907278525] [2025-03-04 11:35:40,349 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:35:40,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 11:35:40,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:35:40,351 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 11:35:40,352 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-03-04 11:35:40,352 INFO L87 Difference]: Start difference. First operand 138 states and 208 transitions. Second operand has 11 states, 10 states have (on average 6.4) internal successors, (64), 11 states have internal predecessors, (64), 5 states have call successors, (182), 1 states have call predecessors, (182), 2 states have return successors, (182), 4 states have call predecessors, (182), 5 states have call successors, (182) [2025-03-04 11:35:40,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:35:40,685 INFO L93 Difference]: Finished difference Result 138 states and 208 transitions. [2025-03-04 11:35:40,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 11:35:40,685 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.4) internal successors, (64), 11 states have internal predecessors, (64), 5 states have call successors, (182), 1 states have call predecessors, (182), 2 states have return successors, (182), 4 states have call predecessors, (182), 5 states have call successors, (182) Word has length 331 [2025-03-04 11:35:40,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:35:40,687 INFO L225 Difference]: With dead ends: 138 [2025-03-04 11:35:40,687 INFO L226 Difference]: Without dead ends: 137 [2025-03-04 11:35:40,687 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 669 GetRequests, 658 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2025-03-04 11:35:40,688 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 0 mSDsluCounter, 721 mSDsCounter, 0 mSdLazyCounter, 496 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 854 SdHoareTripleChecker+Invalid, 496 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 496 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 11:35:40,688 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 854 Invalid, 496 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 496 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 11:35:40,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2025-03-04 11:35:40,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2025-03-04 11:35:40,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 54 states have (on average 1.3518518518518519) internal successors, (73), 68 states have internal predecessors, (73), 67 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 67 states have call predecessors, (67), 67 states have call successors, (67) [2025-03-04 11:35:40,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 207 transitions. [2025-03-04 11:35:40,700 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 207 transitions. Word has length 331 [2025-03-04 11:35:40,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:35:40,700 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 207 transitions. [2025-03-04 11:35:40,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.4) internal successors, (64), 11 states have internal predecessors, (64), 5 states have call successors, (182), 1 states have call predecessors, (182), 2 states have return successors, (182), 4 states have call predecessors, (182), 5 states have call successors, (182) [2025-03-04 11:35:40,701 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 207 transitions. [2025-03-04 11:35:40,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2025-03-04 11:35:40,704 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:35:40,704 INFO L218 NwaCegarLoop]: trace histogram [63, 63, 63, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:35:40,712 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-04 11:35:40,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:35:40,909 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-03-04 11:35:40,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:35:40,910 INFO L85 PathProgramCache]: Analyzing trace with hash 2032294453, now seen corresponding path program 1 times [2025-03-04 11:35:40,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:35:40,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094745148] [2025-03-04 11:35:40,910 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:40,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:35:40,918 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 336 statements into 1 equivalence classes. [2025-03-04 11:35:40,937 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 336 of 336 statements. [2025-03-04 11:35:40,938 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:40,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:41,127 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 6 proven. 180 refuted. 0 times theorem prover too weak. 7626 trivial. 0 not checked. [2025-03-04 11:35:41,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:35:41,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094745148] [2025-03-04 11:35:41,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094745148] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:35:41,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1404860523] [2025-03-04 11:35:41,128 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:41,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:35:41,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:35:41,130 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:35:41,132 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 11:35:41,169 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 336 statements into 1 equivalence classes. [2025-03-04 11:35:41,237 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 336 of 336 statements. [2025-03-04 11:35:41,238 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:41,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:41,240 INFO L256 TraceCheckSpWp]: Trace formula consists of 629 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-04 11:35:41,245 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:35:41,706 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 228 proven. 480 refuted. 0 times theorem prover too weak. 7104 trivial. 0 not checked. [2025-03-04 11:35:41,706 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:35:42,094 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 228 proven. 480 refuted. 0 times theorem prover too weak. 7104 trivial. 0 not checked. [2025-03-04 11:35:42,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1404860523] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:35:42,095 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:35:42,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 10] total 19 [2025-03-04 11:35:42,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593949427] [2025-03-04 11:35:42,095 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:35:42,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-04 11:35:42,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:35:42,096 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-04 11:35:42,096 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=316, Unknown=0, NotChecked=0, Total=380 [2025-03-04 11:35:42,097 INFO L87 Difference]: Start difference. First operand 137 states and 207 transitions. Second operand has 20 states, 18 states have (on average 3.7222222222222223) internal successors, (67), 17 states have internal predecessors, (67), 11 states have call successors, (187), 1 states have call predecessors, (187), 2 states have return successors, (189), 11 states have call predecessors, (189), 11 states have call successors, (189) [2025-03-04 11:35:42,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:35:42,739 INFO L93 Difference]: Finished difference Result 141 states and 214 transitions. [2025-03-04 11:35:42,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 11:35:42,739 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 3.7222222222222223) internal successors, (67), 17 states have internal predecessors, (67), 11 states have call successors, (187), 1 states have call predecessors, (187), 2 states have return successors, (189), 11 states have call predecessors, (189), 11 states have call successors, (189) Word has length 336 [2025-03-04 11:35:42,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:35:42,741 INFO L225 Difference]: With dead ends: 141 [2025-03-04 11:35:42,741 INFO L226 Difference]: Without dead ends: 140 [2025-03-04 11:35:42,742 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 682 GetRequests, 657 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=146, Invalid=556, Unknown=0, NotChecked=0, Total=702 [2025-03-04 11:35:42,743 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 34 mSDsluCounter, 1222 mSDsCounter, 0 mSdLazyCounter, 950 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 1350 SdHoareTripleChecker+Invalid, 1010 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 950 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 11:35:42,743 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 1350 Invalid, 1010 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 950 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 11:35:42,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2025-03-04 11:35:42,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 136. [2025-03-04 11:35:42,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 54 states have (on average 1.3333333333333333) internal successors, (72), 67 states have internal predecessors, (72), 67 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 67 states have call predecessors, (67), 67 states have call successors, (67) [2025-03-04 11:35:42,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 206 transitions. [2025-03-04 11:35:42,760 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 206 transitions. Word has length 336 [2025-03-04 11:35:42,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:35:42,761 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 206 transitions. [2025-03-04 11:35:42,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 3.7222222222222223) internal successors, (67), 17 states have internal predecessors, (67), 11 states have call successors, (187), 1 states have call predecessors, (187), 2 states have return successors, (189), 11 states have call predecessors, (189), 11 states have call successors, (189) [2025-03-04 11:35:42,762 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 206 transitions. [2025-03-04 11:35:42,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2025-03-04 11:35:42,764 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:35:42,764 INFO L218 NwaCegarLoop]: trace histogram [63, 63, 63, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:35:42,771 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-04 11:35:42,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:35:42,965 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-03-04 11:35:42,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:35:42,966 INFO L85 PathProgramCache]: Analyzing trace with hash -1423381367, now seen corresponding path program 1 times [2025-03-04 11:35:42,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:35:42,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415220228] [2025-03-04 11:35:42,966 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:42,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:35:42,976 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 337 statements into 1 equivalence classes. [2025-03-04 11:35:42,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 337 of 337 statements. [2025-03-04 11:35:42,993 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:42,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:43,163 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 12 proven. 174 refuted. 0 times theorem prover too weak. 7626 trivial. 0 not checked. [2025-03-04 11:35:43,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:35:43,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415220228] [2025-03-04 11:35:43,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415220228] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:35:43,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1919433215] [2025-03-04 11:35:43,164 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:43,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:35:43,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:35:43,166 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:35:43,168 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 11:35:43,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 337 statements into 1 equivalence classes. [2025-03-04 11:35:43,260 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 337 of 337 statements. [2025-03-04 11:35:43,260 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:43,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:43,263 INFO L256 TraceCheckSpWp]: Trace formula consists of 630 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 11:35:43,267 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:35:43,464 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 12 proven. 174 refuted. 0 times theorem prover too weak. 7626 trivial. 0 not checked. [2025-03-04 11:35:43,464 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:35:43,719 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 12 proven. 174 refuted. 0 times theorem prover too weak. 7626 trivial. 0 not checked. [2025-03-04 11:35:43,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1919433215] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:35:43,719 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:35:43,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-03-04 11:35:43,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12535807] [2025-03-04 11:35:43,720 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:35:43,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 11:35:43,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:35:43,721 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 11:35:43,721 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 11:35:43,721 INFO L87 Difference]: Start difference. First operand 136 states and 206 transitions. Second operand has 8 states, 7 states have (on average 6.857142857142857) internal successors, (48), 8 states have internal predecessors, (48), 4 states have call successors, (121), 1 states have call predecessors, (121), 2 states have return successors, (122), 4 states have call predecessors, (122), 4 states have call successors, (122) [2025-03-04 11:35:43,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:35:43,912 INFO L93 Difference]: Finished difference Result 136 states and 206 transitions. [2025-03-04 11:35:43,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 11:35:43,913 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.857142857142857) internal successors, (48), 8 states have internal predecessors, (48), 4 states have call successors, (121), 1 states have call predecessors, (121), 2 states have return successors, (122), 4 states have call predecessors, (122), 4 states have call successors, (122) Word has length 337 [2025-03-04 11:35:43,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:35:43,914 INFO L225 Difference]: With dead ends: 136 [2025-03-04 11:35:43,914 INFO L226 Difference]: Without dead ends: 135 [2025-03-04 11:35:43,914 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 677 GetRequests, 670 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 11:35:43,915 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 9 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 420 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 11:35:43,915 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 420 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 11:35:43,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2025-03-04 11:35:43,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2025-03-04 11:35:43,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 54 states have (on average 1.3148148148148149) internal successors, (71), 66 states have internal predecessors, (71), 67 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 67 states have call predecessors, (67), 67 states have call successors, (67) [2025-03-04 11:35:43,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 205 transitions. [2025-03-04 11:35:43,923 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 205 transitions. Word has length 337 [2025-03-04 11:35:43,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:35:43,924 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 205 transitions. [2025-03-04 11:35:43,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 6.857142857142857) internal successors, (48), 8 states have internal predecessors, (48), 4 states have call successors, (121), 1 states have call predecessors, (121), 2 states have return successors, (122), 4 states have call predecessors, (122), 4 states have call successors, (122) [2025-03-04 11:35:43,924 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 205 transitions. [2025-03-04 11:35:43,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2025-03-04 11:35:43,925 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:35:43,925 INFO L218 NwaCegarLoop]: trace histogram [63, 63, 63, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:35:43,934 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-04 11:35:44,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:35:44,126 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-03-04 11:35:44,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:35:44,127 INFO L85 PathProgramCache]: Analyzing trace with hash 257837842, now seen corresponding path program 1 times [2025-03-04 11:35:44,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:35:44,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129229537] [2025-03-04 11:35:44,127 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:44,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:35:44,135 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 340 statements into 1 equivalence classes. [2025-03-04 11:35:44,161 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 340 of 340 statements. [2025-03-04 11:35:44,161 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:44,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:44,360 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 18 proven. 348 refuted. 0 times theorem prover too weak. 7446 trivial. 0 not checked. [2025-03-04 11:35:44,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:35:44,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129229537] [2025-03-04 11:35:44,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129229537] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:35:44,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1652966856] [2025-03-04 11:35:44,361 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:44,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:35:44,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:35:44,363 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:35:44,365 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 11:35:44,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 340 statements into 1 equivalence classes. [2025-03-04 11:35:44,454 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 340 of 340 statements. [2025-03-04 11:35:44,454 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:44,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:44,461 INFO L256 TraceCheckSpWp]: Trace formula consists of 635 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-04 11:35:44,467 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:35:44,791 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 228 proven. 480 refuted. 0 times theorem prover too weak. 7104 trivial. 0 not checked. [2025-03-04 11:35:44,791 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:35:45,205 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 228 proven. 480 refuted. 0 times theorem prover too weak. 7104 trivial. 0 not checked. [2025-03-04 11:35:45,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1652966856] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:35:45,205 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:35:45,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 10, 11] total 22 [2025-03-04 11:35:45,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21216573] [2025-03-04 11:35:45,205 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:35:45,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-04 11:35:45,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:35:45,206 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-04 11:35:45,207 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=434, Unknown=0, NotChecked=0, Total=506 [2025-03-04 11:35:45,207 INFO L87 Difference]: Start difference. First operand 135 states and 205 transitions. Second operand has 23 states, 21 states have (on average 3.761904761904762) internal successors, (79), 23 states have internal predecessors, (79), 11 states have call successors, (187), 1 states have call predecessors, (187), 2 states have return successors, (189), 11 states have call predecessors, (189), 11 states have call successors, (189) [2025-03-04 11:35:45,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:35:45,764 INFO L93 Difference]: Finished difference Result 139 states and 210 transitions. [2025-03-04 11:35:45,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 11:35:45,764 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 21 states have (on average 3.761904761904762) internal successors, (79), 23 states have internal predecessors, (79), 11 states have call successors, (187), 1 states have call predecessors, (187), 2 states have return successors, (189), 11 states have call predecessors, (189), 11 states have call successors, (189) Word has length 340 [2025-03-04 11:35:45,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:35:45,766 INFO L225 Difference]: With dead ends: 139 [2025-03-04 11:35:45,766 INFO L226 Difference]: Without dead ends: 138 [2025-03-04 11:35:45,766 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 693 GetRequests, 665 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=153, Invalid=717, Unknown=0, NotChecked=0, Total=870 [2025-03-04 11:35:45,767 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 49 mSDsluCounter, 1170 mSDsCounter, 0 mSdLazyCounter, 861 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 1293 SdHoareTripleChecker+Invalid, 985 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 861 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 11:35:45,767 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 1293 Invalid, 985 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 861 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 11:35:45,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2025-03-04 11:35:45,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 134. [2025-03-04 11:35:45,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 54 states have (on average 1.2962962962962963) internal successors, (70), 65 states have internal predecessors, (70), 67 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 67 states have call predecessors, (67), 67 states have call successors, (67) [2025-03-04 11:35:45,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 204 transitions. [2025-03-04 11:35:45,779 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 204 transitions. Word has length 340 [2025-03-04 11:35:45,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:35:45,779 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 204 transitions. [2025-03-04 11:35:45,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 21 states have (on average 3.761904761904762) internal successors, (79), 23 states have internal predecessors, (79), 11 states have call successors, (187), 1 states have call predecessors, (187), 2 states have return successors, (189), 11 states have call predecessors, (189), 11 states have call successors, (189) [2025-03-04 11:35:45,780 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 204 transitions. [2025-03-04 11:35:45,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 346 [2025-03-04 11:35:45,781 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:35:45,781 INFO L218 NwaCegarLoop]: trace histogram [64, 64, 64, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:35:45,790 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-04 11:35:45,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:35:45,987 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-03-04 11:35:45,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:35:45,988 INFO L85 PathProgramCache]: Analyzing trace with hash -521623190, now seen corresponding path program 1 times [2025-03-04 11:35:45,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:35:45,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564308184] [2025-03-04 11:35:45,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:45,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:35:45,996 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 345 statements into 1 equivalence classes. [2025-03-04 11:35:46,010 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 345 of 345 statements. [2025-03-04 11:35:46,011 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:46,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:46,135 INFO L134 CoverageAnalysis]: Checked inductivity of 8064 backedges. 12 proven. 177 refuted. 0 times theorem prover too weak. 7875 trivial. 0 not checked. [2025-03-04 11:35:46,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:35:46,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564308184] [2025-03-04 11:35:46,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564308184] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:35:46,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [38957638] [2025-03-04 11:35:46,135 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:46,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:35:46,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:35:46,138 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:35:46,139 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-04 11:35:46,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 345 statements into 1 equivalence classes. [2025-03-04 11:35:46,241 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 345 of 345 statements. [2025-03-04 11:35:46,241 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:46,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:46,244 INFO L256 TraceCheckSpWp]: Trace formula consists of 647 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 11:35:46,248 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:35:46,421 INFO L134 CoverageAnalysis]: Checked inductivity of 8064 backedges. 12 proven. 177 refuted. 0 times theorem prover too weak. 7875 trivial. 0 not checked. [2025-03-04 11:35:46,421 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:35:46,659 INFO L134 CoverageAnalysis]: Checked inductivity of 8064 backedges. 12 proven. 177 refuted. 0 times theorem prover too weak. 7875 trivial. 0 not checked. [2025-03-04 11:35:46,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [38957638] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:35:46,660 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:35:46,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-03-04 11:35:46,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145659383] [2025-03-04 11:35:46,660 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:35:46,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 11:35:46,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:35:46,662 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 11:35:46,662 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-04 11:35:46,662 INFO L87 Difference]: Start difference. First operand 134 states and 204 transitions. Second operand has 10 states, 9 states have (on average 8.333333333333334) internal successors, (75), 8 states have internal predecessors, (75), 6 states have call successors, (181), 1 states have call predecessors, (181), 2 states have return successors, (182), 6 states have call predecessors, (182), 6 states have call successors, (182) [2025-03-04 11:35:46,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:35:46,933 INFO L93 Difference]: Finished difference Result 134 states and 204 transitions. [2025-03-04 11:35:46,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 11:35:46,933 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 8.333333333333334) internal successors, (75), 8 states have internal predecessors, (75), 6 states have call successors, (181), 1 states have call predecessors, (181), 2 states have return successors, (182), 6 states have call predecessors, (182), 6 states have call successors, (182) Word has length 345 [2025-03-04 11:35:46,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:35:46,935 INFO L225 Difference]: With dead ends: 134 [2025-03-04 11:35:46,935 INFO L226 Difference]: Without dead ends: 133 [2025-03-04 11:35:46,935 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 693 GetRequests, 685 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-04 11:35:46,935 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 7 mSDsluCounter, 592 mSDsCounter, 0 mSdLazyCounter, 552 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 722 SdHoareTripleChecker+Invalid, 552 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 552 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 11:35:46,935 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 722 Invalid, 552 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 552 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 11:35:46,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2025-03-04 11:35:46,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2025-03-04 11:35:46,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 54 states have (on average 1.2777777777777777) internal successors, (69), 64 states have internal predecessors, (69), 67 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 67 states have call predecessors, (67), 67 states have call successors, (67) [2025-03-04 11:35:46,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 203 transitions. [2025-03-04 11:35:46,943 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 203 transitions. Word has length 345 [2025-03-04 11:35:46,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:35:46,944 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 203 transitions. [2025-03-04 11:35:46,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 8.333333333333334) internal successors, (75), 8 states have internal predecessors, (75), 6 states have call successors, (181), 1 states have call predecessors, (181), 2 states have return successors, (182), 6 states have call predecessors, (182), 6 states have call successors, (182) [2025-03-04 11:35:46,944 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 203 transitions. [2025-03-04 11:35:46,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 347 [2025-03-04 11:35:46,945 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:35:46,945 INFO L218 NwaCegarLoop]: trace histogram [64, 64, 64, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:35:46,952 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-04 11:35:47,150 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,SelfDestructingSolverStorable8 [2025-03-04 11:35:47,150 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-03-04 11:35:47,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:35:47,150 INFO L85 PathProgramCache]: Analyzing trace with hash 1009550312, now seen corresponding path program 1 times [2025-03-04 11:35:47,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:35:47,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992678567] [2025-03-04 11:35:47,151 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:47,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:35:47,158 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 346 statements into 1 equivalence classes. [2025-03-04 11:35:47,179 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 346 of 346 statements. [2025-03-04 11:35:47,179 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:47,179 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:47,330 INFO L134 CoverageAnalysis]: Checked inductivity of 8064 backedges. 18 proven. 171 refuted. 0 times theorem prover too weak. 7875 trivial. 0 not checked. [2025-03-04 11:35:47,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:35:47,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992678567] [2025-03-04 11:35:47,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992678567] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:35:47,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [716806658] [2025-03-04 11:35:47,330 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:47,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:35:47,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:35:47,332 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-04 11:35:47,334 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-04 11:35:47,373 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 346 statements into 1 equivalence classes. [2025-03-04 11:35:47,429 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 346 of 346 statements. [2025-03-04 11:35:47,429 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:47,429 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:47,431 INFO L256 TraceCheckSpWp]: Trace formula consists of 648 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 11:35:47,436 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:35:47,649 INFO L134 CoverageAnalysis]: Checked inductivity of 8064 backedges. 18 proven. 171 refuted. 0 times theorem prover too weak. 7875 trivial. 0 not checked. [2025-03-04 11:35:47,649 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:35:47,913 INFO L134 CoverageAnalysis]: Checked inductivity of 8064 backedges. 18 proven. 171 refuted. 0 times theorem prover too weak. 7875 trivial. 0 not checked. [2025-03-04 11:35:47,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [716806658] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:35:47,914 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:35:47,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-03-04 11:35:47,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478099475] [2025-03-04 11:35:47,914 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:35:47,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 11:35:47,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:35:47,915 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 11:35:47,915 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 11:35:47,916 INFO L87 Difference]: Start difference. First operand 133 states and 203 transitions. Second operand has 8 states, 7 states have (on average 7.857142857142857) internal successors, (55), 8 states have internal predecessors, (55), 4 states have call successors, (121), 1 states have call predecessors, (121), 2 states have return successors, (122), 4 states have call predecessors, (122), 4 states have call successors, (122) [2025-03-04 11:35:48,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:35:48,156 INFO L93 Difference]: Finished difference Result 133 states and 203 transitions. [2025-03-04 11:35:48,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 11:35:48,157 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 7.857142857142857) internal successors, (55), 8 states have internal predecessors, (55), 4 states have call successors, (121), 1 states have call predecessors, (121), 2 states have return successors, (122), 4 states have call predecessors, (122), 4 states have call successors, (122) Word has length 346 [2025-03-04 11:35:48,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:35:48,159 INFO L225 Difference]: With dead ends: 133 [2025-03-04 11:35:48,159 INFO L226 Difference]: Without dead ends: 132 [2025-03-04 11:35:48,159 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 695 GetRequests, 688 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 11:35:48,160 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 18 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 378 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 11:35:48,160 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 457 Invalid, 378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 378 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 11:35:48,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2025-03-04 11:35:48,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2025-03-04 11:35:48,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 54 states have (on average 1.2592592592592593) internal successors, (68), 63 states have internal predecessors, (68), 67 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 67 states have call predecessors, (67), 67 states have call successors, (67) [2025-03-04 11:35:48,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 202 transitions. [2025-03-04 11:35:48,172 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 202 transitions. Word has length 346 [2025-03-04 11:35:48,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:35:48,174 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 202 transitions. [2025-03-04 11:35:48,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 7.857142857142857) internal successors, (55), 8 states have internal predecessors, (55), 4 states have call successors, (121), 1 states have call predecessors, (121), 2 states have return successors, (122), 4 states have call predecessors, (122), 4 states have call successors, (122) [2025-03-04 11:35:48,174 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 202 transitions. [2025-03-04 11:35:48,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 350 [2025-03-04 11:35:48,176 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:35:48,176 INFO L218 NwaCegarLoop]: trace histogram [64, 64, 64, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:35:48,183 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-04 11:35:48,376 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,SelfDestructingSolverStorable9 [2025-03-04 11:35:48,377 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-03-04 11:35:48,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:35:48,377 INFO L85 PathProgramCache]: Analyzing trace with hash -2142612281, now seen corresponding path program 1 times [2025-03-04 11:35:48,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:35:48,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979601543] [2025-03-04 11:35:48,377 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:48,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:35:48,384 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 349 statements into 1 equivalence classes. [2025-03-04 11:35:48,402 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 349 of 349 statements. [2025-03-04 11:35:48,403 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:48,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:48,533 INFO L134 CoverageAnalysis]: Checked inductivity of 8064 backedges. 12 proven. 177 refuted. 0 times theorem prover too weak. 7875 trivial. 0 not checked. [2025-03-04 11:35:48,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:35:48,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979601543] [2025-03-04 11:35:48,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979601543] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:35:48,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [559073106] [2025-03-04 11:35:48,534 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:48,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:35:48,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:35:48,536 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-04 11:35:48,537 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-04 11:35:48,574 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 349 statements into 1 equivalence classes. [2025-03-04 11:35:48,628 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 349 of 349 statements. [2025-03-04 11:35:48,628 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:48,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:48,631 INFO L256 TraceCheckSpWp]: Trace formula consists of 653 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 11:35:48,634 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:35:48,828 INFO L134 CoverageAnalysis]: Checked inductivity of 8064 backedges. 12 proven. 177 refuted. 0 times theorem prover too weak. 7875 trivial. 0 not checked. [2025-03-04 11:35:48,828 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:35:49,074 INFO L134 CoverageAnalysis]: Checked inductivity of 8064 backedges. 12 proven. 177 refuted. 0 times theorem prover too weak. 7875 trivial. 0 not checked. [2025-03-04 11:35:49,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [559073106] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:35:49,074 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:35:49,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 8 [2025-03-04 11:35:49,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357780339] [2025-03-04 11:35:49,075 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:35:49,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 11:35:49,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:35:49,076 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 11:35:49,076 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-04 11:35:49,076 INFO L87 Difference]: Start difference. First operand 132 states and 202 transitions. Second operand has 9 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 4 states have call successors, (122), 1 states have call predecessors, (122), 2 states have return successors, (122), 4 states have call predecessors, (122), 4 states have call successors, (122) [2025-03-04 11:35:49,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:35:49,412 INFO L93 Difference]: Finished difference Result 132 states and 202 transitions. [2025-03-04 11:35:49,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 11:35:49,412 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 4 states have call successors, (122), 1 states have call predecessors, (122), 2 states have return successors, (122), 4 states have call predecessors, (122), 4 states have call successors, (122) Word has length 349 [2025-03-04 11:35:49,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:35:49,414 INFO L225 Difference]: With dead ends: 132 [2025-03-04 11:35:49,414 INFO L226 Difference]: Without dead ends: 131 [2025-03-04 11:35:49,414 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 702 GetRequests, 693 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-04 11:35:49,414 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 18 mSDsluCounter, 456 mSDsCounter, 0 mSdLazyCounter, 645 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 581 SdHoareTripleChecker+Invalid, 645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 645 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 11:35:49,414 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 581 Invalid, 645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 645 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 11:35:49,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2025-03-04 11:35:49,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2025-03-04 11:35:49,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 54 states have (on average 1.2407407407407407) internal successors, (67), 62 states have internal predecessors, (67), 67 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 67 states have call predecessors, (67), 67 states have call successors, (67) [2025-03-04 11:35:49,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 201 transitions. [2025-03-04 11:35:49,423 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 201 transitions. Word has length 349 [2025-03-04 11:35:49,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:35:49,424 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 201 transitions. [2025-03-04 11:35:49,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 4 states have call successors, (122), 1 states have call predecessors, (122), 2 states have return successors, (122), 4 states have call predecessors, (122), 4 states have call successors, (122) [2025-03-04 11:35:49,424 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 201 transitions. [2025-03-04 11:35:49,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 355 [2025-03-04 11:35:49,425 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:35:49,425 INFO L218 NwaCegarLoop]: trace histogram [65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:35:49,433 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-04 11:35:49,626 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,SelfDestructingSolverStorable10 [2025-03-04 11:35:49,626 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-03-04 11:35:49,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:35:49,626 INFO L85 PathProgramCache]: Analyzing trace with hash -989339967, now seen corresponding path program 1 times [2025-03-04 11:35:49,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:35:49,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428026228] [2025-03-04 11:35:49,627 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:49,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:35:49,633 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 354 statements into 1 equivalence classes. [2025-03-04 11:35:49,647 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 354 of 354 statements. [2025-03-04 11:35:49,647 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:49,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:49,761 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 18 proven. 174 refuted. 0 times theorem prover too weak. 8128 trivial. 0 not checked. [2025-03-04 11:35:49,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:35:49,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428026228] [2025-03-04 11:35:49,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428026228] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:35:49,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [141880212] [2025-03-04 11:35:49,761 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:49,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:35:49,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:35:49,763 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-04 11:35:49,764 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-04 11:35:49,801 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 354 statements into 1 equivalence classes. [2025-03-04 11:35:49,853 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 354 of 354 statements. [2025-03-04 11:35:49,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:49,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:49,860 INFO L256 TraceCheckSpWp]: Trace formula consists of 665 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-04 11:35:49,865 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:35:50,170 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 270 proven. 462 refuted. 0 times theorem prover too weak. 7588 trivial. 0 not checked. [2025-03-04 11:35:50,170 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:35:50,516 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 270 proven. 462 refuted. 0 times theorem prover too weak. 7588 trivial. 0 not checked. [2025-03-04 11:35:50,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [141880212] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:35:50,516 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:35:50,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 10] total 19 [2025-03-04 11:35:50,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542136764] [2025-03-04 11:35:50,517 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:35:50,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-04 11:35:50,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:35:50,518 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-04 11:35:50,518 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=316, Unknown=0, NotChecked=0, Total=380 [2025-03-04 11:35:50,519 INFO L87 Difference]: Start difference. First operand 131 states and 201 transitions. Second operand has 20 states, 18 states have (on average 4.833333333333333) internal successors, (87), 17 states have internal predecessors, (87), 11 states have call successors, (185), 1 states have call predecessors, (185), 2 states have return successors, (187), 11 states have call predecessors, (187), 11 states have call successors, (187) [2025-03-04 11:35:51,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:35:51,007 INFO L93 Difference]: Finished difference Result 135 states and 208 transitions. [2025-03-04 11:35:51,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 11:35:51,007 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 4.833333333333333) internal successors, (87), 17 states have internal predecessors, (87), 11 states have call successors, (185), 1 states have call predecessors, (185), 2 states have return successors, (187), 11 states have call predecessors, (187), 11 states have call successors, (187) Word has length 354 [2025-03-04 11:35:51,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:35:51,009 INFO L225 Difference]: With dead ends: 135 [2025-03-04 11:35:51,009 INFO L226 Difference]: Without dead ends: 134 [2025-03-04 11:35:51,009 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 718 GetRequests, 693 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=146, Invalid=556, Unknown=0, NotChecked=0, Total=702 [2025-03-04 11:35:51,009 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 117 mSDsluCounter, 986 mSDsCounter, 0 mSdLazyCounter, 902 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 1106 SdHoareTripleChecker+Invalid, 1018 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 902 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 11:35:51,010 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 1106 Invalid, 1018 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 902 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 11:35:51,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2025-03-04 11:35:51,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 130. [2025-03-04 11:35:51,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 54 states have (on average 1.2222222222222223) internal successors, (66), 61 states have internal predecessors, (66), 67 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 67 states have call predecessors, (67), 67 states have call successors, (67) [2025-03-04 11:35:51,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 200 transitions. [2025-03-04 11:35:51,021 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 200 transitions. Word has length 354 [2025-03-04 11:35:51,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:35:51,022 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 200 transitions. [2025-03-04 11:35:51,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 4.833333333333333) internal successors, (87), 17 states have internal predecessors, (87), 11 states have call successors, (185), 1 states have call predecessors, (185), 2 states have return successors, (187), 11 states have call predecessors, (187), 11 states have call successors, (187) [2025-03-04 11:35:51,023 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 200 transitions. [2025-03-04 11:35:51,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 356 [2025-03-04 11:35:51,024 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:35:51,024 INFO L218 NwaCegarLoop]: trace histogram [65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:35:51,032 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-04 11:35:51,224 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,SelfDestructingSolverStorable11 [2025-03-04 11:35:51,224 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-03-04 11:35:51,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:35:51,225 INFO L85 PathProgramCache]: Analyzing trace with hash -604767899, now seen corresponding path program 1 times [2025-03-04 11:35:51,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:35:51,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181691030] [2025-03-04 11:35:51,225 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:51,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:35:51,231 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 355 statements into 1 equivalence classes. [2025-03-04 11:35:51,243 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 355 of 355 statements. [2025-03-04 11:35:51,244 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:51,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:51,346 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 24 proven. 168 refuted. 0 times theorem prover too weak. 8128 trivial. 0 not checked. [2025-03-04 11:35:51,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:35:51,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181691030] [2025-03-04 11:35:51,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181691030] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:35:51,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [101713796] [2025-03-04 11:35:51,346 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:51,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:35:51,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:35:51,349 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-04 11:35:51,350 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-04 11:35:51,387 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 355 statements into 1 equivalence classes. [2025-03-04 11:35:51,446 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 355 of 355 statements. [2025-03-04 11:35:51,446 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:51,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:51,448 INFO L256 TraceCheckSpWp]: Trace formula consists of 666 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 11:35:51,451 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:35:51,621 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 24 proven. 168 refuted. 0 times theorem prover too weak. 8128 trivial. 0 not checked. [2025-03-04 11:35:51,622 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:35:51,832 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 24 proven. 168 refuted. 0 times theorem prover too weak. 8128 trivial. 0 not checked. [2025-03-04 11:35:51,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [101713796] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:35:51,832 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:35:51,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-03-04 11:35:51,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836727592] [2025-03-04 11:35:51,833 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:35:51,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 11:35:51,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:35:51,834 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 11:35:51,834 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 11:35:51,834 INFO L87 Difference]: Start difference. First operand 130 states and 200 transitions. Second operand has 8 states, 7 states have (on average 8.857142857142858) internal successors, (62), 8 states have internal predecessors, (62), 4 states have call successors, (121), 1 states have call predecessors, (121), 2 states have return successors, (122), 4 states have call predecessors, (122), 4 states have call successors, (122) [2025-03-04 11:35:52,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:35:52,028 INFO L93 Difference]: Finished difference Result 130 states and 200 transitions. [2025-03-04 11:35:52,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 11:35:52,029 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 8.857142857142858) internal successors, (62), 8 states have internal predecessors, (62), 4 states have call successors, (121), 1 states have call predecessors, (121), 2 states have return successors, (122), 4 states have call predecessors, (122), 4 states have call successors, (122) Word has length 355 [2025-03-04 11:35:52,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:35:52,030 INFO L225 Difference]: With dead ends: 130 [2025-03-04 11:35:52,030 INFO L226 Difference]: Without dead ends: 129 [2025-03-04 11:35:52,030 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 713 GetRequests, 706 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 11:35:52,031 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 9 mSDsluCounter, 394 mSDsCounter, 0 mSdLazyCounter, 399 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 521 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 11:35:52,031 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 521 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 399 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 11:35:52,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2025-03-04 11:35:52,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2025-03-04 11:35:52,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 54 states have (on average 1.2037037037037037) internal successors, (65), 60 states have internal predecessors, (65), 67 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 67 states have call predecessors, (67), 67 states have call successors, (67) [2025-03-04 11:35:52,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 199 transitions. [2025-03-04 11:35:52,043 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 199 transitions. Word has length 355 [2025-03-04 11:35:52,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:35:52,043 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 199 transitions. [2025-03-04 11:35:52,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 8.857142857142858) internal successors, (62), 8 states have internal predecessors, (62), 4 states have call successors, (121), 1 states have call predecessors, (121), 2 states have return successors, (122), 4 states have call predecessors, (122), 4 states have call successors, (122) [2025-03-04 11:35:52,044 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 199 transitions. [2025-03-04 11:35:52,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 359 [2025-03-04 11:35:52,045 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:35:52,045 INFO L218 NwaCegarLoop]: trace histogram [65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:35:52,051 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-04 11:35:52,245 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,SelfDestructingSolverStorable12 [2025-03-04 11:35:52,246 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-03-04 11:35:52,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:35:52,246 INFO L85 PathProgramCache]: Analyzing trace with hash 747332510, now seen corresponding path program 1 times [2025-03-04 11:35:52,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:35:52,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051617330] [2025-03-04 11:35:52,246 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:52,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:35:52,254 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 358 statements into 1 equivalence classes. [2025-03-04 11:35:52,267 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 358 of 358 statements. [2025-03-04 11:35:52,267 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:52,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:52,413 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 18 proven. 174 refuted. 0 times theorem prover too weak. 8128 trivial. 0 not checked. [2025-03-04 11:35:52,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:35:52,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051617330] [2025-03-04 11:35:52,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051617330] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:35:52,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1644225692] [2025-03-04 11:35:52,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:52,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:35:52,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:35:52,415 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-04 11:35:52,418 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-04 11:35:52,468 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 358 statements into 1 equivalence classes. [2025-03-04 11:35:52,525 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 358 of 358 statements. [2025-03-04 11:35:52,525 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:52,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:52,528 INFO L256 TraceCheckSpWp]: Trace formula consists of 671 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-04 11:35:52,532 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:35:52,850 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 270 proven. 462 refuted. 0 times theorem prover too weak. 7588 trivial. 0 not checked. [2025-03-04 11:35:52,850 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:35:53,150 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 270 proven. 462 refuted. 0 times theorem prover too weak. 7588 trivial. 0 not checked. [2025-03-04 11:35:53,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1644225692] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:35:53,150 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:35:53,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 10, 11] total 20 [2025-03-04 11:35:53,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447489106] [2025-03-04 11:35:53,150 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:35:53,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-04 11:35:53,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:35:53,151 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-04 11:35:53,151 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=358, Unknown=0, NotChecked=0, Total=420 [2025-03-04 11:35:53,152 INFO L87 Difference]: Start difference. First operand 129 states and 199 transitions. Second operand has 21 states, 19 states have (on average 4.947368421052632) internal successors, (94), 20 states have internal predecessors, (94), 11 states have call successors, (185), 1 states have call predecessors, (185), 2 states have return successors, (187), 10 states have call predecessors, (187), 11 states have call successors, (187) [2025-03-04 11:35:53,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:35:53,614 INFO L93 Difference]: Finished difference Result 133 states and 204 transitions. [2025-03-04 11:35:53,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 11:35:53,614 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 19 states have (on average 4.947368421052632) internal successors, (94), 20 states have internal predecessors, (94), 11 states have call successors, (185), 1 states have call predecessors, (185), 2 states have return successors, (187), 10 states have call predecessors, (187), 11 states have call successors, (187) Word has length 358 [2025-03-04 11:35:53,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:35:53,615 INFO L225 Difference]: With dead ends: 133 [2025-03-04 11:35:53,615 INFO L226 Difference]: Without dead ends: 132 [2025-03-04 11:35:53,616 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 727 GetRequests, 700 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=138, Invalid=618, Unknown=0, NotChecked=0, Total=756 [2025-03-04 11:35:53,616 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 102 mSDsluCounter, 920 mSDsCounter, 0 mSdLazyCounter, 774 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 1035 SdHoareTripleChecker+Invalid, 888 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 774 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 11:35:53,616 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 1035 Invalid, 888 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 774 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 11:35:53,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2025-03-04 11:35:53,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 128. [2025-03-04 11:35:53,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 54 states have (on average 1.1851851851851851) internal successors, (64), 59 states have internal predecessors, (64), 67 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 67 states have call predecessors, (67), 67 states have call successors, (67) [2025-03-04 11:35:53,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 198 transitions. [2025-03-04 11:35:53,626 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 198 transitions. Word has length 358 [2025-03-04 11:35:53,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:35:53,626 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 198 transitions. [2025-03-04 11:35:53,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 19 states have (on average 4.947368421052632) internal successors, (94), 20 states have internal predecessors, (94), 11 states have call successors, (185), 1 states have call predecessors, (185), 2 states have return successors, (187), 10 states have call predecessors, (187), 11 states have call successors, (187) [2025-03-04 11:35:53,627 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 198 transitions. [2025-03-04 11:35:53,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 364 [2025-03-04 11:35:53,628 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:35:53,628 INFO L218 NwaCegarLoop]: trace histogram [66, 66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:35:53,636 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-03-04 11:35:53,828 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,SelfDestructingSolverStorable13 [2025-03-04 11:35:53,829 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-03-04 11:35:53,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:35:53,829 INFO L85 PathProgramCache]: Analyzing trace with hash -47057866, now seen corresponding path program 1 times [2025-03-04 11:35:53,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:35:53,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701191881] [2025-03-04 11:35:53,829 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:53,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:35:53,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 363 statements into 1 equivalence classes. [2025-03-04 11:35:53,849 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 363 of 363 statements. [2025-03-04 11:35:53,849 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:53,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:53,961 INFO L134 CoverageAnalysis]: Checked inductivity of 8580 backedges. 24 proven. 171 refuted. 0 times theorem prover too weak. 8385 trivial. 0 not checked. [2025-03-04 11:35:53,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:35:53,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701191881] [2025-03-04 11:35:53,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701191881] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:35:53,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [695201977] [2025-03-04 11:35:53,962 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:53,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:35:53,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:35:53,964 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-04 11:35:53,966 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-04 11:35:54,005 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 363 statements into 1 equivalence classes. [2025-03-04 11:35:54,072 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 363 of 363 statements. [2025-03-04 11:35:54,072 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:54,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:54,078 INFO L256 TraceCheckSpWp]: Trace formula consists of 683 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-03-04 11:35:54,081 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:35:54,516 INFO L134 CoverageAnalysis]: Checked inductivity of 8580 backedges. 507 proven. 573 refuted. 0 times theorem prover too weak. 7500 trivial. 0 not checked. [2025-03-04 11:35:54,517 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:35:54,976 INFO L134 CoverageAnalysis]: Checked inductivity of 8580 backedges. 507 proven. 573 refuted. 0 times theorem prover too weak. 7500 trivial. 0 not checked. [2025-03-04 11:35:54,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [695201977] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:35:54,977 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:35:54,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 13, 15] total 28 [2025-03-04 11:35:54,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009574208] [2025-03-04 11:35:54,977 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:35:54,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-03-04 11:35:54,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:35:54,979 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-03-04 11:35:54,979 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=712, Unknown=0, NotChecked=0, Total=812 [2025-03-04 11:35:54,979 INFO L87 Difference]: Start difference. First operand 128 states and 198 transitions. Second operand has 29 states, 26 states have (on average 3.8076923076923075) internal successors, (99), 26 states have internal predecessors, (99), 15 states have call successors, (188), 1 states have call predecessors, (188), 2 states have return successors, (190), 15 states have call predecessors, (190), 15 states have call successors, (190) [2025-03-04 11:35:55,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:35:55,743 INFO L93 Difference]: Finished difference Result 136 states and 210 transitions. [2025-03-04 11:35:55,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-04 11:35:55,744 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 26 states have (on average 3.8076923076923075) internal successors, (99), 26 states have internal predecessors, (99), 15 states have call successors, (188), 1 states have call predecessors, (188), 2 states have return successors, (190), 15 states have call predecessors, (190), 15 states have call successors, (190) Word has length 363 [2025-03-04 11:35:55,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:35:55,745 INFO L225 Difference]: With dead ends: 136 [2025-03-04 11:35:55,745 INFO L226 Difference]: Without dead ends: 135 [2025-03-04 11:35:55,745 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 741 GetRequests, 702 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=262, Invalid=1378, Unknown=0, NotChecked=0, Total=1640 [2025-03-04 11:35:55,746 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 113 mSDsluCounter, 1158 mSDsCounter, 0 mSdLazyCounter, 1163 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 1270 SdHoareTripleChecker+Invalid, 1226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 1163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 11:35:55,747 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 1270 Invalid, 1226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 1163 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 11:35:55,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2025-03-04 11:35:55,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 127. [2025-03-04 11:35:55,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 54 states have (on average 1.1666666666666667) internal successors, (63), 58 states have internal predecessors, (63), 67 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 67 states have call predecessors, (67), 67 states have call successors, (67) [2025-03-04 11:35:55,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 197 transitions. [2025-03-04 11:35:55,760 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 197 transitions. Word has length 363 [2025-03-04 11:35:55,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:35:55,761 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 197 transitions. [2025-03-04 11:35:55,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 26 states have (on average 3.8076923076923075) internal successors, (99), 26 states have internal predecessors, (99), 15 states have call successors, (188), 1 states have call predecessors, (188), 2 states have return successors, (190), 15 states have call predecessors, (190), 15 states have call successors, (190) [2025-03-04 11:35:55,761 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 197 transitions. [2025-03-04 11:35:55,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 365 [2025-03-04 11:35:55,763 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:35:55,763 INFO L218 NwaCegarLoop]: trace histogram [66, 66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:35:55,770 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-03-04 11:35:55,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:35:55,968 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-03-04 11:35:55,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:35:55,968 INFO L85 PathProgramCache]: Analyzing trace with hash -1458793852, now seen corresponding path program 1 times [2025-03-04 11:35:55,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:35:55,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979403859] [2025-03-04 11:35:55,968 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:55,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:35:55,974 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 364 statements into 1 equivalence classes. [2025-03-04 11:35:55,986 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 364 of 364 statements. [2025-03-04 11:35:55,988 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:55,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:56,151 INFO L134 CoverageAnalysis]: Checked inductivity of 8580 backedges. 30 proven. 165 refuted. 0 times theorem prover too weak. 8385 trivial. 0 not checked. [2025-03-04 11:35:56,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:35:56,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979403859] [2025-03-04 11:35:56,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979403859] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:35:56,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1910519856] [2025-03-04 11:35:56,152 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:56,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:35:56,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:35:56,154 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-04 11:35:56,156 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-04 11:35:56,196 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 364 statements into 1 equivalence classes. [2025-03-04 11:35:56,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 364 of 364 statements. [2025-03-04 11:35:56,253 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:56,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:56,255 INFO L256 TraceCheckSpWp]: Trace formula consists of 684 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 11:35:56,259 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:35:56,486 INFO L134 CoverageAnalysis]: Checked inductivity of 8580 backedges. 30 proven. 165 refuted. 0 times theorem prover too weak. 8385 trivial. 0 not checked. [2025-03-04 11:35:56,486 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:35:56,752 INFO L134 CoverageAnalysis]: Checked inductivity of 8580 backedges. 30 proven. 165 refuted. 0 times theorem prover too weak. 8385 trivial. 0 not checked. [2025-03-04 11:35:56,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1910519856] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:35:56,752 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:35:56,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 12 [2025-03-04 11:35:56,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786751542] [2025-03-04 11:35:56,753 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:35:56,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 11:35:56,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:35:56,754 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 11:35:56,754 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-03-04 11:35:56,754 INFO L87 Difference]: Start difference. First operand 127 states and 197 transitions. Second operand has 13 states, 12 states have (on average 8.083333333333334) internal successors, (97), 13 states have internal predecessors, (97), 7 states have call successors, (182), 1 states have call predecessors, (182), 2 states have return successors, (183), 7 states have call predecessors, (183), 7 states have call successors, (183) [2025-03-04 11:35:57,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:35:57,276 INFO L93 Difference]: Finished difference Result 132 states and 204 transitions. [2025-03-04 11:35:57,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 11:35:57,277 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 8.083333333333334) internal successors, (97), 13 states have internal predecessors, (97), 7 states have call successors, (182), 1 states have call predecessors, (182), 2 states have return successors, (183), 7 states have call predecessors, (183), 7 states have call successors, (183) Word has length 364 [2025-03-04 11:35:57,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:35:57,280 INFO L225 Difference]: With dead ends: 132 [2025-03-04 11:35:57,280 INFO L226 Difference]: Without dead ends: 131 [2025-03-04 11:35:57,280 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 742 GetRequests, 723 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=303, Unknown=0, NotChecked=0, Total=380 [2025-03-04 11:35:57,280 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 48 mSDsluCounter, 815 mSDsCounter, 0 mSdLazyCounter, 998 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 925 SdHoareTripleChecker+Invalid, 1056 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 998 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 11:35:57,280 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 925 Invalid, 1056 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 998 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 11:35:57,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2025-03-04 11:35:57,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 126. [2025-03-04 11:35:57,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 54 states have (on average 1.1481481481481481) internal successors, (62), 57 states have internal predecessors, (62), 67 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 67 states have call predecessors, (67), 67 states have call successors, (67) [2025-03-04 11:35:57,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 196 transitions. [2025-03-04 11:35:57,307 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 196 transitions. Word has length 364 [2025-03-04 11:35:57,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:35:57,307 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 196 transitions. [2025-03-04 11:35:57,307 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 8.083333333333334) internal successors, (97), 13 states have internal predecessors, (97), 7 states have call successors, (182), 1 states have call predecessors, (182), 2 states have return successors, (183), 7 states have call predecessors, (183), 7 states have call successors, (183) [2025-03-04 11:35:57,307 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 196 transitions. [2025-03-04 11:35:57,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 368 [2025-03-04 11:35:57,309 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:35:57,309 INFO L218 NwaCegarLoop]: trace histogram [66, 66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:35:57,317 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2025-03-04 11:35:57,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-04 11:35:57,510 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-03-04 11:35:57,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:35:57,510 INFO L85 PathProgramCache]: Analyzing trace with hash 1846416275, now seen corresponding path program 1 times [2025-03-04 11:35:57,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:35:57,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876607538] [2025-03-04 11:35:57,510 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:57,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:35:57,517 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 367 statements into 1 equivalence classes. [2025-03-04 11:35:57,528 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 367 of 367 statements. [2025-03-04 11:35:57,528 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:57,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:57,701 INFO L134 CoverageAnalysis]: Checked inductivity of 8580 backedges. 54 proven. 330 refuted. 0 times theorem prover too weak. 8196 trivial. 0 not checked. [2025-03-04 11:35:57,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:35:57,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876607538] [2025-03-04 11:35:57,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876607538] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:35:57,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [418302751] [2025-03-04 11:35:57,702 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:57,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:35:57,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:35:57,704 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-04 11:35:57,705 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-04 11:35:57,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 367 statements into 1 equivalence classes. [2025-03-04 11:35:57,800 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 367 of 367 statements. [2025-03-04 11:35:57,801 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:57,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:57,808 INFO L256 TraceCheckSpWp]: Trace formula consists of 689 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-04 11:35:57,811 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:35:58,097 INFO L134 CoverageAnalysis]: Checked inductivity of 8580 backedges. 291 proven. 453 refuted. 0 times theorem prover too weak. 7836 trivial. 0 not checked. [2025-03-04 11:35:58,097 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:35:58,498 INFO L134 CoverageAnalysis]: Checked inductivity of 8580 backedges. 291 proven. 453 refuted. 0 times theorem prover too weak. 7836 trivial. 0 not checked. [2025-03-04 11:35:58,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [418302751] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:35:58,499 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:35:58,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 10, 11] total 22 [2025-03-04 11:35:58,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451201121] [2025-03-04 11:35:58,499 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:35:58,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-04 11:35:58,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:35:58,500 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-04 11:35:58,500 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=434, Unknown=0, NotChecked=0, Total=506 [2025-03-04 11:35:58,501 INFO L87 Difference]: Start difference. First operand 126 states and 196 transitions. Second operand has 23 states, 21 states have (on average 5.190476190476191) internal successors, (109), 23 states have internal predecessors, (109), 11 states have call successors, (184), 1 states have call predecessors, (184), 2 states have return successors, (186), 11 states have call predecessors, (186), 11 states have call successors, (186) [2025-03-04 11:35:59,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:35:59,110 INFO L93 Difference]: Finished difference Result 130 states and 201 transitions. [2025-03-04 11:35:59,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 11:35:59,111 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 21 states have (on average 5.190476190476191) internal successors, (109), 23 states have internal predecessors, (109), 11 states have call successors, (184), 1 states have call predecessors, (184), 2 states have return successors, (186), 11 states have call predecessors, (186), 11 states have call successors, (186) Word has length 367 [2025-03-04 11:35:59,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:35:59,112 INFO L225 Difference]: With dead ends: 130 [2025-03-04 11:35:59,112 INFO L226 Difference]: Without dead ends: 129 [2025-03-04 11:35:59,113 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 747 GetRequests, 719 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=153, Invalid=717, Unknown=0, NotChecked=0, Total=870 [2025-03-04 11:35:59,113 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 120 mSDsluCounter, 1394 mSDsCounter, 0 mSdLazyCounter, 1191 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 1506 SdHoareTripleChecker+Invalid, 1305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 1191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 11:35:59,113 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 1506 Invalid, 1305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 1191 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 11:35:59,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2025-03-04 11:35:59,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 125. [2025-03-04 11:35:59,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 54 states have (on average 1.1296296296296295) internal successors, (61), 56 states have internal predecessors, (61), 67 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 67 states have call predecessors, (67), 67 states have call successors, (67) [2025-03-04 11:35:59,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 195 transitions. [2025-03-04 11:35:59,123 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 195 transitions. Word has length 367 [2025-03-04 11:35:59,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:35:59,123 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 195 transitions. [2025-03-04 11:35:59,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 21 states have (on average 5.190476190476191) internal successors, (109), 23 states have internal predecessors, (109), 11 states have call successors, (184), 1 states have call predecessors, (184), 2 states have return successors, (186), 11 states have call predecessors, (186), 11 states have call successors, (186) [2025-03-04 11:35:59,124 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 195 transitions. [2025-03-04 11:35:59,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2025-03-04 11:35:59,125 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:35:59,125 INFO L218 NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:35:59,132 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-03-04 11:35:59,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-04 11:35:59,325 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-03-04 11:35:59,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:35:59,326 INFO L85 PathProgramCache]: Analyzing trace with hash -1339528371, now seen corresponding path program 1 times [2025-03-04 11:35:59,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:35:59,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749344083] [2025-03-04 11:35:59,326 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:59,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:35:59,332 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 372 statements into 1 equivalence classes. [2025-03-04 11:35:59,346 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 372 of 372 statements. [2025-03-04 11:35:59,346 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:59,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:59,459 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 30 proven. 168 refuted. 0 times theorem prover too weak. 8646 trivial. 0 not checked. [2025-03-04 11:35:59,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:35:59,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749344083] [2025-03-04 11:35:59,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749344083] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:35:59,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2129891459] [2025-03-04 11:35:59,459 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:59,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:35:59,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:35:59,461 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-04 11:35:59,463 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-04 11:35:59,500 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 372 statements into 1 equivalence classes. [2025-03-04 11:35:59,553 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 372 of 372 statements. [2025-03-04 11:35:59,554 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:59,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:59,557 INFO L256 TraceCheckSpWp]: Trace formula consists of 701 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-03-04 11:35:59,561 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:36:00,020 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 537 proven. 561 refuted. 0 times theorem prover too weak. 7746 trivial. 0 not checked. [2025-03-04 11:36:00,020 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:36:00,449 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 537 proven. 561 refuted. 0 times theorem prover too weak. 7746 trivial. 0 not checked. [2025-03-04 11:36:00,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2129891459] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:36:00,449 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:36:00,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 13, 15] total 28 [2025-03-04 11:36:00,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707119166] [2025-03-04 11:36:00,449 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:36:00,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-03-04 11:36:00,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:36:00,450 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-03-04 11:36:00,454 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=712, Unknown=0, NotChecked=0, Total=812 [2025-03-04 11:36:00,455 INFO L87 Difference]: Start difference. First operand 125 states and 195 transitions. Second operand has 29 states, 26 states have (on average 4.1923076923076925) internal successors, (109), 26 states have internal predecessors, (109), 15 states have call successors, (187), 1 states have call predecessors, (187), 2 states have return successors, (189), 15 states have call predecessors, (189), 15 states have call successors, (189) [2025-03-04 11:36:01,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:36:01,126 INFO L93 Difference]: Finished difference Result 133 states and 207 transitions. [2025-03-04 11:36:01,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-04 11:36:01,127 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 26 states have (on average 4.1923076923076925) internal successors, (109), 26 states have internal predecessors, (109), 15 states have call successors, (187), 1 states have call predecessors, (187), 2 states have return successors, (189), 15 states have call predecessors, (189), 15 states have call successors, (189) Word has length 372 [2025-03-04 11:36:01,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:36:01,128 INFO L225 Difference]: With dead ends: 133 [2025-03-04 11:36:01,128 INFO L226 Difference]: Without dead ends: 132 [2025-03-04 11:36:01,129 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 759 GetRequests, 720 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=262, Invalid=1378, Unknown=0, NotChecked=0, Total=1640 [2025-03-04 11:36:01,129 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 97 mSDsluCounter, 1174 mSDsCounter, 0 mSdLazyCounter, 1276 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 1283 SdHoareTripleChecker+Invalid, 1338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 1276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 11:36:01,129 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 1283 Invalid, 1338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 1276 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 11:36:01,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2025-03-04 11:36:01,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 124. [2025-03-04 11:36:01,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 54 states have (on average 1.1111111111111112) internal successors, (60), 55 states have internal predecessors, (60), 67 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 67 states have call predecessors, (67), 67 states have call successors, (67) [2025-03-04 11:36:01,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 194 transitions. [2025-03-04 11:36:01,139 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 194 transitions. Word has length 372 [2025-03-04 11:36:01,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:36:01,140 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 194 transitions. [2025-03-04 11:36:01,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 26 states have (on average 4.1923076923076925) internal successors, (109), 26 states have internal predecessors, (109), 15 states have call successors, (187), 1 states have call predecessors, (187), 2 states have return successors, (189), 15 states have call predecessors, (189), 15 states have call successors, (189) [2025-03-04 11:36:01,140 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 194 transitions. [2025-03-04 11:36:01,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 374 [2025-03-04 11:36:01,142 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:36:01,142 INFO L218 NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:36:01,150 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-04 11:36:01,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-04 11:36:01,343 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-03-04 11:36:01,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:36:01,343 INFO L85 PathProgramCache]: Analyzing trace with hash 1424293441, now seen corresponding path program 1 times [2025-03-04 11:36:01,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:36:01,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903749615] [2025-03-04 11:36:01,344 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:36:01,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:36:01,350 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 373 statements into 1 equivalence classes. [2025-03-04 11:36:01,361 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 373 of 373 statements. [2025-03-04 11:36:01,361 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:36:01,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:36:01,557 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 36 proven. 162 refuted. 0 times theorem prover too weak. 8646 trivial. 0 not checked. [2025-03-04 11:36:01,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:36:01,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903749615] [2025-03-04 11:36:01,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903749615] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:36:01,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1675401325] [2025-03-04 11:36:01,558 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:36:01,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:36:01,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:36:01,559 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-04 11:36:01,560 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-04 11:36:01,600 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 373 statements into 1 equivalence classes. [2025-03-04 11:36:01,649 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 373 of 373 statements. [2025-03-04 11:36:01,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:36:01,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:36:01,652 INFO L256 TraceCheckSpWp]: Trace formula consists of 702 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 11:36:01,655 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:36:01,844 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 36 proven. 162 refuted. 0 times theorem prover too weak. 8646 trivial. 0 not checked. [2025-03-04 11:36:01,845 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:36:02,046 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 36 proven. 162 refuted. 0 times theorem prover too weak. 8646 trivial. 0 not checked. [2025-03-04 11:36:02,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1675401325] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:36:02,046 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:36:02,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 5, 5] total 14 [2025-03-04 11:36:02,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632599238] [2025-03-04 11:36:02,046 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:36:02,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-04 11:36:02,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:36:02,047 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-04 11:36:02,047 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2025-03-04 11:36:02,048 INFO L87 Difference]: Start difference. First operand 124 states and 194 transitions. Second operand has 15 states, 14 states have (on average 7.714285714285714) internal successors, (108), 15 states have internal predecessors, (108), 8 states have call successors, (183), 1 states have call predecessors, (183), 2 states have return successors, (184), 8 states have call predecessors, (184), 8 states have call successors, (184) [2025-03-04 11:36:02,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:36:02,495 INFO L93 Difference]: Finished difference Result 136 states and 210 transitions. [2025-03-04 11:36:02,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-04 11:36:02,496 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 7.714285714285714) internal successors, (108), 15 states have internal predecessors, (108), 8 states have call successors, (183), 1 states have call predecessors, (183), 2 states have return successors, (184), 8 states have call predecessors, (184), 8 states have call successors, (184) Word has length 373 [2025-03-04 11:36:02,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:36:02,497 INFO L225 Difference]: With dead ends: 136 [2025-03-04 11:36:02,497 INFO L226 Difference]: Without dead ends: 135 [2025-03-04 11:36:02,497 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 765 GetRequests, 741 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=498, Unknown=0, NotChecked=0, Total=600 [2025-03-04 11:36:02,498 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 83 mSDsluCounter, 820 mSDsCounter, 0 mSdLazyCounter, 932 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 927 SdHoareTripleChecker+Invalid, 989 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 932 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 11:36:02,498 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 927 Invalid, 989 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 932 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 11:36:02,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2025-03-04 11:36:02,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 123. [2025-03-04 11:36:02,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 54 states have (on average 1.0925925925925926) internal successors, (59), 54 states have internal predecessors, (59), 67 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 67 states have call predecessors, (67), 67 states have call successors, (67) [2025-03-04 11:36:02,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 193 transitions. [2025-03-04 11:36:02,524 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 193 transitions. Word has length 373 [2025-03-04 11:36:02,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:36:02,525 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 193 transitions. [2025-03-04 11:36:02,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 7.714285714285714) internal successors, (108), 15 states have internal predecessors, (108), 8 states have call successors, (183), 1 states have call predecessors, (183), 2 states have return successors, (184), 8 states have call predecessors, (184), 8 states have call successors, (184) [2025-03-04 11:36:02,525 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 193 transitions. [2025-03-04 11:36:02,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 377 [2025-03-04 11:36:02,527 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:36:02,527 INFO L218 NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:36:02,534 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2025-03-04 11:36:02,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:36:02,728 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-03-04 11:36:02,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:36:02,729 INFO L85 PathProgramCache]: Analyzing trace with hash 1143964714, now seen corresponding path program 1 times [2025-03-04 11:36:02,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:36:02,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606508624] [2025-03-04 11:36:02,729 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:36:02,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:36:02,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 376 statements into 1 equivalence classes. [2025-03-04 11:36:02,746 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 376 of 376 statements. [2025-03-04 11:36:02,746 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:36:02,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:36:02,860 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 30 proven. 168 refuted. 0 times theorem prover too weak. 8646 trivial. 0 not checked. [2025-03-04 11:36:02,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:36:02,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606508624] [2025-03-04 11:36:02,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606508624] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:36:02,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1374946715] [2025-03-04 11:36:02,860 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:36:02,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:36:02,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:36:02,862 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-04 11:36:02,863 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-04 11:36:02,899 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 376 statements into 1 equivalence classes. [2025-03-04 11:36:02,945 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 376 of 376 statements. [2025-03-04 11:36:02,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:36:02,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:36:02,948 INFO L256 TraceCheckSpWp]: Trace formula consists of 707 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-03-04 11:36:02,952 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:36:03,371 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 537 proven. 561 refuted. 0 times theorem prover too weak. 7746 trivial. 0 not checked. [2025-03-04 11:36:03,371 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:36:03,799 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 537 proven. 561 refuted. 0 times theorem prover too weak. 7746 trivial. 0 not checked. [2025-03-04 11:36:03,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1374946715] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:36:03,799 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:36:03,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 14, 16] total 29 [2025-03-04 11:36:03,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581201019] [2025-03-04 11:36:03,800 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:36:03,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-04 11:36:03,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:36:03,801 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-04 11:36:03,801 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=772, Unknown=0, NotChecked=0, Total=870 [2025-03-04 11:36:03,801 INFO L87 Difference]: Start difference. First operand 123 states and 193 transitions. Second operand has 30 states, 27 states have (on average 4.296296296296297) internal successors, (116), 29 states have internal predecessors, (116), 15 states have call successors, (187), 1 states have call predecessors, (187), 2 states have return successors, (189), 14 states have call predecessors, (189), 15 states have call successors, (189) [2025-03-04 11:36:04,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:36:04,552 INFO L93 Difference]: Finished difference Result 131 states and 203 transitions. [2025-03-04 11:36:04,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-04 11:36:04,552 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 27 states have (on average 4.296296296296297) internal successors, (116), 29 states have internal predecessors, (116), 15 states have call successors, (187), 1 states have call predecessors, (187), 2 states have return successors, (189), 14 states have call predecessors, (189), 15 states have call successors, (189) Word has length 376 [2025-03-04 11:36:04,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:36:04,553 INFO L225 Difference]: With dead ends: 131 [2025-03-04 11:36:04,553 INFO L226 Difference]: Without dead ends: 0 [2025-03-04 11:36:04,554 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 768 GetRequests, 727 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=249, Invalid=1473, Unknown=0, NotChecked=0, Total=1722 [2025-03-04 11:36:04,555 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 158 mSDsluCounter, 1368 mSDsCounter, 0 mSdLazyCounter, 1644 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 1474 SdHoareTripleChecker+Invalid, 1766 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 1644 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 11:36:04,555 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 1474 Invalid, 1766 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 1644 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 11:36:04,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-04 11:36:04,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-04 11:36:04,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:36:04,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-04 11:36:04,555 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 376 [2025-03-04 11:36:04,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:36:04,555 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 11:36:04,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 27 states have (on average 4.296296296296297) internal successors, (116), 29 states have internal predecessors, (116), 15 states have call successors, (187), 1 states have call predecessors, (187), 2 states have return successors, (189), 14 states have call predecessors, (189), 15 states have call successors, (189) [2025-03-04 11:36:04,556 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-04 11:36:04,556 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-04 11:36:04,558 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 24 remaining) [2025-03-04 11:36:04,558 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 24 remaining) [2025-03-04 11:36:04,558 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 24 remaining) [2025-03-04 11:36:04,558 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 24 remaining) [2025-03-04 11:36:04,558 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 24 remaining) [2025-03-04 11:36:04,558 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 24 remaining) [2025-03-04 11:36:04,558 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 24 remaining) [2025-03-04 11:36:04,558 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 24 remaining) [2025-03-04 11:36:04,558 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 24 remaining) [2025-03-04 11:36:04,558 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 24 remaining) [2025-03-04 11:36:04,558 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 24 remaining) [2025-03-04 11:36:04,558 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 24 remaining) [2025-03-04 11:36:04,558 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 24 remaining) [2025-03-04 11:36:04,558 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 24 remaining) [2025-03-04 11:36:04,558 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 24 remaining) [2025-03-04 11:36:04,558 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 24 remaining) [2025-03-04 11:36:04,558 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 24 remaining) [2025-03-04 11:36:04,558 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 24 remaining) [2025-03-04 11:36:04,558 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 24 remaining) [2025-03-04 11:36:04,558 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 24 remaining) [2025-03-04 11:36:04,559 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 24 remaining) [2025-03-04 11:36:04,559 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 24 remaining) [2025-03-04 11:36:04,559 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 24 remaining) [2025-03-04 11:36:04,559 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 24 remaining) [2025-03-04 11:36:04,566 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2025-03-04 11:36:04,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:36:04,762 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:36:04,763 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-04 11:36:06,167 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 11:36:06,172 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 11:36:06 BoogieIcfgContainer [2025-03-04 11:36:06,172 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 11:36:06,172 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 11:36:06,172 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 11:36:06,172 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 11:36:06,173 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 11:35:34" (3/4) ... [2025-03-04 11:36:06,174 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-04 11:36:06,180 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure assume [2025-03-04 11:36:06,188 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-03-04 11:36:06,188 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-04 11:36:06,189 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-04 11:36:06,189 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-04 11:36:06,264 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 11:36:06,264 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-04 11:36:06,264 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 11:36:06,265 INFO L158 Benchmark]: Toolchain (without parser) took 32727.92ms. Allocated memory was 142.6MB in the beginning and 503.3MB in the end (delta: 360.7MB). Free memory was 106.4MB in the beginning and 416.5MB in the end (delta: -310.1MB). Peak memory consumption was 46.2MB. Max. memory is 16.1GB. [2025-03-04 11:36:06,265 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 201.3MB. Free memory is still 126.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 11:36:06,265 INFO L158 Benchmark]: CACSL2BoogieTranslator took 177.35ms. Allocated memory is still 142.6MB. Free memory was 106.4MB in the beginning and 94.2MB in the end (delta: 12.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 11:36:06,266 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.56ms. Allocated memory is still 142.6MB. Free memory was 93.6MB in the beginning and 91.4MB in the end (delta: 2.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 11:36:06,268 INFO L158 Benchmark]: Boogie Preprocessor took 24.01ms. Allocated memory is still 142.6MB. Free memory was 91.4MB in the beginning and 90.3MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 11:36:06,268 INFO L158 Benchmark]: IcfgBuilder took 385.92ms. Allocated memory is still 142.6MB. Free memory was 90.3MB in the beginning and 68.5MB in the end (delta: 21.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 11:36:06,268 INFO L158 Benchmark]: TraceAbstraction took 32010.82ms. Allocated memory was 142.6MB in the beginning and 503.3MB in the end (delta: 360.7MB). Free memory was 67.4MB in the beginning and 424.9MB in the end (delta: -357.6MB). Peak memory consumption was 258.3MB. Max. memory is 16.1GB. [2025-03-04 11:36:06,268 INFO L158 Benchmark]: Witness Printer took 91.79ms. Allocated memory is still 503.3MB. Free memory was 424.9MB in the beginning and 416.5MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 11:36:06,269 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.17ms. Allocated memory is still 201.3MB. Free memory is still 126.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 177.35ms. Allocated memory is still 142.6MB. Free memory was 106.4MB in the beginning and 94.2MB in the end (delta: 12.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.56ms. Allocated memory is still 142.6MB. Free memory was 93.6MB in the beginning and 91.4MB in the end (delta: 2.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 24.01ms. Allocated memory is still 142.6MB. Free memory was 91.4MB in the beginning and 90.3MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 385.92ms. Allocated memory is still 142.6MB. Free memory was 90.3MB in the beginning and 68.5MB in the end (delta: 21.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 32010.82ms. Allocated memory was 142.6MB in the beginning and 503.3MB in the end (delta: 360.7MB). Free memory was 67.4MB in the beginning and 424.9MB in the end (delta: -357.6MB). Peak memory consumption was 258.3MB. Max. memory is 16.1GB. * Witness Printer took 91.79ms. Allocated memory is still 503.3MB. Free memory was 424.9MB in the beginning and 416.5MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 133]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 133]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 132]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 132]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 130]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 130]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 129]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 129]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 127]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 127]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 126]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 126]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 124]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 124]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 123]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 123]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 121]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 121]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 120]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 120]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 118]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 118]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 117]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 117]: 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 2 procedures, 153 locations, 24 error locations. Started 1 CEGAR loops. OverallTime: 30.6s, OverallIterations: 20, TraceHistogramMax: 67, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 8.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 990 SdHoareTripleChecker+Valid, 6.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 990 mSDsluCounter, 18055 SdHoareTripleChecker+Invalid, 5.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 15435 mSDsCounter, 900 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 14507 IncrementalHoareTripleChecker+Invalid, 15407 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 900 mSolverCounterUnsat, 2620 mSDtfsCounter, 14507 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 13141 GetRequests, 12778 SyntacticMatches, 11 SemanticMatches, 352 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1350 ImplicationChecksByTransitivity, 2.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=153occurred in iteration=0, InterpolantAutomatonStates: 201, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 20 MinimizatonAttempts, 53 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 15.0s InterpolantComputationTime, 13626 NumberOfCodeBlocks, 13626 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 19890 ConstructedInterpolants, 0 QuantifiedInterpolants, 46818 SizeOfPredicates, 63 NumberOfNonLiveVariables, 12461 ConjunctsInSsa, 308 ConjunctsInUnsatCore, 57 InterpolantComputations, 2 PerfectInterpolantSequences, 449896/465348 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 24 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-04 11:36:06,284 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE