./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/termination-nla/cohencu4-both-nt.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/termination-nla/cohencu4-both-nt.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 7fd13595f3b5096b42d3b96a25fd9abd33fd3af5374ed62e7f19833538fa3307 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 10:36:16,095 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 10:36:16,149 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-04 10:36:16,155 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 10:36:16,156 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 10:36:16,174 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 10:36:16,175 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 10:36:16,175 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 10:36:16,176 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 10:36:16,176 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 10:36:16,177 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 10:36:16,177 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 10:36:16,177 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 10:36:16,177 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 10:36:16,177 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 10:36:16,178 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 10:36:16,178 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 10:36:16,178 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 10:36:16,178 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 10:36:16,178 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 10:36:16,178 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 10:36:16,178 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 10:36:16,178 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 10:36:16,178 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 10:36:16,178 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 10:36:16,179 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 10:36:16,179 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 10:36:16,179 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 10:36:16,179 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 10:36:16,179 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 10:36:16,179 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 10:36:16,179 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 10:36:16,179 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 10:36:16,179 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 10:36:16,179 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:36:16,179 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 10:36:16,179 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 10:36:16,180 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 10:36:16,180 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 10:36:16,180 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 10:36:16,180 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 10:36:16,180 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 10:36:16,180 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 10:36:16,180 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 10:36:16,180 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 10:36:16,180 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 -> 7fd13595f3b5096b42d3b96a25fd9abd33fd3af5374ed62e7f19833538fa3307 [2025-03-04 10:36:16,406 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 10:36:16,413 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 10:36:16,415 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 10:36:16,416 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 10:36:16,416 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 10:36:16,418 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-nla/cohencu4-both-nt.c [2025-03-04 10:36:17,583 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f6b8522f7/b8b7801cf2b64d8bac753f12119b733c/FLAGe82f6c903 [2025-03-04 10:36:17,883 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 10:36:17,884 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-nla/cohencu4-both-nt.c [2025-03-04 10:36:17,892 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f6b8522f7/b8b7801cf2b64d8bac753f12119b733c/FLAGe82f6c903 [2025-03-04 10:36:18,184 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f6b8522f7/b8b7801cf2b64d8bac753f12119b733c [2025-03-04 10:36:18,186 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 10:36:18,187 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 10:36:18,188 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 10:36:18,188 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 10:36:18,191 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 10:36:18,192 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:36:18" (1/1) ... [2025-03-04 10:36:18,193 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3791954f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:36:18, skipping insertion in model container [2025-03-04 10:36:18,193 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:36:18" (1/1) ... [2025-03-04 10:36:18,205 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 10:36:18,306 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:36:18,309 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 10:36:18,317 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:36:18,326 INFO L204 MainTranslator]: Completed translation [2025-03-04 10:36:18,326 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:36:18 WrapperNode [2025-03-04 10:36:18,326 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 10:36:18,327 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 10:36:18,327 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 10:36:18,327 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 10:36:18,331 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:36:18" (1/1) ... [2025-03-04 10:36:18,333 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:36:18" (1/1) ... [2025-03-04 10:36:18,342 INFO L138 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 48 [2025-03-04 10:36:18,343 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 10:36:18,343 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 10:36:18,343 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 10:36:18,343 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 10:36:18,348 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:36:18" (1/1) ... [2025-03-04 10:36:18,349 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:36:18" (1/1) ... [2025-03-04 10:36:18,349 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:36:18" (1/1) ... [2025-03-04 10:36:18,352 INFO L175 MemorySlicer]: No memory access in input program. [2025-03-04 10:36:18,352 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:36:18" (1/1) ... [2025-03-04 10:36:18,353 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:36:18" (1/1) ... [2025-03-04 10:36:18,354 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:36:18" (1/1) ... [2025-03-04 10:36:18,354 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:36:18" (1/1) ... [2025-03-04 10:36:18,354 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:36:18" (1/1) ... [2025-03-04 10:36:18,355 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:36:18" (1/1) ... [2025-03-04 10:36:18,355 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 10:36:18,356 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 10:36:18,356 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 10:36:18,356 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 10:36:18,357 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:36:18" (1/1) ... [2025-03-04 10:36:18,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:36:18,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:36:18,384 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 10:36:18,389 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 10:36:18,404 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 10:36:18,404 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 10:36:18,438 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 10:36:18,440 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 10:36:18,625 INFO L? ?]: Removed 52 outVars from TransFormulas that were not future-live. [2025-03-04 10:36:18,625 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 10:36:18,632 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 10:36:18,633 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 10:36:18,633 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:36:18 BoogieIcfgContainer [2025-03-04 10:36:18,633 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 10:36:18,635 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 10:36:18,635 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 10:36:18,638 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 10:36:18,638 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 10:36:18" (1/3) ... [2025-03-04 10:36:18,638 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bd10b1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:36:18, skipping insertion in model container [2025-03-04 10:36:18,639 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:36:18" (2/3) ... [2025-03-04 10:36:18,639 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bd10b1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:36:18, skipping insertion in model container [2025-03-04 10:36:18,639 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:36:18" (3/3) ... [2025-03-04 10:36:18,640 INFO L128 eAbstractionObserver]: Analyzing ICFG cohencu4-both-nt.c [2025-03-04 10:36:18,649 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 10:36:18,651 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG cohencu4-both-nt.c that has 1 procedures, 55 locations, 1 initial locations, 1 loop locations, and 24 error locations. [2025-03-04 10:36:18,684 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 10:36:18,692 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;@77326ccf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 10:36:18,692 INFO L334 AbstractCegarLoop]: Starting to check reachability of 24 error locations. [2025-03-04 10:36:18,695 INFO L276 IsEmpty]: Start isEmpty. Operand has 55 states, 30 states have (on average 1.8666666666666667) internal successors, (56), 54 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:36:18,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-03-04 10:36:18,701 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:36:18,702 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-03-04 10:36:18,703 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-03-04 10:36:18,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:36:18,707 INFO L85 PathProgramCache]: Analyzing trace with hash 84372, now seen corresponding path program 1 times [2025-03-04 10:36:18,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:36:18,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136621933] [2025-03-04 10:36:18,712 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:36:18,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:36:18,761 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 10:36:18,768 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 10:36:18,769 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:36:18,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:36:18,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [839510236] [2025-03-04 10:36:18,771 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:36:18,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:36:18,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:36:18,774 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:36:18,776 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 10:36:18,805 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 10:36:18,811 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 10:36:18,811 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:36:18,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:36:18,813 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 10:36:18,815 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:36:18,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:36:18,858 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:36:18,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:36:18,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136621933] [2025-03-04 10:36:18,859 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:36:18,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [839510236] [2025-03-04 10:36:18,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [839510236] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:36:18,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:36:18,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:36:18,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380719135] [2025-03-04 10:36:18,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:36:18,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:36:18,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:36:18,881 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:36:18,882 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:36:18,883 INFO L87 Difference]: Start difference. First operand has 55 states, 30 states have (on average 1.8666666666666667) internal successors, (56), 54 states have internal predecessors, (56), 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) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:36:18,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:36:18,991 INFO L93 Difference]: Finished difference Result 94 states and 106 transitions. [2025-03-04 10:36:18,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:36:18,993 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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) Word has length 3 [2025-03-04 10:36:18,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:36:18,997 INFO L225 Difference]: With dead ends: 94 [2025-03-04 10:36:18,998 INFO L226 Difference]: Without dead ends: 78 [2025-03-04 10:36:18,999 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:36:19,001 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 26 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:36:19,002 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 36 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:36:19,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2025-03-04 10:36:19,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 74. [2025-03-04 10:36:19,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 50 states have (on average 1.76) internal successors, (88), 73 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:36:19,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 88 transitions. [2025-03-04 10:36:19,030 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 88 transitions. Word has length 3 [2025-03-04 10:36:19,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:36:19,031 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 88 transitions. [2025-03-04 10:36:19,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:36:19,031 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 88 transitions. [2025-03-04 10:36:19,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-04 10:36:19,031 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:36:19,031 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-04 10:36:19,037 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 10:36:19,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-04 10:36:19,232 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-03-04 10:36:19,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:36:19,233 INFO L85 PathProgramCache]: Analyzing trace with hash 81082098, now seen corresponding path program 1 times [2025-03-04 10:36:19,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:36:19,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474400727] [2025-03-04 10:36:19,233 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:36:19,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:36:19,236 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 10:36:19,239 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 10:36:19,239 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:36:19,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:36:19,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:36:19,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:36:19,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474400727] [2025-03-04 10:36:19,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474400727] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:36:19,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:36:19,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:36:19,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713626733] [2025-03-04 10:36:19,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:36:19,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:36:19,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:36:19,265 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:36:19,265 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:36:19,265 INFO L87 Difference]: Start difference. First operand 74 states and 88 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:36:19,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:36:19,315 INFO L93 Difference]: Finished difference Result 77 states and 88 transitions. [2025-03-04 10:36:19,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:36:19,315 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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) Word has length 5 [2025-03-04 10:36:19,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:36:19,319 INFO L225 Difference]: With dead ends: 77 [2025-03-04 10:36:19,319 INFO L226 Difference]: Without dead ends: 76 [2025-03-04 10:36:19,319 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:36:19,320 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 20 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:36:19,320 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 52 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:36:19,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2025-03-04 10:36:19,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 74. [2025-03-04 10:36:19,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 50 states have (on average 1.74) internal successors, (87), 73 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:36:19,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 87 transitions. [2025-03-04 10:36:19,324 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 87 transitions. Word has length 5 [2025-03-04 10:36:19,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:36:19,325 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 87 transitions. [2025-03-04 10:36:19,325 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:36:19,325 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 87 transitions. [2025-03-04 10:36:19,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-04 10:36:19,325 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:36:19,325 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-04 10:36:19,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 10:36:19,326 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-03-04 10:36:19,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:36:19,326 INFO L85 PathProgramCache]: Analyzing trace with hash -1781422243, now seen corresponding path program 1 times [2025-03-04 10:36:19,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:36:19,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159488243] [2025-03-04 10:36:19,326 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:36:19,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:36:19,329 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 10:36:19,331 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 10:36:19,331 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:36:19,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:36:19,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:36:19,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:36:19,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159488243] [2025-03-04 10:36:19,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159488243] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:36:19,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:36:19,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:36:19,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459336577] [2025-03-04 10:36:19,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:36:19,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:36:19,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:36:19,346 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:36:19,346 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:36:19,347 INFO L87 Difference]: Start difference. First operand 74 states and 87 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:36:19,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:36:19,398 INFO L93 Difference]: Finished difference Result 77 states and 87 transitions. [2025-03-04 10:36:19,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:36:19,398 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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) Word has length 6 [2025-03-04 10:36:19,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:36:19,400 INFO L225 Difference]: With dead ends: 77 [2025-03-04 10:36:19,400 INFO L226 Difference]: Without dead ends: 76 [2025-03-04 10:36:19,400 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:36:19,401 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 19 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:36:19,402 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 53 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:36:19,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2025-03-04 10:36:19,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 74. [2025-03-04 10:36:19,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 50 states have (on average 1.72) internal successors, (86), 73 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:36:19,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 86 transitions. [2025-03-04 10:36:19,408 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 86 transitions. Word has length 6 [2025-03-04 10:36:19,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:36:19,408 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 86 transitions. [2025-03-04 10:36:19,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:36:19,408 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 86 transitions. [2025-03-04 10:36:19,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-04 10:36:19,408 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:36:19,408 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:36:19,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 10:36:19,408 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-03-04 10:36:19,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:36:19,409 INFO L85 PathProgramCache]: Analyzing trace with hash 610485328, now seen corresponding path program 1 times [2025-03-04 10:36:19,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:36:19,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341716241] [2025-03-04 10:36:19,409 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:36:19,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:36:19,412 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 10:36:19,415 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 10:36:19,420 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:36:19,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:36:19,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:36:19,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:36:19,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341716241] [2025-03-04 10:36:19,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341716241] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:36:19,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:36:19,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:36:19,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258010620] [2025-03-04 10:36:19,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:36:19,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:36:19,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:36:19,469 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:36:19,470 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:36:19,470 INFO L87 Difference]: Start difference. First operand 74 states and 86 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:36:19,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:36:19,614 INFO L93 Difference]: Finished difference Result 77 states and 86 transitions. [2025-03-04 10:36:19,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:36:19,614 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 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) Word has length 7 [2025-03-04 10:36:19,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:36:19,615 INFO L225 Difference]: With dead ends: 77 [2025-03-04 10:36:19,615 INFO L226 Difference]: Without dead ends: 76 [2025-03-04 10:36:19,615 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-04 10:36:19,615 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 57 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:36:19,616 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 37 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:36:19,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2025-03-04 10:36:19,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 74. [2025-03-04 10:36:19,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 50 states have (on average 1.7) internal successors, (85), 73 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:36:19,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 85 transitions. [2025-03-04 10:36:19,622 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 85 transitions. Word has length 7 [2025-03-04 10:36:19,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:36:19,623 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 85 transitions. [2025-03-04 10:36:19,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:36:19,623 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 85 transitions. [2025-03-04 10:36:19,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-04 10:36:19,623 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:36:19,623 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:36:19,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 10:36:19,623 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-03-04 10:36:19,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:36:19,624 INFO L85 PathProgramCache]: Analyzing trace with hash 1745175995, now seen corresponding path program 1 times [2025-03-04 10:36:19,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:36:19,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986066447] [2025-03-04 10:36:19,624 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:36:19,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:36:19,628 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 10:36:19,634 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 10:36:19,634 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:36:19,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:36:19,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:36:19,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:36:19,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986066447] [2025-03-04 10:36:19,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986066447] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:36:19,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:36:19,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:36:19,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418011093] [2025-03-04 10:36:19,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:36:19,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:36:19,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:36:19,686 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:36:19,687 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:36:19,687 INFO L87 Difference]: Start difference. First operand 74 states and 85 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:36:19,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:36:19,833 INFO L93 Difference]: Finished difference Result 77 states and 85 transitions. [2025-03-04 10:36:19,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:36:19,833 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), 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) Word has length 8 [2025-03-04 10:36:19,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:36:19,834 INFO L225 Difference]: With dead ends: 77 [2025-03-04 10:36:19,834 INFO L226 Difference]: Without dead ends: 76 [2025-03-04 10:36:19,834 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-04 10:36:19,835 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 55 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:36:19,835 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 38 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:36:19,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2025-03-04 10:36:19,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 74. [2025-03-04 10:36:19,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 50 states have (on average 1.68) internal successors, (84), 73 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:36:19,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 84 transitions. [2025-03-04 10:36:19,840 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 84 transitions. Word has length 8 [2025-03-04 10:36:19,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:36:19,840 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 84 transitions. [2025-03-04 10:36:19,840 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:36:19,840 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 84 transitions. [2025-03-04 10:36:19,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-04 10:36:19,840 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:36:19,840 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:36:19,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 10:36:19,841 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-03-04 10:36:19,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:36:19,842 INFO L85 PathProgramCache]: Analyzing trace with hash -41042164, now seen corresponding path program 1 times [2025-03-04 10:36:19,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:36:19,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445950932] [2025-03-04 10:36:19,842 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:36:19,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:36:19,846 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 10:36:19,851 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 10:36:19,852 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:36:19,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:36:19,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [16670540] [2025-03-04 10:36:19,852 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:36:19,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:36:19,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:36:19,854 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:36:19,855 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 10:36:19,870 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 10:36:19,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 10:36:19,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:36:19,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:36:19,873 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 10:36:19,874 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:36:19,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:36:19,953 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:36:19,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:36:19,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445950932] [2025-03-04 10:36:19,953 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:36:19,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [16670540] [2025-03-04 10:36:19,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [16670540] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:36:19,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:36:19,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:36:19,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207232534] [2025-03-04 10:36:19,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:36:19,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:36:19,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:36:19,954 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:36:19,954 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:36:19,955 INFO L87 Difference]: Start difference. First operand 74 states and 84 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:36:20,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:36:20,047 INFO L93 Difference]: Finished difference Result 80 states and 84 transitions. [2025-03-04 10:36:20,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:36:20,047 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), 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) Word has length 11 [2025-03-04 10:36:20,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:36:20,047 INFO L225 Difference]: With dead ends: 80 [2025-03-04 10:36:20,047 INFO L226 Difference]: Without dead ends: 76 [2025-03-04 10:36:20,048 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:36:20,048 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 14 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:36:20,048 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 33 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:36:20,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2025-03-04 10:36:20,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 74. [2025-03-04 10:36:20,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 50 states have (on average 1.6) internal successors, (80), 73 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:36:20,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 80 transitions. [2025-03-04 10:36:20,055 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 80 transitions. Word has length 11 [2025-03-04 10:36:20,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:36:20,055 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 80 transitions. [2025-03-04 10:36:20,055 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:36:20,055 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 80 transitions. [2025-03-04 10:36:20,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-04 10:36:20,055 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:36:20,055 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:36:20,061 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 10:36:20,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-03-04 10:36:20,259 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-03-04 10:36:20,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:36:20,260 INFO L85 PathProgramCache]: Analyzing trace with hash -1272307081, now seen corresponding path program 1 times [2025-03-04 10:36:20,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:36:20,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623700549] [2025-03-04 10:36:20,260 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:36:20,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:36:20,263 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 10:36:20,265 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 10:36:20,268 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:36:20,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:36:20,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:36:20,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:36:20,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623700549] [2025-03-04 10:36:20,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1623700549] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:36:20,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:36:20,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:36:20,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373940101] [2025-03-04 10:36:20,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:36:20,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:36:20,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:36:20,320 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:36:20,320 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:36:20,320 INFO L87 Difference]: Start difference. First operand 74 states and 80 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:36:20,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:36:20,424 INFO L93 Difference]: Finished difference Result 77 states and 80 transitions. [2025-03-04 10:36:20,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:36:20,424 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 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) Word has length 12 [2025-03-04 10:36:20,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:36:20,424 INFO L225 Difference]: With dead ends: 77 [2025-03-04 10:36:20,424 INFO L226 Difference]: Without dead ends: 76 [2025-03-04 10:36:20,425 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-04 10:36:20,425 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 35 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:36:20,425 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 47 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:36:20,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2025-03-04 10:36:20,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 74. [2025-03-04 10:36:20,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 50 states have (on average 1.58) internal successors, (79), 73 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:36:20,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 79 transitions. [2025-03-04 10:36:20,429 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 79 transitions. Word has length 12 [2025-03-04 10:36:20,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:36:20,429 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 79 transitions. [2025-03-04 10:36:20,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:36:20,430 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 79 transitions. [2025-03-04 10:36:20,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-04 10:36:20,430 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:36:20,430 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:36:20,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 10:36:20,430 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-03-04 10:36:20,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:36:20,431 INFO L85 PathProgramCache]: Analyzing trace with hash 1960214323, now seen corresponding path program 1 times [2025-03-04 10:36:20,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:36:20,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472697267] [2025-03-04 10:36:20,431 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:36:20,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:36:20,434 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 10:36:20,439 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 10:36:20,441 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:36:20,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:36:20,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:36:20,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:36:20,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472697267] [2025-03-04 10:36:20,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472697267] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:36:20,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:36:20,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:36:20,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101947499] [2025-03-04 10:36:20,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:36:20,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:36:20,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:36:20,499 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:36:20,499 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:36:20,500 INFO L87 Difference]: Start difference. First operand 74 states and 79 transitions. Second operand has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:36:20,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:36:20,618 INFO L93 Difference]: Finished difference Result 77 states and 79 transitions. [2025-03-04 10:36:20,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:36:20,619 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), 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) Word has length 16 [2025-03-04 10:36:20,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:36:20,619 INFO L225 Difference]: With dead ends: 77 [2025-03-04 10:36:20,619 INFO L226 Difference]: Without dead ends: 75 [2025-03-04 10:36:20,619 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-04 10:36:20,620 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 39 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:36:20,620 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 34 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:36:20,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-03-04 10:36:20,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 73. [2025-03-04 10:36:20,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 50 states have (on average 1.52) internal successors, (76), 72 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:36:20,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 76 transitions. [2025-03-04 10:36:20,623 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 76 transitions. Word has length 16 [2025-03-04 10:36:20,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:36:20,623 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 76 transitions. [2025-03-04 10:36:20,623 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:36:20,623 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 76 transitions. [2025-03-04 10:36:20,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-04 10:36:20,624 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:36:20,624 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:36:20,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 10:36:20,624 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-03-04 10:36:20,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:36:20,624 INFO L85 PathProgramCache]: Analyzing trace with hash 441080815, now seen corresponding path program 1 times [2025-03-04 10:36:20,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:36:20,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053878530] [2025-03-04 10:36:20,624 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:36:20,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:36:20,628 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 10:36:20,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 10:36:20,634 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:36:20,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:36:20,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:36:20,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:36:20,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053878530] [2025-03-04 10:36:20,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053878530] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:36:20,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:36:20,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:36:20,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934976537] [2025-03-04 10:36:20,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:36:20,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:36:20,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:36:20,671 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:36:20,671 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:36:20,671 INFO L87 Difference]: Start difference. First operand 73 states and 76 transitions. Second operand has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:36:20,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:36:20,677 INFO L93 Difference]: Finished difference Result 73 states and 76 transitions. [2025-03-04 10:36:20,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:36:20,677 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 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) Word has length 20 [2025-03-04 10:36:20,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:36:20,678 INFO L225 Difference]: With dead ends: 73 [2025-03-04 10:36:20,678 INFO L226 Difference]: Without dead ends: 72 [2025-03-04 10:36:20,678 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:36:20,678 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 28 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:36:20,678 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 47 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:36:20,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2025-03-04 10:36:20,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2025-03-04 10:36:20,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 50 states have (on average 1.48) internal successors, (74), 71 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:36:20,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 74 transitions. [2025-03-04 10:36:20,682 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 74 transitions. Word has length 20 [2025-03-04 10:36:20,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:36:20,682 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 74 transitions. [2025-03-04 10:36:20,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:36:20,682 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 74 transitions. [2025-03-04 10:36:20,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-04 10:36:20,682 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:36:20,682 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:36:20,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 10:36:20,683 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-03-04 10:36:20,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:36:20,683 INFO L85 PathProgramCache]: Analyzing trace with hash 788603362, now seen corresponding path program 1 times [2025-03-04 10:36:20,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:36:20,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641990308] [2025-03-04 10:36:20,683 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:36:20,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:36:20,686 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 10:36:20,689 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 10:36:20,689 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:36:20,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:36:20,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:36:20,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:36:20,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641990308] [2025-03-04 10:36:20,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641990308] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:36:20,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:36:20,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:36:20,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502273547] [2025-03-04 10:36:20,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:36:20,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:36:20,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:36:20,714 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:36:20,715 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:36:20,715 INFO L87 Difference]: Start difference. First operand 72 states and 74 transitions. Second operand has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:36:20,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:36:20,725 INFO L93 Difference]: Finished difference Result 73 states and 74 transitions. [2025-03-04 10:36:20,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:36:20,726 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 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) Word has length 21 [2025-03-04 10:36:20,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:36:20,726 INFO L225 Difference]: With dead ends: 73 [2025-03-04 10:36:20,726 INFO L226 Difference]: Without dead ends: 72 [2025-03-04 10:36:20,726 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:36:20,727 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 0 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:36:20,727 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 92 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:36:20,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2025-03-04 10:36:20,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2025-03-04 10:36:20,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 50 states have (on average 1.46) internal successors, (73), 71 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:36:20,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 73 transitions. [2025-03-04 10:36:20,731 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 73 transitions. Word has length 21 [2025-03-04 10:36:20,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:36:20,731 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 73 transitions. [2025-03-04 10:36:20,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:36:20,731 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 73 transitions. [2025-03-04 10:36:20,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-04 10:36:20,732 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:36:20,732 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:36:20,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 10:36:20,732 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-03-04 10:36:20,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:36:20,732 INFO L85 PathProgramCache]: Analyzing trace with hash -1323099571, now seen corresponding path program 1 times [2025-03-04 10:36:20,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:36:20,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884433482] [2025-03-04 10:36:20,732 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:36:20,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:36:20,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 10:36:20,747 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 10:36:20,747 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:36:20,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:36:20,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:36:20,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:36:20,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884433482] [2025-03-04 10:36:20,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884433482] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:36:20,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:36:20,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:36:20,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186629725] [2025-03-04 10:36:20,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:36:20,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:36:20,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:36:20,774 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:36:20,775 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:36:20,775 INFO L87 Difference]: Start difference. First operand 72 states and 73 transitions. Second operand has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:36:20,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:36:20,825 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2025-03-04 10:36:20,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:36:20,825 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 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) Word has length 22 [2025-03-04 10:36:20,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:36:20,826 INFO L225 Difference]: With dead ends: 73 [2025-03-04 10:36:20,826 INFO L226 Difference]: Without dead ends: 72 [2025-03-04 10:36:20,826 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:36:20,826 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 1 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:36:20,826 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 44 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:36:20,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2025-03-04 10:36:20,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2025-03-04 10:36:20,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 50 states have (on average 1.44) internal successors, (72), 71 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:36:20,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2025-03-04 10:36:20,833 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 22 [2025-03-04 10:36:20,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:36:20,833 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2025-03-04 10:36:20,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:36:20,833 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2025-03-04 10:36:20,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-04 10:36:20,833 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:36:20,833 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:36:20,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 10:36:20,833 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-03-04 10:36:20,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:36:20,834 INFO L85 PathProgramCache]: Analyzing trace with hash -633719031, now seen corresponding path program 1 times [2025-03-04 10:36:20,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:36:20,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691784160] [2025-03-04 10:36:20,834 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:36:20,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:36:20,841 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-04 10:36:20,848 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 10:36:20,848 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:36:20,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:36:20,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:36:20,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:36:20,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691784160] [2025-03-04 10:36:20,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691784160] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:36:20,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:36:20,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:36:20,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032983995] [2025-03-04 10:36:20,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:36:20,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:36:20,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:36:20,870 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:36:20,871 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:36:20,871 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:36:20,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:36:20,920 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2025-03-04 10:36:20,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:36:20,920 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 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) Word has length 26 [2025-03-04 10:36:20,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:36:20,921 INFO L225 Difference]: With dead ends: 72 [2025-03-04 10:36:20,921 INFO L226 Difference]: Without dead ends: 70 [2025-03-04 10:36:20,921 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:36:20,922 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 8 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:36:20,922 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 18 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:36:20,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2025-03-04 10:36:20,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2025-03-04 10:36:20,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 50 states have (on average 1.4) internal successors, (70), 69 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:36:20,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2025-03-04 10:36:20,925 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 26 [2025-03-04 10:36:20,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:36:20,925 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2025-03-04 10:36:20,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:36:20,925 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2025-03-04 10:36:20,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-04 10:36:20,925 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:36:20,925 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:36:20,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 10:36:20,926 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-03-04 10:36:20,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:36:20,926 INFO L85 PathProgramCache]: Analyzing trace with hash 1829546492, now seen corresponding path program 1 times [2025-03-04 10:36:20,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:36:20,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693400291] [2025-03-04 10:36:20,926 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:36:20,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:36:20,930 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-04 10:36:20,936 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 10:36:20,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:36:20,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:36:20,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:36:20,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:36:20,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693400291] [2025-03-04 10:36:20,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693400291] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:36:20,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:36:20,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:36:20,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387559479] [2025-03-04 10:36:20,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:36:20,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:36:20,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:36:20,954 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:36:20,954 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:36:20,954 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:36:20,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:36:20,995 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2025-03-04 10:36:20,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:36:20,995 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 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) Word has length 27 [2025-03-04 10:36:20,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:36:20,995 INFO L225 Difference]: With dead ends: 73 [2025-03-04 10:36:20,996 INFO L226 Difference]: Without dead ends: 72 [2025-03-04 10:36:20,996 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:36:20,996 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 0 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:36:20,996 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 46 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:36:20,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2025-03-04 10:36:20,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2025-03-04 10:36:20,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 52 states have (on average 1.3846153846153846) internal successors, (72), 71 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:36:20,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2025-03-04 10:36:20,999 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 27 [2025-03-04 10:36:20,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:36:20,999 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2025-03-04 10:36:20,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:36:20,999 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2025-03-04 10:36:21,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-04 10:36:21,000 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:36:21,000 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:36:21,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 10:36:21,000 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-03-04 10:36:21,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:36:21,000 INFO L85 PathProgramCache]: Analyzing trace with hash 881366425, now seen corresponding path program 1 times [2025-03-04 10:36:21,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:36:21,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629486952] [2025-03-04 10:36:21,000 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:36:21,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:36:21,005 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-04 10:36:21,008 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 10:36:21,008 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:36:21,008 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:36:21,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1414602527] [2025-03-04 10:36:21,008 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:36:21,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:36:21,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:36:21,010 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:36:21,012 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 10:36:21,031 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-04 10:36:21,037 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 10:36:21,037 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:36:21,037 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:36:21,038 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 10:36:21,039 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:36:21,169 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:36:21,169 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:36:21,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:36:21,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629486952] [2025-03-04 10:36:21,169 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:36:21,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1414602527] [2025-03-04 10:36:21,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1414602527] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:36:21,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:36:21,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:36:21,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858647000] [2025-03-04 10:36:21,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:36:21,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:36:21,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:36:21,170 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:36:21,170 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:36:21,170 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:36:21,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:36:21,295 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2025-03-04 10:36:21,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:36:21,296 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 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) Word has length 28 [2025-03-04 10:36:21,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:36:21,296 INFO L225 Difference]: With dead ends: 72 [2025-03-04 10:36:21,296 INFO L226 Difference]: Without dead ends: 69 [2025-03-04 10:36:21,296 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:36:21,297 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 26 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:36:21,297 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 31 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:36:21,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2025-03-04 10:36:21,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2025-03-04 10:36:21,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 52 states have (on average 1.3269230769230769) internal successors, (69), 68 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:36:21,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2025-03-04 10:36:21,299 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 28 [2025-03-04 10:36:21,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:36:21,300 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2025-03-04 10:36:21,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:36:21,300 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2025-03-04 10:36:21,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-04 10:36:21,300 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:36:21,300 INFO L218 NwaCegarLoop]: trace histogram [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-04 10:36:21,309 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-04 10:36:21,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:36:21,504 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-03-04 10:36:21,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:36:21,504 INFO L85 PathProgramCache]: Analyzing trace with hash 1552555418, now seen corresponding path program 1 times [2025-03-04 10:36:21,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:36:21,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955291546] [2025-03-04 10:36:21,505 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:36:21,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:36:21,508 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-04 10:36:21,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-04 10:36:21,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:36:21,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:36:21,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1521540333] [2025-03-04 10:36:21,511 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:36:21,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:36:21,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:36:21,512 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:36:21,514 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 10:36:21,531 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-04 10:36:21,537 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-04 10:36:21,538 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:36:21,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:36:21,538 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 10:36:21,539 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:36:21,640 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:36:21,641 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:36:22,005 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:36:22,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:36:22,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955291546] [2025-03-04 10:36:22,005 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:36:22,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1521540333] [2025-03-04 10:36:22,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1521540333] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:36:22,005 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 10:36:22,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2025-03-04 10:36:22,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319476572] [2025-03-04 10:36:22,005 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 10:36:22,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 10:36:22,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:36:22,006 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 10:36:22,006 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2025-03-04 10:36:22,006 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand has 8 states, 7 states have (on average 8.142857142857142) internal successors, (57), 8 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:36:23,249 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2025-03-04 10:36:24,313 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2025-03-04 10:36:25,368 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2025-03-04 10:36:25,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:36:25,529 INFO L93 Difference]: Finished difference Result 104 states and 114 transitions. [2025-03-04 10:36:25,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 10:36:25,530 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 8.142857142857142) internal successors, (57), 8 states have internal predecessors, (57), 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) Word has length 29 [2025-03-04 10:36:25,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:36:25,530 INFO L225 Difference]: With dead ends: 104 [2025-03-04 10:36:25,530 INFO L226 Difference]: Without dead ends: 100 [2025-03-04 10:36:25,531 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2025-03-04 10:36:25,531 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 75 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 6 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2025-03-04 10:36:25,531 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 54 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 237 Invalid, 3 Unknown, 0 Unchecked, 3.5s Time] [2025-03-04 10:36:25,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-03-04 10:36:25,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 96. [2025-03-04 10:36:25,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 79 states have (on average 1.379746835443038) internal successors, (109), 95 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:36:25,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 109 transitions. [2025-03-04 10:36:25,535 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 109 transitions. Word has length 29 [2025-03-04 10:36:25,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:36:25,535 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 109 transitions. [2025-03-04 10:36:25,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 8.142857142857142) internal successors, (57), 8 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:36:25,535 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 109 transitions. [2025-03-04 10:36:25,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-04 10:36:25,535 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:36:25,535 INFO L218 NwaCegarLoop]: trace histogram [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-04 10:36:25,542 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-04 10:36:25,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-04 10:36:25,736 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-03-04 10:36:25,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:36:25,737 INFO L85 PathProgramCache]: Analyzing trace with hash 884577719, now seen corresponding path program 1 times [2025-03-04 10:36:25,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:36:25,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145667768] [2025-03-04 10:36:25,737 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:36:25,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:36:25,741 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 10:36:25,744 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 10:36:25,744 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:36:25,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:36:25,780 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:36:25,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:36:25,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145667768] [2025-03-04 10:36:25,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145667768] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:36:25,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [935467933] [2025-03-04 10:36:25,780 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:36:25,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:36:25,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:36:25,783 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:36:25,784 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 10:36:25,807 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 10:36:25,812 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 10:36:25,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:36:25,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:36:25,813 INFO L256 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 10:36:25,814 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:36:25,881 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:36:25,882 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:36:25,926 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:36:25,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [935467933] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:36:25,926 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:36:25,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-03-04 10:36:25,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317497271] [2025-03-04 10:36:25,927 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:36:25,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 10:36:25,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:36:25,927 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 10:36:25,927 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-03-04 10:36:25,927 INFO L87 Difference]: Start difference. First operand 96 states and 109 transitions. Second operand has 7 states, 6 states have (on average 13.5) internal successors, (81), 7 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:36:26,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:36:26,028 INFO L93 Difference]: Finished difference Result 98 states and 109 transitions. [2025-03-04 10:36:26,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:36:26,028 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 13.5) internal successors, (81), 7 states have internal predecessors, (81), 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) Word has length 30 [2025-03-04 10:36:26,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:36:26,029 INFO L225 Difference]: With dead ends: 98 [2025-03-04 10:36:26,029 INFO L226 Difference]: Without dead ends: 97 [2025-03-04 10:36:26,029 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-03-04 10:36:26,030 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 42 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:36:26,030 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 58 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:36:26,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2025-03-04 10:36:26,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 96. [2025-03-04 10:36:26,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 79 states have (on average 1.3670886075949367) internal successors, (108), 95 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:36:26,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 108 transitions. [2025-03-04 10:36:26,033 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 108 transitions. Word has length 30 [2025-03-04 10:36:26,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:36:26,034 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 108 transitions. [2025-03-04 10:36:26,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 13.5) internal successors, (81), 7 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:36:26,034 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 108 transitions. [2025-03-04 10:36:26,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-04 10:36:26,034 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:36:26,034 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] [2025-03-04 10:36:26,043 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-04 10:36:26,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-04 10:36:26,239 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-03-04 10:36:26,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:36:26,239 INFO L85 PathProgramCache]: Analyzing trace with hash 1652105528, now seen corresponding path program 1 times [2025-03-04 10:36:26,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:36:26,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932864050] [2025-03-04 10:36:26,239 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:36:26,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:36:26,246 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-04 10:36:26,257 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 10:36:26,257 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:36:26,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:36:26,287 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:36:26,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:36:26,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932864050] [2025-03-04 10:36:26,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932864050] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:36:26,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1789556242] [2025-03-04 10:36:26,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:36:26,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:36:26,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:36:26,290 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:36:26,291 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 10:36:26,305 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-04 10:36:26,311 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 10:36:26,311 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:36:26,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:36:26,312 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 10:36:26,313 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:36:26,403 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:36:26,404 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:36:26,448 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:36:26,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1789556242] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:36:26,449 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:36:26,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-03-04 10:36:26,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916200296] [2025-03-04 10:36:26,449 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:36:26,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 10:36:26,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:36:26,450 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 10:36:26,450 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-04 10:36:26,450 INFO L87 Difference]: Start difference. First operand 96 states and 108 transitions. Second operand has 7 states, 6 states have (on average 13.833333333333334) internal successors, (83), 7 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:36:26,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:36:26,571 INFO L93 Difference]: Finished difference Result 98 states and 108 transitions. [2025-03-04 10:36:26,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:36:26,571 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 13.833333333333334) internal successors, (83), 7 states have internal predecessors, (83), 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) Word has length 31 [2025-03-04 10:36:26,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:36:26,572 INFO L225 Difference]: With dead ends: 98 [2025-03-04 10:36:26,572 INFO L226 Difference]: Without dead ends: 97 [2025-03-04 10:36:26,572 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-03-04 10:36:26,572 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 38 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:36:26,572 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 72 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:36:26,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2025-03-04 10:36:26,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 96. [2025-03-04 10:36:26,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 79 states have (on average 1.3544303797468353) internal successors, (107), 95 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:36:26,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 107 transitions. [2025-03-04 10:36:26,575 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 107 transitions. Word has length 31 [2025-03-04 10:36:26,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:36:26,576 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 107 transitions. [2025-03-04 10:36:26,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 13.833333333333334) internal successors, (83), 7 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:36:26,576 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 107 transitions. [2025-03-04 10:36:26,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-03-04 10:36:26,576 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:36:26,576 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] [2025-03-04 10:36:26,584 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-04 10:36:26,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-04 10:36:26,777 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-03-04 10:36:26,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:36:26,778 INFO L85 PathProgramCache]: Analyzing trace with hash -324336171, now seen corresponding path program 1 times [2025-03-04 10:36:26,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:36:26,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178927813] [2025-03-04 10:36:26,778 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:36:26,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:36:26,784 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-04 10:36:26,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-04 10:36:26,788 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:36:26,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:36:26,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1512113096] [2025-03-04 10:36:26,788 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:36:26,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:36:26,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:36:26,793 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:36:26,795 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 10:36:26,809 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-04 10:36:26,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-04 10:36:26,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:36:26,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:36:26,815 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-04 10:36:26,816 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:36:27,003 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:36:27,003 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:36:27,126 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:36:27,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:36:27,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178927813] [2025-03-04 10:36:27,127 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:36:27,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1512113096] [2025-03-04 10:36:27,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1512113096] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:36:27,127 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 10:36:27,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2025-03-04 10:36:27,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794195854] [2025-03-04 10:36:27,128 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 10:36:27,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 10:36:27,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:36:27,128 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 10:36:27,128 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-03-04 10:36:27,129 INFO L87 Difference]: Start difference. First operand 96 states and 107 transitions. Second operand has 10 states, 9 states have (on average 7.0) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:36:27,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:36:27,519 INFO L93 Difference]: Finished difference Result 105 states and 107 transitions. [2025-03-04 10:36:27,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 10:36:27,519 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 7.0) internal successors, (63), 10 states have internal predecessors, (63), 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) Word has length 32 [2025-03-04 10:36:27,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:36:27,520 INFO L225 Difference]: With dead ends: 105 [2025-03-04 10:36:27,520 INFO L226 Difference]: Without dead ends: 96 [2025-03-04 10:36:27,520 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2025-03-04 10:36:27,521 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 90 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 313 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 10:36:27,521 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 32 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 313 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 10:36:27,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-03-04 10:36:27,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 95. [2025-03-04 10:36:27,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 79 states have (on average 1.2278481012658229) internal successors, (97), 94 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:36:27,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 97 transitions. [2025-03-04 10:36:27,524 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 97 transitions. Word has length 32 [2025-03-04 10:36:27,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:36:27,524 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 97 transitions. [2025-03-04 10:36:27,524 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 7.0) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:36:27,524 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 97 transitions. [2025-03-04 10:36:27,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-04 10:36:27,524 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:36:27,524 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:36:27,532 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-04 10:36:27,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:36:27,725 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-03-04 10:36:27,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:36:27,725 INFO L85 PathProgramCache]: Analyzing trace with hash -1994303833, now seen corresponding path program 1 times [2025-03-04 10:36:27,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:36:27,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958143153] [2025-03-04 10:36:27,725 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:36:27,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:36:27,729 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-04 10:36:27,735 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-04 10:36:27,735 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:36:27,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:36:27,775 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:36:27,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:36:27,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958143153] [2025-03-04 10:36:27,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958143153] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:36:27,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2097688619] [2025-03-04 10:36:27,775 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:36:27,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:36:27,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:36:27,777 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:36:27,779 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-04 10:36:27,796 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-04 10:36:27,804 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-04 10:36:27,804 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:36:27,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:36:27,805 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 10:36:27,805 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:36:27,847 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:36:27,847 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:36:27,926 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:36:27,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2097688619] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:36:27,927 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:36:27,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2025-03-04 10:36:27,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112573695] [2025-03-04 10:36:27,927 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:36:27,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:36:27,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:36:27,928 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:36:27,928 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:36:27,928 INFO L87 Difference]: Start difference. First operand 95 states and 97 transitions. Second operand has 6 states, 5 states have (on average 18.2) internal successors, (91), 6 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:36:27,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:36:27,948 INFO L93 Difference]: Finished difference Result 164 states and 166 transitions. [2025-03-04 10:36:27,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:36:27,949 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 18.2) internal successors, (91), 6 states have internal predecessors, (91), 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) Word has length 46 [2025-03-04 10:36:27,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:36:27,951 INFO L225 Difference]: With dead ends: 164 [2025-03-04 10:36:27,951 INFO L226 Difference]: Without dead ends: 163 [2025-03-04 10:36:27,951 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:36:27,951 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 43 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:36:27,952 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 195 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:36:27,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2025-03-04 10:36:27,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 137. [2025-03-04 10:36:27,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 121 states have (on average 1.3471074380165289) internal successors, (163), 136 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:36:27,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 163 transitions. [2025-03-04 10:36:27,957 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 163 transitions. Word has length 46 [2025-03-04 10:36:27,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:36:27,957 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 163 transitions. [2025-03-04 10:36:27,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 18.2) internal successors, (91), 6 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:36:27,957 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 163 transitions. [2025-03-04 10:36:27,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-04 10:36:27,958 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:36:27,958 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2025-03-04 10:36:27,970 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-04 10:36:28,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:36:28,159 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-03-04 10:36:28,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:36:28,159 INFO L85 PathProgramCache]: Analyzing trace with hash 677476097, now seen corresponding path program 1 times [2025-03-04 10:36:28,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:36:28,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154604673] [2025-03-04 10:36:28,159 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:36:28,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:36:28,163 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-04 10:36:28,168 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-04 10:36:28,168 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:36:28,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:36:28,185 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 10:36:28,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:36:28,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154604673] [2025-03-04 10:36:28,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154604673] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:36:28,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:36:28,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:36:28,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573569372] [2025-03-04 10:36:28,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:36:28,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:36:28,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:36:28,187 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:36:28,187 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:36:28,187 INFO L87 Difference]: Start difference. First operand 137 states and 163 transitions. Second operand has 3 states, 2 states have (on average 20.5) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:36:28,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:36:28,244 INFO L93 Difference]: Finished difference Result 137 states and 163 transitions. [2025-03-04 10:36:28,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:36:28,245 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 20.5) internal successors, (41), 3 states have internal predecessors, (41), 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) Word has length 52 [2025-03-04 10:36:28,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:36:28,245 INFO L225 Difference]: With dead ends: 137 [2025-03-04 10:36:28,245 INFO L226 Difference]: Without dead ends: 136 [2025-03-04 10:36:28,246 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:36:28,246 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 14 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:36:28,246 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 29 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:36:28,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2025-03-04 10:36:28,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2025-03-04 10:36:28,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 121 states have (on average 1.322314049586777) internal successors, (160), 135 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:36:28,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 160 transitions. [2025-03-04 10:36:28,250 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 160 transitions. Word has length 52 [2025-03-04 10:36:28,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:36:28,250 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 160 transitions. [2025-03-04 10:36:28,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 20.5) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:36:28,250 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 160 transitions. [2025-03-04 10:36:28,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-04 10:36:28,250 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:36:28,251 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1] [2025-03-04 10:36:28,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-04 10:36:28,251 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-03-04 10:36:28,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:36:28,251 INFO L85 PathProgramCache]: Analyzing trace with hash 639102610, now seen corresponding path program 2 times [2025-03-04 10:36:28,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:36:28,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238054215] [2025-03-04 10:36:28,251 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:36:28,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:36:28,255 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 55 statements into 2 equivalence classes. [2025-03-04 10:36:28,259 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 55 of 55 statements. [2025-03-04 10:36:28,259 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:36:28,259 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:36:28,312 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:36:28,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:36:28,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238054215] [2025-03-04 10:36:28,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238054215] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:36:28,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1734814554] [2025-03-04 10:36:28,312 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:36:28,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:36:28,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:36:28,314 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:36:28,316 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-04 10:36:28,334 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 55 statements into 2 equivalence classes. [2025-03-04 10:36:28,344 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 55 of 55 statements. [2025-03-04 10:36:28,344 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:36:28,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:36:28,344 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 10:36:28,345 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:36:28,520 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:36:28,521 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:36:28,609 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:36:28,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1734814554] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:36:28,609 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:36:28,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2025-03-04 10:36:28,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754980893] [2025-03-04 10:36:28,609 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:36:28,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 10:36:28,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:36:28,610 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 10:36:28,610 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2025-03-04 10:36:28,610 INFO L87 Difference]: Start difference. First operand 136 states and 160 transitions. Second operand has 13 states, 12 states have (on average 13.0) internal successors, (156), 13 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:36:28,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:36:28,872 INFO L93 Difference]: Finished difference Result 136 states and 160 transitions. [2025-03-04 10:36:28,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 10:36:28,872 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 13.0) internal successors, (156), 13 states have internal predecessors, (156), 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) Word has length 55 [2025-03-04 10:36:28,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:36:28,873 INFO L225 Difference]: With dead ends: 136 [2025-03-04 10:36:28,873 INFO L226 Difference]: Without dead ends: 134 [2025-03-04 10:36:28,873 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=182, Unknown=0, NotChecked=0, Total=272 [2025-03-04 10:36:28,873 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 53 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 10:36:28,873 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 30 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 287 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 10:36:28,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2025-03-04 10:36:28,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2025-03-04 10:36:28,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 121 states have (on average 1.28099173553719) internal successors, (155), 133 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:36:28,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 155 transitions. [2025-03-04 10:36:28,878 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 155 transitions. Word has length 55 [2025-03-04 10:36:28,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:36:28,878 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 155 transitions. [2025-03-04 10:36:28,878 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 13.0) internal successors, (156), 13 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:36:28,878 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 155 transitions. [2025-03-04 10:36:28,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-04 10:36:28,880 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:36:28,880 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1] [2025-03-04 10:36:28,885 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-04 10:36:29,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:36:29,081 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-03-04 10:36:29,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:36:29,082 INFO L85 PathProgramCache]: Analyzing trace with hash -1662655555, now seen corresponding path program 2 times [2025-03-04 10:36:29,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:36:29,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201816518] [2025-03-04 10:36:29,082 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:36:29,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:36:29,088 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-03-04 10:36:29,093 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-03-04 10:36:29,093 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:36:29,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:36:29,159 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:36:29,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:36:29,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201816518] [2025-03-04 10:36:29,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201816518] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:36:29,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [349952434] [2025-03-04 10:36:29,160 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:36:29,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:36:29,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:36:29,162 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:36:29,163 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-04 10:36:29,179 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-03-04 10:36:29,188 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-03-04 10:36:29,188 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:36:29,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:36:29,189 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 10:36:29,190 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:36:29,353 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:36:29,353 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:36:29,443 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:36:29,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [349952434] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:36:29,444 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:36:29,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2025-03-04 10:36:29,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494318719] [2025-03-04 10:36:29,444 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:36:29,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 10:36:29,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:36:29,444 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 10:36:29,444 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2025-03-04 10:36:29,445 INFO L87 Difference]: Start difference. First operand 134 states and 155 transitions. Second operand has 13 states, 12 states have (on average 13.166666666666666) internal successors, (158), 13 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:36:29,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:36:29,644 INFO L93 Difference]: Finished difference Result 137 states and 155 transitions. [2025-03-04 10:36:29,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 10:36:29,644 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 13.166666666666666) internal successors, (158), 13 states have internal predecessors, (158), 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) Word has length 56 [2025-03-04 10:36:29,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:36:29,645 INFO L225 Difference]: With dead ends: 137 [2025-03-04 10:36:29,645 INFO L226 Difference]: Without dead ends: 136 [2025-03-04 10:36:29,645 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=157, Unknown=0, NotChecked=0, Total=240 [2025-03-04 10:36:29,646 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 80 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 10:36:29,646 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 58 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 10:36:29,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2025-03-04 10:36:29,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 134. [2025-03-04 10:36:29,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 121 states have (on average 1.2727272727272727) internal successors, (154), 133 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:36:29,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 154 transitions. [2025-03-04 10:36:29,650 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 154 transitions. Word has length 56 [2025-03-04 10:36:29,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:36:29,650 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 154 transitions. [2025-03-04 10:36:29,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 13.166666666666666) internal successors, (158), 13 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:36:29,650 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 154 transitions. [2025-03-04 10:36:29,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-04 10:36:29,650 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:36:29,650 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, 1, 1, 1] [2025-03-04 10:36:29,656 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-04 10:36:29,851 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,SelfDestructingSolverStorable21 [2025-03-04 10:36:29,851 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-03-04 10:36:29,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:36:29,851 INFO L85 PathProgramCache]: Analyzing trace with hash -84153829, now seen corresponding path program 1 times [2025-03-04 10:36:29,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:36:29,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035214691] [2025-03-04 10:36:29,852 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:36:29,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:36:29,855 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-04 10:36:29,858 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-04 10:36:29,858 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:36:29,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:36:29,926 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:36:29,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:36:29,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035214691] [2025-03-04 10:36:29,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035214691] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:36:29,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1627961836] [2025-03-04 10:36:29,926 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:36:29,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:36:29,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:36:29,928 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:36:29,930 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-04 10:36:29,946 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-04 10:36:29,954 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-04 10:36:29,954 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:36:29,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:36:29,954 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 10:36:29,955 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:36:30,169 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:36:30,169 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:36:42,897 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:36:42,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1627961836] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:36:42,898 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:36:42,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 15 [2025-03-04 10:36:42,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129682898] [2025-03-04 10:36:42,898 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:36:42,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-04 10:36:42,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:36:42,898 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-04 10:36:42,899 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=184, Unknown=3, NotChecked=0, Total=240 [2025-03-04 10:36:42,899 INFO L87 Difference]: Start difference. First operand 134 states and 154 transitions. Second operand has 16 states, 15 states have (on average 11.133333333333333) internal successors, (167), 16 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:36:43,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:36:43,597 INFO L93 Difference]: Finished difference Result 134 states and 154 transitions. [2025-03-04 10:36:43,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 10:36:43,597 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 11.133333333333333) internal successors, (167), 16 states have internal predecessors, (167), 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) Word has length 58 [2025-03-04 10:36:43,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:36:43,598 INFO L225 Difference]: With dead ends: 134 [2025-03-04 10:36:43,598 INFO L226 Difference]: Without dead ends: 130 [2025-03-04 10:36:43,598 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 12.4s TimeCoverageRelationStatistics Valid=172, Invalid=377, Unknown=3, NotChecked=0, Total=552 [2025-03-04 10:36:43,599 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 102 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 10:36:43,599 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 32 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 10:36:43,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2025-03-04 10:36:43,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2025-03-04 10:36:43,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 121 states have (on average 1.1818181818181819) internal successors, (143), 129 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:36:43,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 143 transitions. [2025-03-04 10:36:43,603 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 143 transitions. Word has length 58 [2025-03-04 10:36:43,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:36:43,603 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 143 transitions. [2025-03-04 10:36:43,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 11.133333333333333) internal successors, (167), 16 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:36:43,604 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 143 transitions. [2025-03-04 10:36:43,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-04 10:36:43,604 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:36:43,604 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, 1, 1, 1] [2025-03-04 10:36:43,610 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-04 10:36:43,808 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,SelfDestructingSolverStorable22 [2025-03-04 10:36:43,808 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-03-04 10:36:43,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:36:43,808 INFO L85 PathProgramCache]: Analyzing trace with hash 732549241, now seen corresponding path program 1 times [2025-03-04 10:36:43,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:36:43,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129977789] [2025-03-04 10:36:43,808 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:36:43,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:36:43,811 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-04 10:36:43,816 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-04 10:36:43,816 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:36:43,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:36:43,873 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:36:43,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:36:43,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129977789] [2025-03-04 10:36:43,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129977789] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:36:43,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2080403331] [2025-03-04 10:36:43,874 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:36:43,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:36:43,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:36:43,876 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:36:43,877 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-04 10:36:43,898 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-04 10:36:43,909 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-04 10:36:43,909 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:36:43,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:36:43,910 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 10:36:43,911 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:36:44,028 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:36:44,028 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:36:44,125 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:36:44,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2080403331] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:36:44,126 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:36:44,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2025-03-04 10:36:44,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524859974] [2025-03-04 10:36:44,126 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:36:44,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 10:36:44,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:36:44,127 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 10:36:44,127 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-03-04 10:36:44,127 INFO L87 Difference]: Start difference. First operand 130 states and 143 transitions. Second operand has 13 states, 12 states have (on average 14.0) internal successors, (168), 13 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:36:44,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:36:44,302 INFO L93 Difference]: Finished difference Result 132 states and 143 transitions. [2025-03-04 10:36:44,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 10:36:44,303 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 14.0) internal successors, (168), 13 states have internal predecessors, (168), 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) Word has length 60 [2025-03-04 10:36:44,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:36:44,303 INFO L225 Difference]: With dead ends: 132 [2025-03-04 10:36:44,303 INFO L226 Difference]: Without dead ends: 131 [2025-03-04 10:36:44,303 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2025-03-04 10:36:44,304 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 77 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 10:36:44,304 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 63 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 10:36:44,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2025-03-04 10:36:44,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 130. [2025-03-04 10:36:44,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 121 states have (on average 1.165289256198347) internal successors, (141), 129 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:36:44,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 141 transitions. [2025-03-04 10:36:44,307 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 141 transitions. Word has length 60 [2025-03-04 10:36:44,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:36:44,307 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 141 transitions. [2025-03-04 10:36:44,307 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 14.0) internal successors, (168), 13 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:36:44,307 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 141 transitions. [2025-03-04 10:36:44,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-04 10:36:44,308 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:36:44,308 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1] [2025-03-04 10:36:44,313 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-03-04 10:36:44,508 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,SelfDestructingSolverStorable23 [2025-03-04 10:36:44,508 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-03-04 10:36:44,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:36:44,509 INFO L85 PathProgramCache]: Analyzing trace with hash 1234189996, now seen corresponding path program 1 times [2025-03-04 10:36:44,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:36:44,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928230807] [2025-03-04 10:36:44,509 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:36:44,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:36:44,512 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-04 10:36:44,516 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-04 10:36:44,516 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:36:44,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:36:44,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [916165277] [2025-03-04 10:36:44,516 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:36:44,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:36:44,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:36:44,518 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:36:44,520 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-04 10:36:44,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-04 10:36:44,546 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-04 10:36:44,546 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:36:44,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:36:44,546 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-04 10:36:44,550 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:36:44,778 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:36:44,778 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:36:44,962 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:36:44,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:36:44,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928230807] [2025-03-04 10:36:44,962 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:36:44,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [916165277] [2025-03-04 10:36:44,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [916165277] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:36:44,962 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 10:36:44,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2025-03-04 10:36:44,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936275169] [2025-03-04 10:36:44,963 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 10:36:44,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-04 10:36:44,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:36:44,963 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-04 10:36:44,963 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2025-03-04 10:36:44,963 INFO L87 Difference]: Start difference. First operand 130 states and 141 transitions. Second operand has 16 states, 15 states have (on average 8.066666666666666) internal successors, (121), 16 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:36:45,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:36:45,628 INFO L93 Difference]: Finished difference Result 163 states and 178 transitions. [2025-03-04 10:36:45,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-04 10:36:45,629 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 8.066666666666666) internal successors, (121), 16 states have internal predecessors, (121), 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) Word has length 61 [2025-03-04 10:36:45,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:36:45,630 INFO L225 Difference]: With dead ends: 163 [2025-03-04 10:36:45,630 INFO L226 Difference]: Without dead ends: 158 [2025-03-04 10:36:45,630 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=165, Invalid=297, Unknown=0, NotChecked=0, Total=462 [2025-03-04 10:36:45,630 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 115 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 676 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 690 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 676 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 10:36:45,630 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 73 Invalid, 690 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 676 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 10:36:45,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2025-03-04 10:36:45,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 145. [2025-03-04 10:36:45,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 136 states have (on average 1.1323529411764706) internal successors, (154), 144 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:36:45,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 154 transitions. [2025-03-04 10:36:45,634 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 154 transitions. Word has length 61 [2025-03-04 10:36:45,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:36:45,634 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 154 transitions. [2025-03-04 10:36:45,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 8.066666666666666) internal successors, (121), 16 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:36:45,635 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 154 transitions. [2025-03-04 10:36:45,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-04 10:36:45,635 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:36:45,635 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1] [2025-03-04 10:36:45,641 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-03-04 10:36:45,835 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,SelfDestructingSolverStorable24 [2025-03-04 10:36:45,836 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-03-04 10:36:45,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:36:45,836 INFO L85 PathProgramCache]: Analyzing trace with hash 2097673530, now seen corresponding path program 2 times [2025-03-04 10:36:45,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:36:45,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284267390] [2025-03-04 10:36:45,836 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:36:45,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:36:45,839 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 79 statements into 2 equivalence classes. [2025-03-04 10:36:45,845 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 79 of 79 statements. [2025-03-04 10:36:45,845 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:36:45,845 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:36:45,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [87282053] [2025-03-04 10:36:45,845 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:36:45,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:36:45,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:36:45,847 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:36:45,849 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-04 10:36:45,866 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 79 statements into 2 equivalence classes. [2025-03-04 10:36:45,878 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 79 of 79 statements. [2025-03-04 10:36:45,878 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:36:45,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:36:45,879 INFO L256 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-04 10:36:45,879 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:36:46,063 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:36:46,063 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:36:48,420 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:36:48,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:36:48,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284267390] [2025-03-04 10:36:48,420 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:36:48,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [87282053] [2025-03-04 10:36:48,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [87282053] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:36:48,420 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 10:36:48,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2025-03-04 10:36:48,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780889526] [2025-03-04 10:36:48,420 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 10:36:48,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-04 10:36:48,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:36:48,421 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-04 10:36:48,421 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=158, Unknown=1, NotChecked=0, Total=240 [2025-03-04 10:36:48,421 INFO L87 Difference]: Start difference. First operand 145 states and 154 transitions. Second operand has 16 states, 15 states have (on average 10.466666666666667) internal successors, (157), 16 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:36:49,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:36:49,191 INFO L93 Difference]: Finished difference Result 194 states and 212 transitions. [2025-03-04 10:36:49,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 10:36:49,191 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 10.466666666666667) internal successors, (157), 16 states have internal predecessors, (157), 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) Word has length 79 [2025-03-04 10:36:49,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:36:49,192 INFO L225 Difference]: With dead ends: 194 [2025-03-04 10:36:49,192 INFO L226 Difference]: Without dead ends: 193 [2025-03-04 10:36:49,193 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=140, Invalid=239, Unknown=1, NotChecked=0, Total=380 [2025-03-04 10:36:49,193 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 264 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 654 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 663 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 654 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 10:36:49,193 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 143 Invalid, 663 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 654 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 10:36:49,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2025-03-04 10:36:49,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 188. [2025-03-04 10:36:49,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 179 states have (on average 1.1620111731843576) internal successors, (208), 187 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:36:49,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 208 transitions. [2025-03-04 10:36:49,199 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 208 transitions. Word has length 79 [2025-03-04 10:36:49,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:36:49,199 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 208 transitions. [2025-03-04 10:36:49,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 10.466666666666667) internal successors, (157), 16 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:36:49,199 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 208 transitions. [2025-03-04 10:36:49,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-04 10:36:49,200 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:36:49,200 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1] [2025-03-04 10:36:49,206 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-04 10:36:49,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:36:49,400 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-03-04 10:36:49,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:36:49,401 INFO L85 PathProgramCache]: Analyzing trace with hash 1524601048, now seen corresponding path program 3 times [2025-03-04 10:36:49,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:36:49,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84941593] [2025-03-04 10:36:49,401 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:36:49,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:36:49,405 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 81 statements into 4 equivalence classes. [2025-03-04 10:36:49,412 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 81 of 81 statements. [2025-03-04 10:36:49,412 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-04 10:36:49,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:36:49,513 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:36:49,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:36:49,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84941593] [2025-03-04 10:36:49,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84941593] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:36:49,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [419522135] [2025-03-04 10:36:49,514 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:36:49,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:36:49,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:36:49,516 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:36:49,518 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-04 10:36:49,535 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 81 statements into 4 equivalence classes. [2025-03-04 10:36:49,542 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 31 of 81 statements. [2025-03-04 10:36:49,542 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 10:36:49,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:36:49,542 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 10:36:49,544 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:37:32,074 WARN L873 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~y~0#1| Int) (|ULTIMATE.start_main_~z~0#1| Int)) (and (<= (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) 2147483647) (exists ((|v_ULTIMATE.start_main_~z~0#1_79| Int)) (and (exists ((|v_ULTIMATE.start_main_~y~0#1_83| Int)) (let ((.cse1 (* |v_ULTIMATE.start_main_~y~0#1_83| 12))) (let ((.cse0 (div (+ (* (- 2) |v_ULTIMATE.start_main_~z~0#1_79|) .cse1 6 (* (- 1) |v_ULTIMATE.start_main_~y~0#1_83| |v_ULTIMATE.start_main_~z~0#1_79|)) 18))) (and (<= (+ |c_ULTIMATE.start_main_~x~0#1| .cse0) |v_ULTIMATE.start_main_~y~0#1_83|) (= (mod (+ (* 16 |v_ULTIMATE.start_main_~z~0#1_79|) (* |v_ULTIMATE.start_main_~y~0#1_83| 17 |v_ULTIMATE.start_main_~z~0#1_79|) .cse1 6) 18) 0) (<= 0 (+ 119304647 .cse0)) (<= (+ |v_ULTIMATE.start_main_~y~0#1_83| |v_ULTIMATE.start_main_~z~0#1_79|) |ULTIMATE.start_main_~y~0#1|))))) (<= (+ 6 |v_ULTIMATE.start_main_~z~0#1_79|) |ULTIMATE.start_main_~z~0#1|))))) is different from true [2025-03-04 10:37:32,134 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-04 10:37:32,135 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:37:32,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [419522135] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:37:32,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:37:32,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 14 [2025-03-04 10:37:32,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523041420] [2025-03-04 10:37:32,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:37:32,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 10:37:32,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:37:32,136 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 10:37:32,136 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=146, Unknown=10, NotChecked=24, Total=210 [2025-03-04 10:37:32,136 INFO L87 Difference]: Start difference. First operand 188 states and 208 transitions. Second operand has 8 states, 7 states have (on average 7.571428571428571) internal successors, (53), 8 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:37:40,925 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-03-04 10:37:44,986 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-03-04 10:37:59,429 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.19s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0]