./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/nla-digbench-scaling/mannadiv_unwindbound5.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/mannadiv_unwindbound5.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash aad83614f5b3454ec30b386336992d9fee88422d967149e7e88efe6256830f00 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 02:27:07,825 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 02:27:07,878 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-09 02:27:07,886 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 02:27:07,887 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 02:27:07,908 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 02:27:07,909 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 02:27:07,909 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 02:27:07,909 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 02:27:07,910 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 02:27:07,910 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 02:27:07,910 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 02:27:07,911 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 02:27:07,911 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 02:27:07,911 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 02:27:07,911 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 02:27:07,911 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-09 02:27:07,911 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 02:27:07,912 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 02:27:07,912 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 02:27:07,912 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 02:27:07,912 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-09 02:27:07,912 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 02:27:07,912 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-09 02:27:07,912 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-09 02:27:07,912 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 02:27:07,912 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 02:27:07,912 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-09 02:27:07,912 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 02:27:07,912 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 02:27:07,912 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 02:27:07,913 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 02:27:07,913 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 02:27:07,913 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 02:27:07,913 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 02:27:07,913 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 02:27:07,913 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 02:27:07,913 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-09 02:27:07,914 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-09 02:27:07,914 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 02:27:07,914 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 02:27:07,914 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 02:27:07,914 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 02:27:07,914 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 02:27:07,914 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 02:27:07,914 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> aad83614f5b3454ec30b386336992d9fee88422d967149e7e88efe6256830f00 [2025-03-09 02:27:08,126 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 02:27:08,135 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 02:27:08,136 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 02:27:08,137 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 02:27:08,138 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 02:27:08,139 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/mannadiv_unwindbound5.c [2025-03-09 02:27:09,275 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/095071279/9db59efa0223442da5ac7488cd65bef3/FLAG91daa07c8 [2025-03-09 02:27:09,500 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 02:27:09,501 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/mannadiv_unwindbound5.c [2025-03-09 02:27:09,515 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/095071279/9db59efa0223442da5ac7488cd65bef3/FLAG91daa07c8 [2025-03-09 02:27:09,552 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/095071279/9db59efa0223442da5ac7488cd65bef3 [2025-03-09 02:27:09,556 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 02:27:09,564 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 02:27:09,565 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 02:27:09,565 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 02:27:09,573 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 02:27:09,573 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 02:27:09" (1/1) ... [2025-03-09 02:27:09,575 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ed0eb3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:27:09, skipping insertion in model container [2025-03-09 02:27:09,578 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 02:27:09" (1/1) ... [2025-03-09 02:27:09,590 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 02:27:09,700 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 02:27:09,710 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 02:27:09,724 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 02:27:09,735 INFO L204 MainTranslator]: Completed translation [2025-03-09 02:27:09,736 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:27:09 WrapperNode [2025-03-09 02:27:09,736 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 02:27:09,737 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 02:27:09,738 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 02:27:09,738 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 02:27:09,742 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:27:09" (1/1) ... [2025-03-09 02:27:09,747 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:27:09" (1/1) ... [2025-03-09 02:27:09,759 INFO L138 Inliner]: procedures = 14, calls = 12, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 75 [2025-03-09 02:27:09,760 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 02:27:09,761 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 02:27:09,761 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 02:27:09,761 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 02:27:09,768 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:27:09" (1/1) ... [2025-03-09 02:27:09,768 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:27:09" (1/1) ... [2025-03-09 02:27:09,773 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:27:09" (1/1) ... [2025-03-09 02:27:09,784 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-09 02:27:09,784 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:27:09" (1/1) ... [2025-03-09 02:27:09,784 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:27:09" (1/1) ... [2025-03-09 02:27:09,787 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:27:09" (1/1) ... [2025-03-09 02:27:09,787 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:27:09" (1/1) ... [2025-03-09 02:27:09,789 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:27:09" (1/1) ... [2025-03-09 02:27:09,789 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:27:09" (1/1) ... [2025-03-09 02:27:09,790 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 02:27:09,791 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 02:27:09,791 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 02:27:09,791 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 02:27:09,795 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:27:09" (1/1) ... [2025-03-09 02:27:09,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 02:27:09,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:27:09,821 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-09 02:27:09,825 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-09 02:27:09,844 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 02:27:09,844 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-09 02:27:09,844 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-09 02:27:09,844 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 02:27:09,844 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 02:27:09,844 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 02:27:09,844 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-09 02:27:09,844 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-09 02:27:09,885 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 02:27:09,887 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 02:27:10,108 INFO L? ?]: Removed 47 outVars from TransFormulas that were not future-live. [2025-03-09 02:27:10,109 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 02:27:10,116 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 02:27:10,116 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 02:27:10,116 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 02:27:10 BoogieIcfgContainer [2025-03-09 02:27:10,116 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 02:27:10,120 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 02:27:10,120 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 02:27:10,123 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 02:27:10,124 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 02:27:09" (1/3) ... [2025-03-09 02:27:10,125 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@257a5264 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 02:27:10, skipping insertion in model container [2025-03-09 02:27:10,125 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:27:09" (2/3) ... [2025-03-09 02:27:10,126 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@257a5264 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 02:27:10, skipping insertion in model container [2025-03-09 02:27:10,126 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 02:27:10" (3/3) ... [2025-03-09 02:27:10,127 INFO L128 eAbstractionObserver]: Analyzing ICFG mannadiv_unwindbound5.c [2025-03-09 02:27:10,139 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 02:27:10,140 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG mannadiv_unwindbound5.c that has 3 procedures, 69 locations, 1 initial locations, 1 loop locations, and 22 error locations. [2025-03-09 02:27:10,177 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 02:27:10,186 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;@6de0e77, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 02:27:10,187 INFO L334 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2025-03-09 02:27:10,190 INFO L276 IsEmpty]: Start isEmpty. Operand has 69 states, 40 states have (on average 1.7) internal successors, (68), 62 states have internal predecessors, (68), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-09 02:27:10,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-09 02:27:10,195 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:27:10,195 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:27:10,196 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-03-09 02:27:10,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:27:10,204 INFO L85 PathProgramCache]: Analyzing trace with hash 1896484220, now seen corresponding path program 1 times [2025-03-09 02:27:10,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:27:10,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987835970] [2025-03-09 02:27:10,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:27:10,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:27:10,256 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-09 02:27:10,278 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-09 02:27:10,278 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:27:10,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:27:10,418 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 02:27:10,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:27:10,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987835970] [2025-03-09 02:27:10,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987835970] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:27:10,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:27:10,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 02:27:10,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133825031] [2025-03-09 02:27:10,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:27:10,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 02:27:10,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:27:10,434 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 02:27:10,435 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 02:27:10,436 INFO L87 Difference]: Start difference. First operand has 69 states, 40 states have (on average 1.7) internal successors, (68), 62 states have internal predecessors, (68), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 02:27:10,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:27:10,510 INFO L93 Difference]: Finished difference Result 138 states and 159 transitions. [2025-03-09 02:27:10,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 02:27:10,512 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 15 [2025-03-09 02:27:10,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:27:10,516 INFO L225 Difference]: With dead ends: 138 [2025-03-09 02:27:10,517 INFO L226 Difference]: Without dead ends: 66 [2025-03-09 02:27:10,521 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-09 02:27:10,523 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 9 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 02:27:10,524 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 190 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:27:10,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2025-03-09 02:27:10,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2025-03-09 02:27:10,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 39 states have (on average 1.6153846153846154) internal successors, (63), 60 states have internal predecessors, (63), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 02:27:10,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 69 transitions. [2025-03-09 02:27:10,553 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 69 transitions. Word has length 15 [2025-03-09 02:27:10,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:27:10,554 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 69 transitions. [2025-03-09 02:27:10,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 02:27:10,554 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 69 transitions. [2025-03-09 02:27:10,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-09 02:27:10,554 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:27:10,555 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:27:10,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 02:27:10,555 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-03-09 02:27:10,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:27:10,555 INFO L85 PathProgramCache]: Analyzing trace with hash -2133360073, now seen corresponding path program 1 times [2025-03-09 02:27:10,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:27:10,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486391050] [2025-03-09 02:27:10,556 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:27:10,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:27:10,561 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-09 02:27:10,571 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 02:27:10,571 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:27:10,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 02:27:10,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [281236603] [2025-03-09 02:27:10,573 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:27:10,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:27:10,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:27:10,575 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-09 02:27:10,576 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-09 02:27:10,605 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-09 02:27:10,614 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 02:27:10,615 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:27:10,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:27:10,616 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 02:27:10,619 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:27:10,637 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 02:27:10,637 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 02:27:10,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:27:10,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486391050] [2025-03-09 02:27:10,638 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-09 02:27:10,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [281236603] [2025-03-09 02:27:10,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [281236603] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:27:10,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:27:10,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 02:27:10,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479003111] [2025-03-09 02:27:10,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:27:10,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 02:27:10,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:27:10,639 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 02:27:10,640 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 02:27:10,640 INFO L87 Difference]: Start difference. First operand 66 states and 69 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 02:27:10,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:27:10,693 INFO L93 Difference]: Finished difference Result 105 states and 117 transitions. [2025-03-09 02:27:10,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 02:27:10,694 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2025-03-09 02:27:10,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:27:10,701 INFO L225 Difference]: With dead ends: 105 [2025-03-09 02:27:10,701 INFO L226 Difference]: Without dead ends: 99 [2025-03-09 02:27:10,701 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 16 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-09 02:27:10,702 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 29 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 02:27:10,702 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 91 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:27:10,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-03-09 02:27:10,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 89. [2025-03-09 02:27:10,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 61 states have (on average 1.639344262295082) internal successors, (100), 82 states have internal predecessors, (100), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-09 02:27:10,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 108 transitions. [2025-03-09 02:27:10,708 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 108 transitions. Word has length 18 [2025-03-09 02:27:10,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:27:10,708 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 108 transitions. [2025-03-09 02:27:10,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 02:27:10,708 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 108 transitions. [2025-03-09 02:27:10,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-09 02:27:10,709 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:27:10,709 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:27:10,715 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-09 02:27:10,912 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:27:10,912 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-03-09 02:27:10,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:27:10,913 INFO L85 PathProgramCache]: Analyzing trace with hash -1459629483, now seen corresponding path program 1 times [2025-03-09 02:27:10,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:27:10,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179140571] [2025-03-09 02:27:10,913 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:27:10,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:27:10,920 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-09 02:27:10,924 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-09 02:27:10,924 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:27:10,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:27:10,984 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 02:27:10,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:27:10,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179140571] [2025-03-09 02:27:10,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179140571] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:27:10,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:27:10,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 02:27:10,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193747357] [2025-03-09 02:27:10,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:27:10,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 02:27:10,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:27:10,985 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 02:27:10,985 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 02:27:10,985 INFO L87 Difference]: Start difference. First operand 89 states and 108 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 02:27:11,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:27:11,083 INFO L93 Difference]: Finished difference Result 139 states and 176 transitions. [2025-03-09 02:27:11,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 02:27:11,086 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 20 [2025-03-09 02:27:11,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:27:11,088 INFO L225 Difference]: With dead ends: 139 [2025-03-09 02:27:11,088 INFO L226 Difference]: Without dead ends: 132 [2025-03-09 02:27:11,088 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 02:27:11,089 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 42 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:27:11,089 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 92 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:27:11,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2025-03-09 02:27:11,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 125. [2025-03-09 02:27:11,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 95 states have (on average 1.5894736842105264) internal successors, (151), 116 states have internal predecessors, (151), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-09 02:27:11,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 163 transitions. [2025-03-09 02:27:11,121 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 163 transitions. Word has length 20 [2025-03-09 02:27:11,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:27:11,121 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 163 transitions. [2025-03-09 02:27:11,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 02:27:11,121 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 163 transitions. [2025-03-09 02:27:11,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-09 02:27:11,122 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:27:11,122 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:27:11,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-09 02:27:11,122 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-03-09 02:27:11,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:27:11,122 INFO L85 PathProgramCache]: Analyzing trace with hash 1996126294, now seen corresponding path program 1 times [2025-03-09 02:27:11,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:27:11,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963847850] [2025-03-09 02:27:11,123 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:27:11,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:27:11,130 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-09 02:27:11,138 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-09 02:27:11,138 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:27:11,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:27:11,221 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 02:27:11,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:27:11,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963847850] [2025-03-09 02:27:11,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963847850] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:27:11,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:27:11,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 02:27:11,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474181494] [2025-03-09 02:27:11,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:27:11,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 02:27:11,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:27:11,222 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 02:27:11,222 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 02:27:11,222 INFO L87 Difference]: Start difference. First operand 125 states and 163 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 02:27:11,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:27:11,299 INFO L93 Difference]: Finished difference Result 136 states and 166 transitions. [2025-03-09 02:27:11,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 02:27:11,299 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2025-03-09 02:27:11,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:27:11,300 INFO L225 Difference]: With dead ends: 136 [2025-03-09 02:27:11,300 INFO L226 Difference]: Without dead ends: 127 [2025-03-09 02:27:11,300 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 02:27:11,301 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 42 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:27:11,301 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 96 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:27:11,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2025-03-09 02:27:11,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 121. [2025-03-09 02:27:11,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 91 states have (on average 1.5604395604395604) internal successors, (142), 112 states have internal predecessors, (142), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-09 02:27:11,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 154 transitions. [2025-03-09 02:27:11,315 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 154 transitions. Word has length 21 [2025-03-09 02:27:11,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:27:11,315 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 154 transitions. [2025-03-09 02:27:11,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 02:27:11,315 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 154 transitions. [2025-03-09 02:27:11,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-09 02:27:11,316 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:27:11,316 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:27:11,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-09 02:27:11,317 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-03-09 02:27:11,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:27:11,318 INFO L85 PathProgramCache]: Analyzing trace with hash 1750372979, now seen corresponding path program 1 times [2025-03-09 02:27:11,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:27:11,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169976112] [2025-03-09 02:27:11,318 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:27:11,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:27:11,324 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-09 02:27:11,330 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-09 02:27:11,330 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:27:11,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:27:11,471 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 02:27:11,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:27:11,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169976112] [2025-03-09 02:27:11,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169976112] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:27:11,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [928226217] [2025-03-09 02:27:11,471 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:27:11,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:27:11,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:27:11,475 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-09 02:27:11,477 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-09 02:27:11,501 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-09 02:27:11,513 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-09 02:27:11,514 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:27:11,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:27:11,514 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-09 02:27:11,515 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:27:11,644 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 02:27:11,645 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 02:27:11,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [928226217] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:27:11,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 02:27:11,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2025-03-09 02:27:11,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654566563] [2025-03-09 02:27:11,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:27:11,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 02:27:11,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:27:11,646 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 02:27:11,646 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-09 02:27:11,647 INFO L87 Difference]: Start difference. First operand 121 states and 154 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 02:27:11,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:27:11,740 INFO L93 Difference]: Finished difference Result 124 states and 158 transitions. [2025-03-09 02:27:11,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 02:27:11,740 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2025-03-09 02:27:11,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:27:11,741 INFO L225 Difference]: With dead ends: 124 [2025-03-09 02:27:11,741 INFO L226 Difference]: Without dead ends: 123 [2025-03-09 02:27:11,742 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-03-09 02:27:11,742 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 81 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:27:11,742 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 76 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:27:11,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2025-03-09 02:27:11,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 121. [2025-03-09 02:27:11,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 91 states have (on average 1.5494505494505495) internal successors, (141), 112 states have internal predecessors, (141), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-09 02:27:11,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 153 transitions. [2025-03-09 02:27:11,758 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 153 transitions. Word has length 22 [2025-03-09 02:27:11,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:27:11,758 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 153 transitions. [2025-03-09 02:27:11,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 02:27:11,758 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 153 transitions. [2025-03-09 02:27:11,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-09 02:27:11,759 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:27:11,759 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:27:11,767 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-09 02:27:11,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:27:11,959 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-03-09 02:27:11,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:27:11,960 INFO L85 PathProgramCache]: Analyzing trace with hash -1573012492, now seen corresponding path program 1 times [2025-03-09 02:27:11,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:27:11,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235198179] [2025-03-09 02:27:11,960 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:27:11,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:27:11,963 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-09 02:27:11,968 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-09 02:27:11,969 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:27:11,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 02:27:11,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1364333139] [2025-03-09 02:27:11,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:27:11,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:27:11,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:27:11,972 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-09 02:27:11,972 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-09 02:27:11,990 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-09 02:27:11,997 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-09 02:27:11,997 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:27:11,997 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:27:11,998 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-09 02:27:11,999 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:27:12,064 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 02:27:12,064 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 02:27:12,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:27:12,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235198179] [2025-03-09 02:27:12,064 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-09 02:27:12,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1364333139] [2025-03-09 02:27:12,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1364333139] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:27:12,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:27:12,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 02:27:12,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886300119] [2025-03-09 02:27:12,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:27:12,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 02:27:12,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:27:12,066 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 02:27:12,066 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 02:27:12,066 INFO L87 Difference]: Start difference. First operand 121 states and 153 transitions. Second operand has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 02:27:12,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:27:12,158 INFO L93 Difference]: Finished difference Result 122 states and 153 transitions. [2025-03-09 02:27:12,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 02:27:12,158 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 23 [2025-03-09 02:27:12,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:27:12,159 INFO L225 Difference]: With dead ends: 122 [2025-03-09 02:27:12,161 INFO L226 Difference]: Without dead ends: 121 [2025-03-09 02:27:12,161 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-09 02:27:12,161 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 74 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:27:12,162 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 81 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:27:12,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2025-03-09 02:27:12,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2025-03-09 02:27:12,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 91 states have (on average 1.5384615384615385) internal successors, (140), 112 states have internal predecessors, (140), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-09 02:27:12,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 152 transitions. [2025-03-09 02:27:12,172 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 152 transitions. Word has length 23 [2025-03-09 02:27:12,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:27:12,172 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 152 transitions. [2025-03-09 02:27:12,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 02:27:12,172 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 152 transitions. [2025-03-09 02:27:12,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-09 02:27:12,173 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:27:12,173 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:27:12,179 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-09 02:27:12,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:27:12,375 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-03-09 02:27:12,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:27:12,375 INFO L85 PathProgramCache]: Analyzing trace with hash -1588865637, now seen corresponding path program 1 times [2025-03-09 02:27:12,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:27:12,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091385330] [2025-03-09 02:27:12,375 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:27:12,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:27:12,379 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-09 02:27:12,382 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-09 02:27:12,383 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:27:12,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:27:12,440 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 02:27:12,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:27:12,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091385330] [2025-03-09 02:27:12,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091385330] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:27:12,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1085066924] [2025-03-09 02:27:12,441 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:27:12,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:27:12,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:27:12,443 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-09 02:27:12,444 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-09 02:27:12,463 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-09 02:27:12,472 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-09 02:27:12,472 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:27:12,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:27:12,473 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-09 02:27:12,474 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:27:12,510 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 02:27:12,510 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:27:12,607 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 02:27:12,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1085066924] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:27:12,607 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:27:12,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2025-03-09 02:27:12,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331531740] [2025-03-09 02:27:12,607 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:27:12,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-09 02:27:12,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:27:12,608 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-09 02:27:12,608 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-09 02:27:12,608 INFO L87 Difference]: Start difference. First operand 121 states and 152 transitions. Second operand has 9 states, 8 states have (on average 6.125) internal successors, (49), 7 states have internal predecessors, (49), 5 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-09 02:27:12,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:27:12,706 INFO L93 Difference]: Finished difference Result 192 states and 239 transitions. [2025-03-09 02:27:12,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 02:27:12,707 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.125) internal successors, (49), 7 states have internal predecessors, (49), 5 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) Word has length 35 [2025-03-09 02:27:12,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:27:12,708 INFO L225 Difference]: With dead ends: 192 [2025-03-09 02:27:12,708 INFO L226 Difference]: Without dead ends: 190 [2025-03-09 02:27:12,708 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-03-09 02:27:12,709 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 150 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:27:12,709 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 249 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:27:12,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2025-03-09 02:27:12,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 168. [2025-03-09 02:27:12,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 136 states have (on average 1.5441176470588236) internal successors, (210), 157 states have internal predecessors, (210), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-09 02:27:12,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 226 transitions. [2025-03-09 02:27:12,727 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 226 transitions. Word has length 35 [2025-03-09 02:27:12,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:27:12,727 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 226 transitions. [2025-03-09 02:27:12,727 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.125) internal successors, (49), 7 states have internal predecessors, (49), 5 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-09 02:27:12,727 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 226 transitions. [2025-03-09 02:27:12,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-09 02:27:12,727 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:27:12,727 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:27:12,737 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-09 02:27:12,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:27:12,928 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-03-09 02:27:12,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:27:12,929 INFO L85 PathProgramCache]: Analyzing trace with hash -2010194509, now seen corresponding path program 1 times [2025-03-09 02:27:12,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:27:12,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629825738] [2025-03-09 02:27:12,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:27:12,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:27:12,936 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-09 02:27:12,938 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-09 02:27:12,938 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:27:12,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:27:12,960 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 02:27:12,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:27:12,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629825738] [2025-03-09 02:27:12,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629825738] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:27:12,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:27:12,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 02:27:12,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171812901] [2025-03-09 02:27:12,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:27:12,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 02:27:12,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:27:12,961 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 02:27:12,961 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 02:27:12,961 INFO L87 Difference]: Start difference. First operand 168 states and 226 transitions. Second operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-09 02:27:12,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:27:12,996 INFO L93 Difference]: Finished difference Result 178 states and 235 transitions. [2025-03-09 02:27:12,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 02:27:12,996 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 36 [2025-03-09 02:27:12,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:27:12,997 INFO L225 Difference]: With dead ends: 178 [2025-03-09 02:27:12,997 INFO L226 Difference]: Without dead ends: 176 [2025-03-09 02:27:12,997 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-09 02:27:12,998 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 80 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 02:27:12,998 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 79 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:27:12,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2025-03-09 02:27:13,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 166. [2025-03-09 02:27:13,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 136 states have (on average 1.5073529411764706) internal successors, (205), 155 states have internal predecessors, (205), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-09 02:27:13,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 221 transitions. [2025-03-09 02:27:13,012 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 221 transitions. Word has length 36 [2025-03-09 02:27:13,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:27:13,012 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 221 transitions. [2025-03-09 02:27:13,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-09 02:27:13,012 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 221 transitions. [2025-03-09 02:27:13,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-09 02:27:13,015 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:27:13,015 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:27:13,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-09 02:27:13,015 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-03-09 02:27:13,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:27:13,015 INFO L85 PathProgramCache]: Analyzing trace with hash 938360849, now seen corresponding path program 1 times [2025-03-09 02:27:13,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:27:13,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824278426] [2025-03-09 02:27:13,015 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:27:13,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:27:13,019 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-09 02:27:13,026 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-09 02:27:13,027 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:27:13,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:27:13,094 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 02:27:13,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:27:13,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824278426] [2025-03-09 02:27:13,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824278426] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:27:13,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [613729240] [2025-03-09 02:27:13,095 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:27:13,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:27:13,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:27:13,097 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-09 02:27:13,098 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-09 02:27:13,117 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-09 02:27:13,128 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-09 02:27:13,128 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:27:13,128 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:27:13,129 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 02:27:13,130 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:27:13,192 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 02:27:13,193 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 02:27:13,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [613729240] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:27:13,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 02:27:13,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2025-03-09 02:27:13,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101545569] [2025-03-09 02:27:13,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:27:13,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 02:27:13,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:27:13,193 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 02:27:13,194 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-03-09 02:27:13,194 INFO L87 Difference]: Start difference. First operand 166 states and 221 transitions. Second operand has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-09 02:27:13,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:27:13,232 INFO L93 Difference]: Finished difference Result 166 states and 221 transitions. [2025-03-09 02:27:13,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 02:27:13,232 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 38 [2025-03-09 02:27:13,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:27:13,233 INFO L225 Difference]: With dead ends: 166 [2025-03-09 02:27:13,233 INFO L226 Difference]: Without dead ends: 165 [2025-03-09 02:27:13,234 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-03-09 02:27:13,234 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 42 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 02:27:13,234 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 166 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:27:13,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2025-03-09 02:27:13,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2025-03-09 02:27:13,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 136 states have (on average 1.4705882352941178) internal successors, (200), 154 states have internal predecessors, (200), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-09 02:27:13,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 216 transitions. [2025-03-09 02:27:13,246 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 216 transitions. Word has length 38 [2025-03-09 02:27:13,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:27:13,247 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 216 transitions. [2025-03-09 02:27:13,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-09 02:27:13,248 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 216 transitions. [2025-03-09 02:27:13,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-03-09 02:27:13,248 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:27:13,248 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:27:13,254 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-09 02:27:13,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:27:13,449 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-03-09 02:27:13,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:27:13,449 INFO L85 PathProgramCache]: Analyzing trace with hash -975584732, now seen corresponding path program 1 times [2025-03-09 02:27:13,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:27:13,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420455584] [2025-03-09 02:27:13,449 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:27:13,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:27:13,453 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-09 02:27:13,455 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-09 02:27:13,455 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:27:13,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:27:13,515 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 02:27:13,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:27:13,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420455584] [2025-03-09 02:27:13,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420455584] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:27:13,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [389158469] [2025-03-09 02:27:13,516 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:27:13,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:27:13,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:27:13,517 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-09 02:27:13,518 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-09 02:27:13,542 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-09 02:27:13,553 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-09 02:27:13,553 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:27:13,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:27:13,553 INFO L256 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 02:27:13,554 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:27:13,603 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 02:27:13,603 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 02:27:13,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [389158469] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:27:13,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 02:27:13,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2025-03-09 02:27:13,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104289350] [2025-03-09 02:27:13,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:27:13,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 02:27:13,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:27:13,604 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 02:27:13,604 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-03-09 02:27:13,604 INFO L87 Difference]: Start difference. First operand 165 states and 216 transitions. Second operand has 5 states, 4 states have (on average 7.5) internal successors, (30), 5 states have internal predecessors, (30), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-09 02:27:13,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:27:13,645 INFO L93 Difference]: Finished difference Result 175 states and 225 transitions. [2025-03-09 02:27:13,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 02:27:13,646 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.5) internal successors, (30), 5 states have internal predecessors, (30), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 39 [2025-03-09 02:27:13,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:27:13,647 INFO L225 Difference]: With dead ends: 175 [2025-03-09 02:27:13,647 INFO L226 Difference]: Without dead ends: 174 [2025-03-09 02:27:13,648 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-09 02:27:13,648 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 40 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 02:27:13,648 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 187 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:27:13,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2025-03-09 02:27:13,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 164. [2025-03-09 02:27:13,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 136 states have (on average 1.4338235294117647) internal successors, (195), 153 states have internal predecessors, (195), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-09 02:27:13,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 211 transitions. [2025-03-09 02:27:13,656 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 211 transitions. Word has length 39 [2025-03-09 02:27:13,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:27:13,656 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 211 transitions. [2025-03-09 02:27:13,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.5) internal successors, (30), 5 states have internal predecessors, (30), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-09 02:27:13,657 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 211 transitions. [2025-03-09 02:27:13,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-09 02:27:13,657 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:27:13,658 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:27:13,665 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-09 02:27:13,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:27:13,862 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-03-09 02:27:13,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:27:13,862 INFO L85 PathProgramCache]: Analyzing trace with hash -1234056318, now seen corresponding path program 1 times [2025-03-09 02:27:13,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:27:13,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900882945] [2025-03-09 02:27:13,863 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:27:13,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:27:13,867 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-09 02:27:13,875 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-09 02:27:13,876 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:27:13,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 02:27:13,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1520905348] [2025-03-09 02:27:13,876 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:27:13,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:27:13,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:27:13,878 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-09 02:27:13,880 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-09 02:27:13,901 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-09 02:27:13,914 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-09 02:27:13,914 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:27:13,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:27:13,915 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-09 02:27:13,916 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:27:14,044 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 02:27:14,044 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:27:14,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:27:14,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900882945] [2025-03-09 02:27:14,204 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-09 02:27:14,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1520905348] [2025-03-09 02:27:14,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1520905348] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:27:14,204 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-09 02:27:14,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2025-03-09 02:27:14,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636556224] [2025-03-09 02:27:14,204 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-09 02:27:14,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 02:27:14,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:27:14,205 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 02:27:14,205 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-03-09 02:27:14,205 INFO L87 Difference]: Start difference. First operand 164 states and 211 transitions. Second operand has 6 states, 5 states have (on average 6.4) internal successors, (32), 6 states have internal predecessors, (32), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-09 02:27:14,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:27:14,317 INFO L93 Difference]: Finished difference Result 171 states and 214 transitions. [2025-03-09 02:27:14,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 02:27:14,318 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.4) internal successors, (32), 6 states have internal predecessors, (32), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 41 [2025-03-09 02:27:14,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:27:14,319 INFO L225 Difference]: With dead ends: 171 [2025-03-09 02:27:14,319 INFO L226 Difference]: Without dead ends: 164 [2025-03-09 02:27:14,320 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2025-03-09 02:27:14,320 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 43 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:27:14,320 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 92 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:27:14,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2025-03-09 02:27:14,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 160. [2025-03-09 02:27:14,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 137 states have (on average 1.3284671532846715) internal successors, (182), 149 states have internal predecessors, (182), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-09 02:27:14,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 198 transitions. [2025-03-09 02:27:14,328 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 198 transitions. Word has length 41 [2025-03-09 02:27:14,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:27:14,328 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 198 transitions. [2025-03-09 02:27:14,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.4) internal successors, (32), 6 states have internal predecessors, (32), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-09 02:27:14,328 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 198 transitions. [2025-03-09 02:27:14,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-09 02:27:14,330 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:27:14,330 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:27:14,335 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-09 02:27:14,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:27:14,530 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-03-09 02:27:14,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:27:14,531 INFO L85 PathProgramCache]: Analyzing trace with hash 398959821, now seen corresponding path program 1 times [2025-03-09 02:27:14,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:27:14,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466950015] [2025-03-09 02:27:14,531 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:27:14,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:27:14,539 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-09 02:27:14,546 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-09 02:27:14,546 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:27:14,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 02:27:14,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [25728593] [2025-03-09 02:27:14,547 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:27:14,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:27:14,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:27:14,549 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-09 02:27:14,550 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-09 02:27:14,571 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-09 02:27:14,580 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-09 02:27:14,580 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:27:14,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:27:14,581 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-09 02:27:14,583 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:27:14,702 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 02:27:14,702 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:27:14,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:27:14,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466950015] [2025-03-09 02:27:14,899 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-09 02:27:14,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [25728593] [2025-03-09 02:27:14,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [25728593] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:27:14,899 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-09 02:27:14,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2025-03-09 02:27:14,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097716338] [2025-03-09 02:27:14,899 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-09 02:27:14,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 02:27:14,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:27:14,900 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 02:27:14,900 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-03-09 02:27:14,900 INFO L87 Difference]: Start difference. First operand 160 states and 198 transitions. Second operand has 6 states, 5 states have (on average 6.6) internal successors, (33), 6 states have internal predecessors, (33), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-09 02:27:14,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:27:14,996 INFO L93 Difference]: Finished difference Result 216 states and 266 transitions. [2025-03-09 02:27:14,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 02:27:14,998 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.6) internal successors, (33), 6 states have internal predecessors, (33), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 42 [2025-03-09 02:27:14,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:27:14,999 INFO L225 Difference]: With dead ends: 216 [2025-03-09 02:27:14,999 INFO L226 Difference]: Without dead ends: 211 [2025-03-09 02:27:14,999 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-03-09 02:27:15,000 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 104 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:27:15,000 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 116 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:27:15,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2025-03-09 02:27:15,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 203. [2025-03-09 02:27:15,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 178 states have (on average 1.3089887640449438) internal successors, (233), 190 states have internal predecessors, (233), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-09 02:27:15,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 253 transitions. [2025-03-09 02:27:15,024 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 253 transitions. Word has length 42 [2025-03-09 02:27:15,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:27:15,024 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 253 transitions. [2025-03-09 02:27:15,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.6) internal successors, (33), 6 states have internal predecessors, (33), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-09 02:27:15,024 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 253 transitions. [2025-03-09 02:27:15,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-09 02:27:15,025 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:27:15,025 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:27:15,031 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-09 02:27:15,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-09 02:27:15,226 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-03-09 02:27:15,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:27:15,226 INFO L85 PathProgramCache]: Analyzing trace with hash 326932543, now seen corresponding path program 1 times [2025-03-09 02:27:15,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:27:15,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651307892] [2025-03-09 02:27:15,227 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:27:15,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:27:15,229 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-09 02:27:15,232 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-09 02:27:15,232 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:27:15,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:27:15,285 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 02:27:15,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:27:15,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651307892] [2025-03-09 02:27:15,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651307892] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:27:15,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [383796861] [2025-03-09 02:27:15,286 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:27:15,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:27:15,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:27:15,288 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-09 02:27:15,289 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-09 02:27:15,310 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-09 02:27:15,320 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-09 02:27:15,320 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:27:15,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:27:15,321 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 02:27:15,322 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:27:15,416 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 02:27:15,416 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 02:27:15,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [383796861] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:27:15,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 02:27:15,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 7 [2025-03-09 02:27:15,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530060026] [2025-03-09 02:27:15,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:27:15,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 02:27:15,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:27:15,417 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 02:27:15,417 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-03-09 02:27:15,418 INFO L87 Difference]: Start difference. First operand 203 states and 253 transitions. Second operand has 5 states, 4 states have (on average 8.5) internal successors, (34), 5 states have internal predecessors, (34), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-09 02:27:15,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:27:15,482 INFO L93 Difference]: Finished difference Result 203 states and 253 transitions. [2025-03-09 02:27:15,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 02:27:15,483 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.5) internal successors, (34), 5 states have internal predecessors, (34), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 43 [2025-03-09 02:27:15,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:27:15,484 INFO L225 Difference]: With dead ends: 203 [2025-03-09 02:27:15,485 INFO L226 Difference]: Without dead ends: 201 [2025-03-09 02:27:15,485 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-03-09 02:27:15,486 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 32 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:27:15,486 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 70 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:27:15,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2025-03-09 02:27:15,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 198. [2025-03-09 02:27:15,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 175 states have (on average 1.2971428571428572) internal successors, (227), 185 states have internal predecessors, (227), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-09 02:27:15,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 247 transitions. [2025-03-09 02:27:15,496 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 247 transitions. Word has length 43 [2025-03-09 02:27:15,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:27:15,496 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 247 transitions. [2025-03-09 02:27:15,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.5) internal successors, (34), 5 states have internal predecessors, (34), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-09 02:27:15,496 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 247 transitions. [2025-03-09 02:27:15,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-09 02:27:15,496 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:27:15,497 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:27:15,504 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-09 02:27:15,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-09 02:27:15,702 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-03-09 02:27:15,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:27:15,702 INFO L85 PathProgramCache]: Analyzing trace with hash 1544974252, now seen corresponding path program 1 times [2025-03-09 02:27:15,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:27:15,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775637707] [2025-03-09 02:27:15,702 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:27:15,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:27:15,705 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-09 02:27:15,709 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-09 02:27:15,709 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:27:15,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:27:15,778 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 02:27:15,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:27:15,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775637707] [2025-03-09 02:27:15,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775637707] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:27:15,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [16997762] [2025-03-09 02:27:15,779 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:27:15,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:27:15,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:27:15,781 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-09 02:27:15,782 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-09 02:27:15,803 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-09 02:27:15,812 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-09 02:27:15,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:27:15,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:27:15,812 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 02:27:15,816 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:27:15,905 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 02:27:15,905 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:27:15,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [16997762] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:27:15,992 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-09 02:27:15,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 3] total 8 [2025-03-09 02:27:15,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995896210] [2025-03-09 02:27:15,992 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-09 02:27:15,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-09 02:27:15,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:27:15,993 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-09 02:27:15,993 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-03-09 02:27:15,993 INFO L87 Difference]: Start difference. First operand 198 states and 247 transitions. Second operand has 9 states, 8 states have (on average 8.125) internal successors, (65), 9 states have internal predecessors, (65), 3 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-09 02:27:16,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:27:16,160 INFO L93 Difference]: Finished difference Result 206 states and 251 transitions. [2025-03-09 02:27:16,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 02:27:16,160 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 8.125) internal successors, (65), 9 states have internal predecessors, (65), 3 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 44 [2025-03-09 02:27:16,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:27:16,161 INFO L225 Difference]: With dead ends: 206 [2025-03-09 02:27:16,161 INFO L226 Difference]: Without dead ends: 198 [2025-03-09 02:27:16,162 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2025-03-09 02:27:16,162 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 24 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:27:16,162 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 192 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:27:16,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2025-03-09 02:27:16,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2025-03-09 02:27:16,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 175 states have (on average 1.2685714285714285) internal successors, (222), 185 states have internal predecessors, (222), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-09 02:27:16,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 242 transitions. [2025-03-09 02:27:16,175 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 242 transitions. Word has length 44 [2025-03-09 02:27:16,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:27:16,175 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 242 transitions. [2025-03-09 02:27:16,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 8.125) internal successors, (65), 9 states have internal predecessors, (65), 3 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-09 02:27:16,175 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 242 transitions. [2025-03-09 02:27:16,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-09 02:27:16,176 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:27:16,176 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:27:16,185 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-09 02:27:16,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-09 02:27:16,376 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-03-09 02:27:16,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:27:16,377 INFO L85 PathProgramCache]: Analyzing trace with hash 1237532222, now seen corresponding path program 1 times [2025-03-09 02:27:16,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:27:16,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51265909] [2025-03-09 02:27:16,377 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:27:16,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:27:16,381 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-09 02:27:16,388 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-09 02:27:16,388 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:27:16,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:27:16,537 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 02:27:16,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:27:16,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51265909] [2025-03-09 02:27:16,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51265909] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:27:16,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1379437405] [2025-03-09 02:27:16,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:27:16,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:27:16,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:27:16,540 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-09 02:27:16,542 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-09 02:27:16,565 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-09 02:27:16,575 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-09 02:27:16,576 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:27:16,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:27:16,577 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-09 02:27:16,579 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:27:16,688 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 02:27:16,688 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:27:16,911 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 02:27:16,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1379437405] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:27:16,912 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:27:16,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2025-03-09 02:27:16,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053177203] [2025-03-09 02:27:16,912 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:27:16,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-09 02:27:16,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:27:16,913 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-09 02:27:16,913 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2025-03-09 02:27:16,913 INFO L87 Difference]: Start difference. First operand 198 states and 242 transitions. Second operand has 17 states, 16 states have (on average 4.0625) internal successors, (65), 16 states have internal predecessors, (65), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 02:27:17,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:27:17,182 INFO L93 Difference]: Finished difference Result 208 states and 249 transitions. [2025-03-09 02:27:17,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-09 02:27:17,182 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 4.0625) internal successors, (65), 16 states have internal predecessors, (65), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 45 [2025-03-09 02:27:17,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:27:17,184 INFO L225 Difference]: With dead ends: 208 [2025-03-09 02:27:17,184 INFO L226 Difference]: Without dead ends: 205 [2025-03-09 02:27:17,184 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 77 SyntacticMatches, 5 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=159, Invalid=491, Unknown=0, NotChecked=0, Total=650 [2025-03-09 02:27:17,186 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 185 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 02:27:17,186 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 149 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 02:27:17,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2025-03-09 02:27:17,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 166. [2025-03-09 02:27:17,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 147 states have (on average 1.2244897959183674) internal successors, (180), 154 states have internal predecessors, (180), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-09 02:27:17,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 198 transitions. [2025-03-09 02:27:17,197 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 198 transitions. Word has length 45 [2025-03-09 02:27:17,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:27:17,198 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 198 transitions. [2025-03-09 02:27:17,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 4.0625) internal successors, (65), 16 states have internal predecessors, (65), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 02:27:17,198 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 198 transitions. [2025-03-09 02:27:17,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-09 02:27:17,199 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:27:17,199 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:27:17,205 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-09 02:27:17,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-09 02:27:17,400 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-03-09 02:27:17,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:27:17,400 INFO L85 PathProgramCache]: Analyzing trace with hash -291206775, now seen corresponding path program 1 times [2025-03-09 02:27:17,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:27:17,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200205014] [2025-03-09 02:27:17,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:27:17,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:27:17,405 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-09 02:27:17,410 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-09 02:27:17,410 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:27:17,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 02:27:17,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1686494394] [2025-03-09 02:27:17,411 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:27:17,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:27:17,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:27:17,413 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-09 02:27:17,415 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-09 02:27:17,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-09 02:27:17,443 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-09 02:27:17,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:27:17,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:27:17,444 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-09 02:27:17,446 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:27:17,632 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 02:27:17,632 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:27:17,721 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 02:27:17,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:27:17,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200205014] [2025-03-09 02:27:17,721 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-09 02:27:17,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1686494394] [2025-03-09 02:27:17,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1686494394] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:27:17,721 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-09 02:27:17,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2025-03-09 02:27:17,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266795055] [2025-03-09 02:27:17,721 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-09 02:27:17,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-09 02:27:17,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:27:17,722 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-09 02:27:17,722 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-03-09 02:27:17,722 INFO L87 Difference]: Start difference. First operand 166 states and 198 transitions. Second operand has 11 states, 10 states have (on average 6.6) internal successors, (66), 11 states have internal predecessors, (66), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-09 02:27:17,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:27:17,899 INFO L93 Difference]: Finished difference Result 273 states and 325 transitions. [2025-03-09 02:27:17,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-09 02:27:17,899 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.6) internal successors, (66), 11 states have internal predecessors, (66), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 46 [2025-03-09 02:27:17,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:27:17,900 INFO L225 Difference]: With dead ends: 273 [2025-03-09 02:27:17,900 INFO L226 Difference]: Without dead ends: 190 [2025-03-09 02:27:17,900 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 80 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=228, Unknown=0, NotChecked=0, Total=306 [2025-03-09 02:27:17,901 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 109 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:27:17,901 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 112 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:27:17,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2025-03-09 02:27:17,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 184. [2025-03-09 02:27:17,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 165 states have (on average 1.1636363636363636) internal successors, (192), 171 states have internal predecessors, (192), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-09 02:27:17,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 212 transitions. [2025-03-09 02:27:17,909 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 212 transitions. Word has length 46 [2025-03-09 02:27:17,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:27:17,909 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 212 transitions. [2025-03-09 02:27:17,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.6) internal successors, (66), 11 states have internal predecessors, (66), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-09 02:27:17,909 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 212 transitions. [2025-03-09 02:27:17,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-09 02:27:17,909 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:27:17,909 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:27:17,915 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-09 02:27:18,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-09 02:27:18,114 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-03-09 02:27:18,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:27:18,115 INFO L85 PathProgramCache]: Analyzing trace with hash 528317720, now seen corresponding path program 2 times [2025-03-09 02:27:18,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:27:18,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021154857] [2025-03-09 02:27:18,115 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 02:27:18,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:27:18,119 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 65 statements into 2 equivalence classes. [2025-03-09 02:27:18,127 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 65 of 65 statements. [2025-03-09 02:27:18,127 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 02:27:18,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 02:27:18,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1789331946] [2025-03-09 02:27:18,128 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 02:27:18,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:27:18,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:27:18,131 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-09 02:27:18,133 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-09 02:27:18,152 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 65 statements into 2 equivalence classes. [2025-03-09 02:27:18,164 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 65 of 65 statements. [2025-03-09 02:27:18,164 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 02:27:18,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:27:18,164 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-09 02:27:18,166 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:27:18,271 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-09 02:27:18,271 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:27:18,416 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-09 02:27:18,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:27:18,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021154857] [2025-03-09 02:27:18,417 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-09 02:27:18,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1789331946] [2025-03-09 02:27:18,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1789331946] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:27:18,417 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-09 02:27:18,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2025-03-09 02:27:18,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992250091] [2025-03-09 02:27:18,417 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-09 02:27:18,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-09 02:27:18,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:27:18,418 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-09 02:27:18,418 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-03-09 02:27:18,418 INFO L87 Difference]: Start difference. First operand 184 states and 212 transitions. Second operand has 10 states, 9 states have (on average 10.444444444444445) internal successors, (94), 10 states have internal predecessors, (94), 5 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-09 02:27:18,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:27:18,817 INFO L93 Difference]: Finished difference Result 387 states and 459 transitions. [2025-03-09 02:27:18,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-09 02:27:18,818 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 10.444444444444445) internal successors, (94), 10 states have internal predecessors, (94), 5 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 65 [2025-03-09 02:27:18,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:27:18,819 INFO L225 Difference]: With dead ends: 387 [2025-03-09 02:27:18,819 INFO L226 Difference]: Without dead ends: 376 [2025-03-09 02:27:18,819 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2025-03-09 02:27:18,820 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 155 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-09 02:27:18,820 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 300 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-09 02:27:18,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2025-03-09 02:27:18,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 354. [2025-03-09 02:27:18,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 327 states have (on average 1.1681957186544343) internal successors, (382), 333 states have internal predecessors, (382), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-09 02:27:18,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 418 transitions. [2025-03-09 02:27:18,837 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 418 transitions. Word has length 65 [2025-03-09 02:27:18,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:27:18,837 INFO L471 AbstractCegarLoop]: Abstraction has 354 states and 418 transitions. [2025-03-09 02:27:18,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 10.444444444444445) internal successors, (94), 10 states have internal predecessors, (94), 5 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-09 02:27:18,838 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 418 transitions. [2025-03-09 02:27:18,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-09 02:27:18,838 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:27:18,838 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:27:18,845 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-09 02:27:19,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-09 02:27:19,039 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-03-09 02:27:19,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:27:19,040 INFO L85 PathProgramCache]: Analyzing trace with hash 301635478, now seen corresponding path program 2 times [2025-03-09 02:27:19,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:27:19,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912001461] [2025-03-09 02:27:19,040 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 02:27:19,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:27:19,045 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 67 statements into 2 equivalence classes. [2025-03-09 02:27:19,052 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 67 of 67 statements. [2025-03-09 02:27:19,054 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 02:27:19,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:27:19,169 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-09 02:27:19,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:27:19,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912001461] [2025-03-09 02:27:19,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912001461] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:27:19,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [513243463] [2025-03-09 02:27:19,170 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 02:27:19,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:27:19,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:27:19,172 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-09 02:27:19,175 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-09 02:27:19,194 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 67 statements into 2 equivalence classes. [2025-03-09 02:27:19,207 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 67 of 67 statements. [2025-03-09 02:27:19,207 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 02:27:19,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:27:19,208 INFO L256 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-09 02:27:19,209 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:27:19,326 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-09 02:27:19,326 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:27:19,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [513243463] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:27:19,395 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-09 02:27:19,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4] total 10 [2025-03-09 02:27:19,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724134418] [2025-03-09 02:27:19,395 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-09 02:27:19,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-09 02:27:19,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:27:19,396 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-09 02:27:19,396 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2025-03-09 02:27:19,396 INFO L87 Difference]: Start difference. First operand 354 states and 418 transitions. Second operand has 11 states, 10 states have (on average 10.1) internal successors, (101), 11 states have internal predecessors, (101), 5 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-09 02:27:19,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:27:19,559 INFO L93 Difference]: Finished difference Result 383 states and 450 transitions. [2025-03-09 02:27:19,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-09 02:27:19,560 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 10.1) internal successors, (101), 11 states have internal predecessors, (101), 5 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 67 [2025-03-09 02:27:19,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:27:19,562 INFO L225 Difference]: With dead ends: 383 [2025-03-09 02:27:19,562 INFO L226 Difference]: Without dead ends: 375 [2025-03-09 02:27:19,563 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2025-03-09 02:27:19,563 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 26 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:27:19,563 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 189 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:27:19,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2025-03-09 02:27:19,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 373. [2025-03-09 02:27:19,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 373 states, 345 states have (on average 1.1623188405797102) internal successors, (401), 351 states have internal predecessors, (401), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-09 02:27:19,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 439 transitions. [2025-03-09 02:27:19,577 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 439 transitions. Word has length 67 [2025-03-09 02:27:19,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:27:19,577 INFO L471 AbstractCegarLoop]: Abstraction has 373 states and 439 transitions. [2025-03-09 02:27:19,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 10.1) internal successors, (101), 11 states have internal predecessors, (101), 5 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-09 02:27:19,578 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 439 transitions. [2025-03-09 02:27:19,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-09 02:27:19,579 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:27:19,580 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:27:19,585 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-03-09 02:27:19,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:27:19,780 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-03-09 02:27:19,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:27:19,781 INFO L85 PathProgramCache]: Analyzing trace with hash -730864820, now seen corresponding path program 1 times [2025-03-09 02:27:19,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:27:19,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996826658] [2025-03-09 02:27:19,781 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:27:19,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:27:19,785 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-09 02:27:19,794 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-09 02:27:19,794 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:27:19,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:27:19,893 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 56 proven. 15 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-09 02:27:19,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:27:19,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996826658] [2025-03-09 02:27:19,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996826658] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:27:19,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1814568434] [2025-03-09 02:27:19,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:27:19,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:27:19,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:27:19,895 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-09 02:27:19,897 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-09 02:27:19,916 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-09 02:27:19,930 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-09 02:27:19,930 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:27:19,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:27:19,931 INFO L256 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-09 02:27:19,932 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:27:19,995 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 56 proven. 15 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-09 02:27:19,996 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:27:20,062 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 24 proven. 47 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-09 02:27:20,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1814568434] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:27:20,062 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:27:20,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2025-03-09 02:27:20,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812101886] [2025-03-09 02:27:20,062 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:27:20,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 02:27:20,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:27:20,063 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 02:27:20,063 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-09 02:27:20,063 INFO L87 Difference]: Start difference. First operand 373 states and 439 transitions. Second operand has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 5 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-09 02:27:20,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:27:20,125 INFO L93 Difference]: Finished difference Result 512 states and 592 transitions. [2025-03-09 02:27:20,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 02:27:20,125 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 5 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 90 [2025-03-09 02:27:20,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:27:20,127 INFO L225 Difference]: With dead ends: 512 [2025-03-09 02:27:20,127 INFO L226 Difference]: Without dead ends: 344 [2025-03-09 02:27:20,127 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-09 02:27:20,128 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 17 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 02:27:20,128 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 134 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:27:20,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2025-03-09 02:27:20,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 341. [2025-03-09 02:27:20,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 315 states have (on average 1.1206349206349207) internal successors, (353), 321 states have internal predecessors, (353), 17 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-09 02:27:20,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 387 transitions. [2025-03-09 02:27:20,161 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 387 transitions. Word has length 90 [2025-03-09 02:27:20,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:27:20,161 INFO L471 AbstractCegarLoop]: Abstraction has 341 states and 387 transitions. [2025-03-09 02:27:20,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 5 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-09 02:27:20,161 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 387 transitions. [2025-03-09 02:27:20,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-09 02:27:20,162 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:27:20,162 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:27:20,170 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-09 02:27:20,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:27:20,362 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-03-09 02:27:20,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:27:20,363 INFO L85 PathProgramCache]: Analyzing trace with hash -846990835, now seen corresponding path program 2 times [2025-03-09 02:27:20,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:27:20,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047486935] [2025-03-09 02:27:20,363 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 02:27:20,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:27:20,366 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 90 statements into 2 equivalence classes. [2025-03-09 02:27:20,371 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 90 of 90 statements. [2025-03-09 02:27:20,372 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 02:27:20,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:27:20,554 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 14 proven. 27 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-03-09 02:27:20,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:27:20,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047486935] [2025-03-09 02:27:20,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047486935] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:27:20,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [352661007] [2025-03-09 02:27:20,554 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 02:27:20,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:27:20,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:27:20,556 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-09 02:27:20,558 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-09 02:27:20,577 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 90 statements into 2 equivalence classes. [2025-03-09 02:27:20,591 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 90 of 90 statements. [2025-03-09 02:27:20,591 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 02:27:20,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:27:20,592 INFO L256 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-09 02:27:20,593 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:27:20,735 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 6 proven. 73 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-09 02:27:20,736 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:27:20,916 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 6 proven. 73 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-09 02:27:20,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [352661007] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:27:20,916 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:27:20,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 22 [2025-03-09 02:27:20,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138494489] [2025-03-09 02:27:20,917 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:27:20,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-09 02:27:20,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:27:20,918 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-09 02:27:20,918 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=429, Unknown=0, NotChecked=0, Total=506 [2025-03-09 02:27:20,918 INFO L87 Difference]: Start difference. First operand 341 states and 387 transitions. Second operand has 23 states, 22 states have (on average 7.954545454545454) internal successors, (175), 22 states have internal predecessors, (175), 10 states have call successors, (11), 1 states have call predecessors, (11), 3 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2025-03-09 02:27:22,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:27:22,210 INFO L93 Difference]: Finished difference Result 759 states and 878 transitions. [2025-03-09 02:27:22,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2025-03-09 02:27:22,210 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 7.954545454545454) internal successors, (175), 22 states have internal predecessors, (175), 10 states have call successors, (11), 1 states have call predecessors, (11), 3 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) Word has length 90 [2025-03-09 02:27:22,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:27:22,213 INFO L225 Difference]: With dead ends: 759 [2025-03-09 02:27:22,213 INFO L226 Difference]: Without dead ends: 725 [2025-03-09 02:27:22,215 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 169 SyntacticMatches, 1 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1935 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1350, Invalid=4502, Unknown=0, NotChecked=0, Total=5852 [2025-03-09 02:27:22,216 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 505 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 477 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 505 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 477 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-09 02:27:22,216 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [505 Valid, 295 Invalid, 523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 477 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-09 02:27:22,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 725 states. [2025-03-09 02:27:22,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 725 to 335. [2025-03-09 02:27:22,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 311 states have (on average 1.0836012861736335) internal successors, (337), 315 states have internal predecessors, (337), 17 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-09 02:27:22,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 371 transitions. [2025-03-09 02:27:22,231 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 371 transitions. Word has length 90 [2025-03-09 02:27:22,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:27:22,232 INFO L471 AbstractCegarLoop]: Abstraction has 335 states and 371 transitions. [2025-03-09 02:27:22,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 7.954545454545454) internal successors, (175), 22 states have internal predecessors, (175), 10 states have call successors, (11), 1 states have call predecessors, (11), 3 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2025-03-09 02:27:22,232 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 371 transitions. [2025-03-09 02:27:22,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-09 02:27:22,233 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:27:22,233 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:27:22,239 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-09 02:27:22,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:27:22,434 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-03-09 02:27:22,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:27:22,434 INFO L85 PathProgramCache]: Analyzing trace with hash 1827248542, now seen corresponding path program 1 times [2025-03-09 02:27:22,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:27:22,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107753624] [2025-03-09 02:27:22,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:27:22,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:27:22,438 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-09 02:27:22,443 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-09 02:27:22,443 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:27:22,443 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:27:22,480 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 62 proven. 14 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-03-09 02:27:22,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:27:22,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107753624] [2025-03-09 02:27:22,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107753624] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:27:22,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1335670058] [2025-03-09 02:27:22,481 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:27:22,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:27:22,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:27:22,483 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-09 02:27:22,485 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-09 02:27:22,510 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-09 02:27:22,527 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-09 02:27:22,527 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:27:22,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:27:22,528 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 02:27:22,529 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:27:22,568 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 62 proven. 14 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-03-09 02:27:22,569 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:27:22,627 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 62 proven. 14 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-03-09 02:27:22,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1335670058] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:27:22,628 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:27:22,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-03-09 02:27:22,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445899137] [2025-03-09 02:27:22,628 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:27:22,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 02:27:22,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:27:22,629 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 02:27:22,629 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-09 02:27:22,629 INFO L87 Difference]: Start difference. First operand 335 states and 371 transitions. Second operand has 7 states, 6 states have (on average 19.333333333333332) internal successors, (116), 7 states have internal predecessors, (116), 6 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2025-03-09 02:27:22,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:27:22,716 INFO L93 Difference]: Finished difference Result 514 states and 581 transitions. [2025-03-09 02:27:22,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 02:27:22,717 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 19.333333333333332) internal successors, (116), 7 states have internal predecessors, (116), 6 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) Word has length 100 [2025-03-09 02:27:22,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:27:22,718 INFO L225 Difference]: With dead ends: 514 [2025-03-09 02:27:22,718 INFO L226 Difference]: Without dead ends: 512 [2025-03-09 02:27:22,719 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-09 02:27:22,719 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 12 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:27:22,719 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 136 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:27:22,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2025-03-09 02:27:22,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 512. [2025-03-09 02:27:22,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 512 states, 479 states have (on average 1.058455114822547) internal successors, (507), 482 states have internal predecessors, (507), 27 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-03-09 02:27:22,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 561 transitions. [2025-03-09 02:27:22,740 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 561 transitions. Word has length 100 [2025-03-09 02:27:22,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:27:22,741 INFO L471 AbstractCegarLoop]: Abstraction has 512 states and 561 transitions. [2025-03-09 02:27:22,741 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 19.333333333333332) internal successors, (116), 7 states have internal predecessors, (116), 6 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2025-03-09 02:27:22,741 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 561 transitions. [2025-03-09 02:27:22,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-09 02:27:22,742 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:27:22,742 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:27:22,748 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-09 02:27:22,942 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:27:22,942 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-03-09 02:27:22,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:27:22,943 INFO L85 PathProgramCache]: Analyzing trace with hash -360641376, now seen corresponding path program 1 times [2025-03-09 02:27:22,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:27:22,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062331942] [2025-03-09 02:27:22,943 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:27:22,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:27:22,946 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-09 02:27:22,950 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-09 02:27:22,950 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:27:22,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:27:22,996 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 108 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-09 02:27:22,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:27:22,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062331942] [2025-03-09 02:27:22,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062331942] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:27:22,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [836513397] [2025-03-09 02:27:22,996 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:27:22,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:27:22,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:27:22,998 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-09 02:27:23,001 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-09 02:27:23,022 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-09 02:27:23,037 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-09 02:27:23,037 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:27:23,037 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:27:23,038 INFO L256 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 02:27:23,039 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:27:23,101 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 108 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-09 02:27:23,101 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:27:23,201 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 108 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-09 02:27:23,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [836513397] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:27:23,201 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:27:23,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-09 02:27:23,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38001881] [2025-03-09 02:27:23,201 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:27:23,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-09 02:27:23,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:27:23,202 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-09 02:27:23,202 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2025-03-09 02:27:23,202 INFO L87 Difference]: Start difference. First operand 512 states and 561 transitions. Second operand has 11 states, 10 states have (on average 16.7) internal successors, (167), 11 states have internal predecessors, (167), 10 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2025-03-09 02:27:23,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:27:23,342 INFO L93 Difference]: Finished difference Result 1219 states and 1361 transitions. [2025-03-09 02:27:23,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-09 02:27:23,343 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 16.7) internal successors, (167), 11 states have internal predecessors, (167), 10 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) Word has length 103 [2025-03-09 02:27:23,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:27:23,348 INFO L225 Difference]: With dead ends: 1219 [2025-03-09 02:27:23,348 INFO L226 Difference]: Without dead ends: 1218 [2025-03-09 02:27:23,348 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2025-03-09 02:27:23,352 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 112 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:27:23,352 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 213 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:27:23,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1218 states. [2025-03-09 02:27:23,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1218 to 1198. [2025-03-09 02:27:23,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1198 states, 1129 states have (on average 1.070859167404783) internal successors, (1209), 1132 states have internal predecessors, (1209), 63 states have call successors, (63), 2 states have call predecessors, (63), 2 states have return successors, (63), 63 states have call predecessors, (63), 63 states have call successors, (63) [2025-03-09 02:27:23,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1198 states to 1198 states and 1335 transitions. [2025-03-09 02:27:23,424 INFO L78 Accepts]: Start accepts. Automaton has 1198 states and 1335 transitions. Word has length 103 [2025-03-09 02:27:23,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:27:23,424 INFO L471 AbstractCegarLoop]: Abstraction has 1198 states and 1335 transitions. [2025-03-09 02:27:23,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 16.7) internal successors, (167), 11 states have internal predecessors, (167), 10 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2025-03-09 02:27:23,424 INFO L276 IsEmpty]: Start isEmpty. Operand 1198 states and 1335 transitions. [2025-03-09 02:27:23,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-09 02:27:23,425 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:27:23,425 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:27:23,435 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2025-03-09 02:27:23,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:27:23,633 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-03-09 02:27:23,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:27:23,634 INFO L85 PathProgramCache]: Analyzing trace with hash -1516179113, now seen corresponding path program 1 times [2025-03-09 02:27:23,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:27:23,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386418851] [2025-03-09 02:27:23,634 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:27:23,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:27:23,638 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-09 02:27:23,645 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-09 02:27:23,645 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:27:23,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:27:23,696 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 86 proven. 30 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-03-09 02:27:23,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:27:23,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386418851] [2025-03-09 02:27:23,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386418851] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:27:23,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1735165532] [2025-03-09 02:27:23,697 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:27:23,697 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:27:23,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:27:23,699 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-09 02:27:23,700 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-09 02:27:23,721 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-09 02:27:23,738 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-09 02:27:23,738 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:27:23,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:27:23,739 INFO L256 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 02:27:23,740 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:27:23,813 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 98 proven. 30 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-09 02:27:23,813 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:27:23,899 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 86 proven. 30 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-03-09 02:27:23,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1735165532] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:27:23,899 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:27:23,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2025-03-09 02:27:23,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286590249] [2025-03-09 02:27:23,899 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:27:23,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-09 02:27:23,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:27:23,900 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-09 02:27:23,900 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-09 02:27:23,900 INFO L87 Difference]: Start difference. First operand 1198 states and 1335 transitions. Second operand has 9 states, 9 states have (on average 14.666666666666666) internal successors, (132), 9 states have internal predecessors, (132), 8 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2025-03-09 02:27:24,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:27:24,028 INFO L93 Difference]: Finished difference Result 1279 states and 1421 transitions. [2025-03-09 02:27:24,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 02:27:24,029 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 14.666666666666666) internal successors, (132), 9 states have internal predecessors, (132), 8 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) Word has length 111 [2025-03-09 02:27:24,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:27:24,032 INFO L225 Difference]: With dead ends: 1279 [2025-03-09 02:27:24,032 INFO L226 Difference]: Without dead ends: 1125 [2025-03-09 02:27:24,033 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 216 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-03-09 02:27:24,033 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 39 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:27:24,033 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 217 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:27:24,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1125 states. [2025-03-09 02:27:24,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1125 to 1121. [2025-03-09 02:27:24,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1121 states, 1055 states have (on average 1.0597156398104266) internal successors, (1118), 1058 states have internal predecessors, (1118), 60 states have call successors, (60), 2 states have call predecessors, (60), 2 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2025-03-09 02:27:24,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1121 states to 1121 states and 1238 transitions. [2025-03-09 02:27:24,071 INFO L78 Accepts]: Start accepts. Automaton has 1121 states and 1238 transitions. Word has length 111 [2025-03-09 02:27:24,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:27:24,072 INFO L471 AbstractCegarLoop]: Abstraction has 1121 states and 1238 transitions. [2025-03-09 02:27:24,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.666666666666666) internal successors, (132), 9 states have internal predecessors, (132), 8 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2025-03-09 02:27:24,072 INFO L276 IsEmpty]: Start isEmpty. Operand 1121 states and 1238 transitions. [2025-03-09 02:27:24,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-09 02:27:24,073 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:27:24,073 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:27:24,079 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-09 02:27:24,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:27:24,274 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-03-09 02:27:24,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:27:24,274 INFO L85 PathProgramCache]: Analyzing trace with hash 412288807, now seen corresponding path program 1 times [2025-03-09 02:27:24,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:27:24,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424449470] [2025-03-09 02:27:24,274 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:27:24,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:27:24,279 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-09 02:27:24,283 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-09 02:27:24,284 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:27:24,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:27:24,368 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 0 proven. 170 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2025-03-09 02:27:24,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:27:24,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424449470] [2025-03-09 02:27:24,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424449470] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:27:24,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1465394978] [2025-03-09 02:27:24,369 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:27:24,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:27:24,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:27:24,371 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:27:24,372 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-03-09 02:27:24,395 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-09 02:27:24,414 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-09 02:27:24,414 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:27:24,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:27:24,415 INFO L256 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-09 02:27:24,417 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:27:24,504 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 0 proven. 170 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2025-03-09 02:27:24,504 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:27:24,633 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 0 proven. 170 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2025-03-09 02:27:24,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1465394978] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:27:24,633 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:27:24,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-03-09 02:27:24,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347111961] [2025-03-09 02:27:24,633 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:27:24,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-09 02:27:24,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:27:24,634 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-09 02:27:24,634 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-09 02:27:24,635 INFO L87 Difference]: Start difference. First operand 1121 states and 1238 transitions. Second operand has 13 states, 12 states have (on average 16.416666666666668) internal successors, (197), 13 states have internal predecessors, (197), 12 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 12 states have call predecessors, (13), 12 states have call successors, (13) [2025-03-09 02:27:24,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:27:24,788 INFO L93 Difference]: Finished difference Result 2262 states and 2558 transitions. [2025-03-09 02:27:24,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-09 02:27:24,789 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 16.416666666666668) internal successors, (197), 13 states have internal predecessors, (197), 12 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 12 states have call predecessors, (13), 12 states have call successors, (13) Word has length 123 [2025-03-09 02:27:24,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:27:24,794 INFO L225 Difference]: With dead ends: 2262 [2025-03-09 02:27:24,794 INFO L226 Difference]: Without dead ends: 2261 [2025-03-09 02:27:24,795 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 239 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-09 02:27:24,796 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 14 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:27:24,796 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 162 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:27:24,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2261 states. [2025-03-09 02:27:24,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2261 to 2261. [2025-03-09 02:27:24,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2261 states, 2135 states have (on average 1.0576112412177987) internal successors, (2258), 2138 states have internal predecessors, (2258), 120 states have call successors, (120), 2 states have call predecessors, (120), 2 states have return successors, (120), 120 states have call predecessors, (120), 120 states have call successors, (120) [2025-03-09 02:27:24,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2261 states to 2261 states and 2498 transitions. [2025-03-09 02:27:24,888 INFO L78 Accepts]: Start accepts. Automaton has 2261 states and 2498 transitions. Word has length 123 [2025-03-09 02:27:24,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:27:24,888 INFO L471 AbstractCegarLoop]: Abstraction has 2261 states and 2498 transitions. [2025-03-09 02:27:24,889 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 16.416666666666668) internal successors, (197), 13 states have internal predecessors, (197), 12 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 12 states have call predecessors, (13), 12 states have call successors, (13) [2025-03-09 02:27:24,889 INFO L276 IsEmpty]: Start isEmpty. Operand 2261 states and 2498 transitions. [2025-03-09 02:27:24,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-09 02:27:24,890 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:27:24,890 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:27:24,899 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2025-03-09 02:27:25,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-03-09 02:27:25,090 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-03-09 02:27:25,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:27:25,091 INFO L85 PathProgramCache]: Analyzing trace with hash 1833130828, now seen corresponding path program 2 times [2025-03-09 02:27:25,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:27:25,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410511436] [2025-03-09 02:27:25,091 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 02:27:25,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:27:25,095 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 134 statements into 2 equivalence classes. [2025-03-09 02:27:25,100 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 134 of 134 statements. [2025-03-09 02:27:25,100 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 02:27:25,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:27:25,184 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 68 proven. 128 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2025-03-09 02:27:25,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:27:25,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410511436] [2025-03-09 02:27:25,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410511436] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:27:25,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1765975068] [2025-03-09 02:27:25,184 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 02:27:25,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:27:25,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:27:25,187 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:27:25,187 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2025-03-09 02:27:25,211 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 134 statements into 2 equivalence classes. [2025-03-09 02:27:25,230 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 134 of 134 statements. [2025-03-09 02:27:25,230 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 02:27:25,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:27:25,231 INFO L256 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-09 02:27:25,233 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:27:25,438 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 231 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 02:27:25,438 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:27:25,626 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 191 proven. 5 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2025-03-09 02:27:25,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1765975068] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:27:25,626 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:27:25,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 13, 14] total 20 [2025-03-09 02:27:25,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007299962] [2025-03-09 02:27:25,626 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:27:25,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-09 02:27:25,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:27:25,627 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-09 02:27:25,627 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2025-03-09 02:27:25,627 INFO L87 Difference]: Start difference. First operand 2261 states and 2498 transitions. Second operand has 20 states, 20 states have (on average 11.0) internal successors, (220), 20 states have internal predecessors, (220), 12 states have call successors, (21), 7 states have call predecessors, (21), 7 states have return successors, (21), 12 states have call predecessors, (21), 12 states have call successors, (21) [2025-03-09 02:27:26,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:27:26,665 INFO L93 Difference]: Finished difference Result 2397 states and 2634 transitions. [2025-03-09 02:27:26,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2025-03-09 02:27:26,666 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 11.0) internal successors, (220), 20 states have internal predecessors, (220), 12 states have call successors, (21), 7 states have call predecessors, (21), 7 states have return successors, (21), 12 states have call predecessors, (21), 12 states have call successors, (21) Word has length 134 [2025-03-09 02:27:26,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:27:26,666 INFO L225 Difference]: With dead ends: 2397 [2025-03-09 02:27:26,666 INFO L226 Difference]: Without dead ends: 0 [2025-03-09 02:27:26,669 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 245 SyntacticMatches, 11 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1684 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1148, Invalid=4552, Unknown=0, NotChecked=0, Total=5700 [2025-03-09 02:27:26,669 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 139 mSDsluCounter, 752 mSDsCounter, 0 mSdLazyCounter, 1545 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 847 SdHoareTripleChecker+Invalid, 1547 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1545 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-09 02:27:26,670 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 847 Invalid, 1547 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1545 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-09 02:27:26,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-09 02:27:26,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-09 02:27:26,670 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-09 02:27:26,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-09 02:27:26,670 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 134 [2025-03-09 02:27:26,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:27:26,670 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-09 02:27:26,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 11.0) internal successors, (220), 20 states have internal predecessors, (220), 12 states have call successors, (21), 7 states have call predecessors, (21), 7 states have return successors, (21), 12 states have call predecessors, (21), 12 states have call successors, (21) [2025-03-09 02:27:26,670 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-09 02:27:26,671 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-09 02:27:26,676 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 22 remaining) [2025-03-09 02:27:26,676 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 22 remaining) [2025-03-09 02:27:26,676 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 22 remaining) [2025-03-09 02:27:26,676 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 22 remaining) [2025-03-09 02:27:26,676 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 22 remaining) [2025-03-09 02:27:26,676 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 22 remaining) [2025-03-09 02:27:26,676 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 22 remaining) [2025-03-09 02:27:26,676 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 22 remaining) [2025-03-09 02:27:26,676 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 22 remaining) [2025-03-09 02:27:26,676 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 22 remaining) [2025-03-09 02:27:26,677 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 22 remaining) [2025-03-09 02:27:26,677 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 22 remaining) [2025-03-09 02:27:26,677 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 22 remaining) [2025-03-09 02:27:26,677 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 22 remaining) [2025-03-09 02:27:26,677 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 22 remaining) [2025-03-09 02:27:26,677 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 22 remaining) [2025-03-09 02:27:26,677 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 22 remaining) [2025-03-09 02:27:26,677 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 22 remaining) [2025-03-09 02:27:26,677 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 22 remaining) [2025-03-09 02:27:26,677 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 22 remaining) [2025-03-09 02:27:26,677 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 22 remaining) [2025-03-09 02:27:26,677 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 22 remaining) [2025-03-09 02:27:26,683 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2025-03-09 02:27:26,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2025-03-09 02:27:26,880 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:27:26,881 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-09 02:27:28,761 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-09 02:27:28,789 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.03 02:27:28 BoogieIcfgContainer [2025-03-09 02:27:28,792 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-09 02:27:28,793 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-09 02:27:28,795 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-09 02:27:28,795 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-09 02:27:28,796 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 02:27:10" (3/4) ... [2025-03-09 02:27:28,797 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-09 02:27:28,805 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2025-03-09 02:27:28,805 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2025-03-09 02:27:28,808 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2025-03-09 02:27:28,809 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-09 02:27:28,809 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-09 02:27:28,809 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-09 02:27:28,878 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-09 02:27:28,879 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-09 02:27:28,879 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-09 02:27:28,880 INFO L158 Benchmark]: Toolchain (without parser) took 19322.20ms. Allocated memory was 142.6MB in the beginning and 444.6MB in the end (delta: 302.0MB). Free memory was 108.6MB in the beginning and 405.6MB in the end (delta: -297.0MB). Peak memory consumption was 250.9MB. Max. memory is 16.1GB. [2025-03-09 02:27:28,880 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 116.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 02:27:28,880 INFO L158 Benchmark]: CACSL2BoogieTranslator took 171.01ms. Allocated memory is still 142.6MB. Free memory was 108.6MB in the beginning and 97.6MB in the end (delta: 11.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 02:27:28,880 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.88ms. Allocated memory is still 142.6MB. Free memory was 97.6MB in the beginning and 96.3MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 02:27:28,880 INFO L158 Benchmark]: Boogie Preprocessor took 29.16ms. Allocated memory is still 142.6MB. Free memory was 96.3MB in the beginning and 95.1MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 02:27:28,880 INFO L158 Benchmark]: IcfgBuilder took 325.50ms. Allocated memory is still 142.6MB. Free memory was 95.1MB in the beginning and 80.9MB in the end (delta: 14.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-09 02:27:28,881 INFO L158 Benchmark]: TraceAbstraction took 18672.84ms. Allocated memory was 142.6MB in the beginning and 444.6MB in the end (delta: 302.0MB). Free memory was 80.2MB in the beginning and 162.2MB in the end (delta: -82.0MB). Peak memory consumption was 225.4MB. Max. memory is 16.1GB. [2025-03-09 02:27:28,881 INFO L158 Benchmark]: Witness Printer took 85.91ms. Allocated memory is still 444.6MB. Free memory was 162.2MB in the beginning and 405.6MB in the end (delta: -243.4MB). Peak memory consumption was 8.5MB. Max. memory is 16.1GB. [2025-03-09 02:27:28,884 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.18ms. Allocated memory is still 201.3MB. Free memory is still 116.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 171.01ms. Allocated memory is still 142.6MB. Free memory was 108.6MB in the beginning and 97.6MB in the end (delta: 11.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 23.88ms. Allocated memory is still 142.6MB. Free memory was 97.6MB in the beginning and 96.3MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 29.16ms. Allocated memory is still 142.6MB. Free memory was 96.3MB in the beginning and 95.1MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 325.50ms. Allocated memory is still 142.6MB. Free memory was 95.1MB in the beginning and 80.9MB in the end (delta: 14.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 18672.84ms. Allocated memory was 142.6MB in the beginning and 444.6MB in the end (delta: 302.0MB). Free memory was 80.2MB in the beginning and 162.2MB in the end (delta: -82.0MB). Peak memory consumption was 225.4MB. Max. memory is 16.1GB. * Witness Printer took 85.91ms. Allocated memory is still 444.6MB. Free memory was 162.2MB in the beginning and 405.6MB in the end (delta: -243.4MB). Peak memory consumption was 8.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 50]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 50]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 50]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 50]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 44]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 44]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 42]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 42]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 47]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 47]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 41]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 41]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 69 locations, 80 edges, 22 error locations. Started 1 CEGAR loops. OverallTime: 16.7s, OverallIterations: 25, TraceHistogramMax: 6, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 5.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2118 SdHoareTripleChecker+Valid, 2.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2105 mSDsluCounter, 4531 SdHoareTripleChecker+Invalid, 2.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3390 mSDsCounter, 189 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4632 IncrementalHoareTripleChecker+Invalid, 4821 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 189 mSolverCounterUnsat, 1141 mSDtfsCounter, 4632 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2549 GetRequests, 2192 SyntacticMatches, 21 SemanticMatches, 336 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3947 ImplicationChecksByTransitivity, 2.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2261occurred in iteration=24, InterpolantAutomatonStates: 282, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 25 MinimizatonAttempts, 568 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 5.5s InterpolantComputationTime, 2730 NumberOfCodeBlocks, 2730 NumberOfCodeBlocksAsserted, 54 NumberOfCheckSat, 3386 ConstructedInterpolants, 7 QuantifiedInterpolants, 11560 SizeOfPredicates, 30 NumberOfNonLiveVariables, 2665 ConjunctsInSsa, 144 ConjunctsInUnsatCore, 51 InterpolantComputations, 10 PerfectInterpolantSequences, 1907/3489 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 22 specifications checked. All of them hold - InvariantResult [Line: 36]: Location Invariant Derived location invariant: (((((((((((((((((((((((((((((0 <= x1) && (((long long) x2 + y3) <= 2147483646)) && (2 <= x2)) && (y1 == 1)) && (y2 == 1)) && (counter <= 5)) && (x1 <= 2147483647)) && (x2 <= 1073741823)) && (3 <= counter)) && (0 <= y3)) || (((((((((0 <= x1) && (y2 == 0)) && (y1 == 1)) && (((long long) x2 + y3) <= 2147483647)) && (3 <= x2)) && (counter <= 5)) && (x1 <= 2147483647)) && (3 <= counter)) && (0 <= y3))) || (((((((x2 <= 2147483647) && (y2 == 0)) && (x1 == y3)) && (y1 == 0)) && (counter == 0)) && (x1 <= 2147483647)) && (0 <= y3))) || (((((((((((0 <= x1) && (x2 == 1)) && (y2 == 0)) && (counter <= 5)) && (x1 <= ((long long) 2147483645 + y3))) && (4 <= counter)) && (y1 <= 2147483643)) && (x1 <= 2147483647)) && (((long long) y1 + y3) <= 2147483647)) && (1 <= y1)) && (0 <= y3))) || (((((((((0 <= x1) && (2 <= counter)) && (2 == y1)) && (x2 == 1)) && (y2 == 0)) && (x1 <= ((long long) 2 + y3))) && (counter <= 5)) && (y3 <= 2147483645)) && (0 <= y3))) || ((((((((0 <= x1) && (((long long) x2 + y3) <= 2147483645)) && (2 == y2)) && (counter == 5)) && (y1 == 1)) && (3 <= x2)) && (x1 <= 2147483647)) && (0 <= y3))) || ((((((((((0 <= x1) && (x2 == 1)) && (x1 <= ((long long) y3 + 2147483646))) && (counter == 5)) && (y2 == 0)) && (y1 <= 2147483644)) && (x1 <= 2147483647)) && (((long long) y1 + y3) <= 2147483647)) && (1 <= y1)) && (0 <= y3))) || (((((((((((0 <= x1) && (x2 == 1)) && (y2 == 0)) && (counter <= 5)) && (x1 <= ((long long) y3 + 2147483644))) && (x1 <= 2147483647)) && (((long long) y1 + y3) <= 2147483647)) && (3 <= counter)) && (1 <= y1)) && (y1 <= 3)) && (0 <= y3))) || ((((((((((0 <= x1) && (2 <= counter)) && (2 <= x2)) && (y2 == 0)) && (y1 == 1)) && (((long long) x2 + y3) <= 2147483647)) && (x1 <= ((long long) 2 + y3))) && (counter <= 5)) && (x2 <= 1073741823)) && (0 <= y3))) || ((((((((((0 <= x1) && (2 <= x2)) && (((long long) x2 + y3) <= 2147483645)) && (2 == y2)) && (y1 == 1)) && (counter <= 5)) && (4 <= counter)) && (x1 <= 2147483647)) && (x2 <= 1073741823)) && (0 <= y3))) || (((((((((0 <= x1) && (x2 <= 2147483647)) && (x1 <= ((long long) y3 + 1))) && (y2 == 1)) && (y1 == 0)) && (1 <= counter)) && (counter <= 5)) && (y3 <= 2147483646)) && (0 <= y3))) || (((((((((0 <= x1) && (2 <= counter)) && (2 == y2)) && (x2 <= 2147483647)) && (y1 == 0)) && (x1 <= ((long long) 2 + y3))) && (counter <= 5)) && (y3 <= 2147483645)) && (0 <= y3))) || (((((((((0 <= x1) && (2 <= x2)) && (counter == 5)) && (y2 == 1)) && ((((long long) x2 * y1) + y3) <= 2147483646)) && (x1 <= 2147483647)) && (y1 <= 2)) && (1 <= y1)) && (0 <= y3))) || (((((((((0 <= x1) && (((long long) x2 + y3) <= 2147483646)) && (y1 == 1)) && (y2 == 1)) && (3 <= x2)) && (counter <= 5)) && (4 <= counter)) && (x1 <= 2147483647)) && (0 <= y3))) || (((((((((((0 <= x1) && (y3 <= 2147483647)) && (x2 <= 2147483647)) && (2 <= y2)) && (y1 == 0)) && (counter <= 5)) && (y2 <= 4)) && (((long long) y2 + y3) <= 2147483647)) && (4 <= counter)) && (x1 <= 2147483647)) && (0 <= y3))) || (((((((((0 <= x1) && (x2 <= 2147483647)) && (counter == 5)) && (y2 <= 2147483642)) && (2 <= y2)) && (y1 == 0)) && (((long long) y2 + y3) <= 2147483647)) && (x1 <= 2147483647)) && (0 <= y3))) || (((((((((((0 <= x1) && (y3 <= 2147483647)) && (x2 <= 2147483647)) && (2 <= y2)) && (y1 == 0)) && (counter <= 5)) && (y2 <= 3)) && (((long long) y2 + y3) <= 2147483647)) && (x1 <= 2147483647)) && (3 <= counter)) && (0 <= y3))) || ((((((((((0 <= x1) && (2 <= x2)) && (y2 == 0)) && ((((long long) x2 * y1) + y3) <= 2147483647)) && (counter <= 5)) && (4 <= counter)) && (x1 <= 2147483647)) && (y1 <= 2)) && (1 <= y1)) && (0 <= y3))) || ((((((((((0 <= x1) && (2 <= x2)) && (counter == 5)) && (y1 == 1)) && (2 <= y2)) && ((((long long) x2 + y2) + y3) <= 2147483647)) && (y2 <= 3)) && (x1 <= 2147483647)) && (x2 <= 1073741823)) && (0 <= y3))) || (((((((((0 <= x1) && (x2 == 1)) && (y2 == 0)) && (y1 == 1)) && (x1 <= ((long long) y3 + 1))) && (1 <= counter)) && (counter <= 5)) && (y3 <= 2147483646)) && (0 <= y3))) RESULT: Ultimate proved your program to be correct! [2025-03-09 02:27:28,905 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