./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 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/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-?-8fc3dc6-m [2025-03-17 14:52:00,803 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 14:52:00,856 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-17 14:52:00,861 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 14:52:00,862 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 14:52:00,883 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 14:52:00,884 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 14:52:00,884 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 14:52:00,884 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 14:52:00,884 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 14:52:00,884 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 14:52:00,885 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 14:52:00,885 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 14:52:00,885 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 14:52:00,885 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 14:52:00,885 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 14:52:00,885 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 14:52:00,885 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 14:52:00,885 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 14:52:00,885 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 14:52:00,886 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 14:52:00,886 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 14:52:00,886 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 14:52:00,886 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 14:52:00,886 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-17 14:52:00,886 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 14:52:00,886 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 14:52:00,886 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 14:52:00,886 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 14:52:00,886 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 14:52:00,886 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 14:52:00,886 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 14:52:00,887 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 14:52:00,887 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 14:52:00,887 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 14:52:00,887 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 14:52:00,887 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 14:52:00,887 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 14:52:00,887 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 14:52:00,887 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 14:52:00,887 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 14:52:00,887 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 14:52:00,887 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 14:52:00,888 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 14:52:00,888 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 14:52:00,888 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-17 14:52:01,134 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 14:52:01,142 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 14:52:01,145 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 14:52:01,146 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 14:52:01,146 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 14:52:01,148 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-17 14:52:02,301 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72561f080/d93715f7ef0d4ce2a1a07806481ba74e/FLAG130be204f [2025-03-17 14:52:02,534 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 14:52:02,534 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-nla/cohencu4-both-nt.c [2025-03-17 14:52:02,555 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72561f080/d93715f7ef0d4ce2a1a07806481ba74e/FLAG130be204f [2025-03-17 14:52:02,578 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72561f080/d93715f7ef0d4ce2a1a07806481ba74e [2025-03-17 14:52:02,580 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 14:52:02,582 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 14:52:02,584 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 14:52:02,584 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 14:52:02,587 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 14:52:02,588 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:52:02" (1/1) ... [2025-03-17 14:52:02,590 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@203c7686 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:52:02, skipping insertion in model container [2025-03-17 14:52:02,590 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:52:02" (1/1) ... [2025-03-17 14:52:02,601 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 14:52:02,705 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 14:52:02,709 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 14:52:02,719 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 14:52:02,728 INFO L204 MainTranslator]: Completed translation [2025-03-17 14:52:02,728 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:52:02 WrapperNode [2025-03-17 14:52:02,728 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 14:52:02,729 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 14:52:02,729 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 14:52:02,729 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 14:52:02,734 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:52:02" (1/1) ... [2025-03-17 14:52:02,736 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:52:02" (1/1) ... [2025-03-17 14:52:02,745 INFO L138 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 48 [2025-03-17 14:52:02,746 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 14:52:02,746 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 14:52:02,746 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 14:52:02,746 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 14:52:02,752 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:52:02" (1/1) ... [2025-03-17 14:52:02,752 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:52:02" (1/1) ... [2025-03-17 14:52:02,753 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:52:02" (1/1) ... [2025-03-17 14:52:02,757 INFO L175 MemorySlicer]: No memory access in input program. [2025-03-17 14:52:02,757 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:52:02" (1/1) ... [2025-03-17 14:52:02,757 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:52:02" (1/1) ... [2025-03-17 14:52:02,758 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:52:02" (1/1) ... [2025-03-17 14:52:02,759 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:52:02" (1/1) ... [2025-03-17 14:52:02,760 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:52:02" (1/1) ... [2025-03-17 14:52:02,760 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:52:02" (1/1) ... [2025-03-17 14:52:02,761 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 14:52:02,762 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 14:52:02,762 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 14:52:02,762 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 14:52:02,762 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:52:02" (1/1) ... [2025-03-17 14:52:02,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 14:52:02,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:52:02,786 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 14:52:02,788 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 14:52:02,805 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 14:52:02,805 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 14:52:02,835 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 14:52:02,836 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 14:52:02,998 INFO L? ?]: Removed 52 outVars from TransFormulas that were not future-live. [2025-03-17 14:52:03,001 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 14:52:03,010 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 14:52:03,011 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 14:52:03,011 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:52:03 BoogieIcfgContainer [2025-03-17 14:52:03,011 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 14:52:03,013 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 14:52:03,013 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 14:52:03,016 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 14:52:03,017 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 02:52:02" (1/3) ... [2025-03-17 14:52:03,017 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52233fcd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:52:03, skipping insertion in model container [2025-03-17 14:52:03,017 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:52:02" (2/3) ... [2025-03-17 14:52:03,017 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52233fcd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:52:03, skipping insertion in model container [2025-03-17 14:52:03,018 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:52:03" (3/3) ... [2025-03-17 14:52:03,018 INFO L128 eAbstractionObserver]: Analyzing ICFG cohencu4-both-nt.c [2025-03-17 14:52:03,028 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 14:52:03,030 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG cohencu4-both-nt.c that has 1 procedures, 53 locations, 1 initial locations, 1 loop locations, and 24 error locations. [2025-03-17 14:52:03,072 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 14:52:03,082 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;@5e1afcfc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 14:52:03,083 INFO L334 AbstractCegarLoop]: Starting to check reachability of 24 error locations. [2025-03-17 14:52:03,087 INFO L276 IsEmpty]: Start isEmpty. Operand has 53 states, 28 states have (on average 1.9285714285714286) internal successors, (54), 52 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:52:03,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2025-03-17 14:52:03,091 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:52:03,091 INFO L218 NwaCegarLoop]: trace histogram [1, 1] [2025-03-17 14:52:03,092 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-17 14:52:03,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:52:03,097 INFO L85 PathProgramCache]: Analyzing trace with hash 2623, now seen corresponding path program 1 times [2025-03-17 14:52:03,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:52:03,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457180409] [2025-03-17 14:52:03,103 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:52:03,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:52:03,155 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 14:52:03,162 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 14:52:03,162 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:52:03,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 14:52:03,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1344085009] [2025-03-17 14:52:03,164 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:52:03,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:52:03,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:52:03,166 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:52:03,167 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 14:52:03,195 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 14:52:03,200 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 14:52:03,200 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:52:03,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:52:03,202 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 14:52:03,205 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:52:03,247 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-17 14:52:03,249 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:52:03,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:52:03,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457180409] [2025-03-17 14:52:03,250 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-17 14:52:03,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1344085009] [2025-03-17 14:52:03,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1344085009] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:52:03,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:52:03,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 14:52:03,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676278132] [2025-03-17 14:52:03,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:52:03,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:52:03,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:52:03,267 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:52:03,267 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:52:03,269 INFO L87 Difference]: Start difference. First operand has 53 states, 28 states have (on average 1.9285714285714286) internal successors, (54), 52 states have internal predecessors, (54), 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.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:52:03,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:52:03,396 INFO L93 Difference]: Finished difference Result 91 states and 103 transitions. [2025-03-17 14:52:03,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:52:03,398 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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 2 [2025-03-17 14:52:03,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:52:03,403 INFO L225 Difference]: With dead ends: 91 [2025-03-17 14:52:03,403 INFO L226 Difference]: Without dead ends: 77 [2025-03-17 14:52:03,404 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:52:03,407 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 26 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 32 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-17 14:52:03,408 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 32 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 14:52:03,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-03-17 14:52:03,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 73. [2025-03-17 14:52:03,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 49 states have (on average 1.7755102040816326) internal successors, (87), 72 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-17 14:52:03,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 87 transitions. [2025-03-17 14:52:03,428 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 87 transitions. Word has length 2 [2025-03-17 14:52:03,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:52:03,428 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 87 transitions. [2025-03-17 14:52:03,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:52:03,428 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 87 transitions. [2025-03-17 14:52:03,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-17 14:52:03,428 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:52:03,428 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-17 14:52:03,435 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 14:52:03,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-17 14:52:03,630 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-17 14:52:03,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:52:03,631 INFO L85 PathProgramCache]: Analyzing trace with hash 2521245, now seen corresponding path program 1 times [2025-03-17 14:52:03,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:52:03,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768471799] [2025-03-17 14:52:03,631 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:52:03,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:52:03,634 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 14:52:03,636 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 14:52:03,636 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:52:03,636 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:52:03,662 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-17 14:52:03,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:52:03,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768471799] [2025-03-17 14:52:03,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768471799] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:52:03,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:52:03,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 14:52:03,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270757061] [2025-03-17 14:52:03,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:52:03,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:52:03,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:52:03,663 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:52:03,663 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:52:03,663 INFO L87 Difference]: Start difference. First operand 73 states and 87 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:52:03,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:52:03,719 INFO L93 Difference]: Finished difference Result 76 states and 87 transitions. [2025-03-17 14:52:03,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:52:03,719 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 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 4 [2025-03-17 14:52:03,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:52:03,720 INFO L225 Difference]: With dead ends: 76 [2025-03-17 14:52:03,720 INFO L226 Difference]: Without dead ends: 75 [2025-03-17 14:52:03,720 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:52:03,720 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 20 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 50 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-17 14:52:03,720 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 50 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:52:03,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-03-17 14:52:03,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 73. [2025-03-17 14:52:03,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 49 states have (on average 1.7551020408163265) internal successors, (86), 72 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-17 14:52:03,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 86 transitions. [2025-03-17 14:52:03,725 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 86 transitions. Word has length 4 [2025-03-17 14:52:03,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:52:03,725 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 86 transitions. [2025-03-17 14:52:03,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:52:03,725 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 86 transitions. [2025-03-17 14:52:03,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-17 14:52:03,725 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:52:03,725 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-17 14:52:03,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 14:52:03,726 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-17 14:52:03,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:52:03,726 INFO L85 PathProgramCache]: Analyzing trace with hash 78158608, now seen corresponding path program 1 times [2025-03-17 14:52:03,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:52:03,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362754495] [2025-03-17 14:52:03,726 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:52:03,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:52:03,729 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 14:52:03,730 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 14:52:03,730 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:52:03,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:52:03,747 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-17 14:52:03,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:52:03,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362754495] [2025-03-17 14:52:03,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362754495] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:52:03,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:52:03,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 14:52:03,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140834594] [2025-03-17 14:52:03,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:52:03,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:52:03,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:52:03,748 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:52:03,748 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:52:03,748 INFO L87 Difference]: Start difference. First operand 73 states and 86 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 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-17 14:52:03,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:52:03,799 INFO L93 Difference]: Finished difference Result 76 states and 86 transitions. [2025-03-17 14:52:03,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:52:03,799 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 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-17 14:52:03,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:52:03,800 INFO L225 Difference]: With dead ends: 76 [2025-03-17 14:52:03,800 INFO L226 Difference]: Without dead ends: 75 [2025-03-17 14:52:03,800 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:52:03,800 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 19 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 51 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-17 14:52:03,801 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 51 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:52:03,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-03-17 14:52:03,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 73. [2025-03-17 14:52:03,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 49 states have (on average 1.7346938775510203) internal successors, (85), 72 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-17 14:52:03,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 85 transitions. [2025-03-17 14:52:03,804 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 85 transitions. Word has length 5 [2025-03-17 14:52:03,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:52:03,804 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 85 transitions. [2025-03-17 14:52:03,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 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-17 14:52:03,804 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 85 transitions. [2025-03-17 14:52:03,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-17 14:52:03,805 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:52:03,805 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-17 14:52:03,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 14:52:03,805 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-17 14:52:03,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:52:03,805 INFO L85 PathProgramCache]: Analyzing trace with hash -1872050437, now seen corresponding path program 1 times [2025-03-17 14:52:03,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:52:03,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418028722] [2025-03-17 14:52:03,805 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:52:03,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:52:03,810 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 14:52:03,818 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 14:52:03,819 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:52:03,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:52:03,851 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-17 14:52:03,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:52:03,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418028722] [2025-03-17 14:52:03,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418028722] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:52:03,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:52:03,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 14:52:03,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021393428] [2025-03-17 14:52:03,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:52:03,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:52:03,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:52:03,852 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:52:03,852 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:52:03,852 INFO L87 Difference]: Start difference. First operand 73 states and 85 transitions. Second operand has 4 states, 3 states have (on average 2.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-17 14:52:04,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:52:04,006 INFO L93 Difference]: Finished difference Result 76 states and 85 transitions. [2025-03-17 14:52:04,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:52:04,007 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.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-17 14:52:04,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:52:04,007 INFO L225 Difference]: With dead ends: 76 [2025-03-17 14:52:04,008 INFO L226 Difference]: Without dead ends: 75 [2025-03-17 14:52:04,008 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:52:04,009 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 57 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 34 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-17 14:52:04,010 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 34 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 14:52:04,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-03-17 14:52:04,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 73. [2025-03-17 14:52:04,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 49 states have (on average 1.7142857142857142) internal successors, (84), 72 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-17 14:52:04,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 84 transitions. [2025-03-17 14:52:04,021 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 84 transitions. Word has length 6 [2025-03-17 14:52:04,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:52:04,021 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 84 transitions. [2025-03-17 14:52:04,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.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-17 14:52:04,021 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 84 transitions. [2025-03-17 14:52:04,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-17 14:52:04,021 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:52:04,021 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:52:04,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 14:52:04,021 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-17 14:52:04,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:52:04,022 INFO L85 PathProgramCache]: Analyzing trace with hash 2095978606, now seen corresponding path program 1 times [2025-03-17 14:52:04,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:52:04,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407113028] [2025-03-17 14:52:04,022 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:52:04,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:52:04,029 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 14:52:04,037 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 14:52:04,038 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:52:04,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:52:04,115 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-17 14:52:04,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:52:04,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407113028] [2025-03-17 14:52:04,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407113028] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:52:04,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:52:04,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 14:52:04,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497141215] [2025-03-17 14:52:04,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:52:04,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:52:04,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:52:04,116 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:52:04,116 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:52:04,116 INFO L87 Difference]: Start difference. First operand 73 states and 84 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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-17 14:52:04,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:52:04,275 INFO L93 Difference]: Finished difference Result 76 states and 84 transitions. [2025-03-17 14:52:04,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:52:04,275 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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-17 14:52:04,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:52:04,276 INFO L225 Difference]: With dead ends: 76 [2025-03-17 14:52:04,276 INFO L226 Difference]: Without dead ends: 75 [2025-03-17 14:52:04,276 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:52:04,278 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 55 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 35 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-17 14:52:04,278 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 35 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 14:52:04,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-03-17 14:52:04,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 73. [2025-03-17 14:52:04,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 49 states have (on average 1.6938775510204083) internal successors, (83), 72 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-17 14:52:04,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 83 transitions. [2025-03-17 14:52:04,282 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 83 transitions. Word has length 7 [2025-03-17 14:52:04,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:52:04,283 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 83 transitions. [2025-03-17 14:52:04,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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-17 14:52:04,283 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 83 transitions. [2025-03-17 14:52:04,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-17 14:52:04,283 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:52:04,283 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:52:04,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 14:52:04,284 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-17 14:52:04,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:52:04,284 INFO L85 PathProgramCache]: Analyzing trace with hash 1064108983, now seen corresponding path program 1 times [2025-03-17 14:52:04,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:52:04,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102594514] [2025-03-17 14:52:04,284 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:52:04,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:52:04,289 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-17 14:52:04,295 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-17 14:52:04,295 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:52:04,295 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 14:52:04,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [107364030] [2025-03-17 14:52:04,296 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:52:04,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:52:04,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:52:04,298 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:52:04,298 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 14:52:04,314 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-17 14:52:04,317 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-17 14:52:04,317 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:52:04,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:52:04,317 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 14:52:04,318 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:52:04,423 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-17 14:52:04,423 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:52:04,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:52:04,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102594514] [2025-03-17 14:52:04,423 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-17 14:52:04,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [107364030] [2025-03-17 14:52:04,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [107364030] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:52:04,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:52:04,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 14:52:04,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114000305] [2025-03-17 14:52:04,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:52:04,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:52:04,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:52:04,424 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:52:04,424 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:52:04,424 INFO L87 Difference]: Start difference. First operand 73 states and 83 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:52:04,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:52:04,492 INFO L93 Difference]: Finished difference Result 79 states and 83 transitions. [2025-03-17 14:52:04,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:52:04,492 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 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 10 [2025-03-17 14:52:04,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:52:04,493 INFO L225 Difference]: With dead ends: 79 [2025-03-17 14:52:04,493 INFO L226 Difference]: Without dead ends: 75 [2025-03-17 14:52:04,493 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:52:04,493 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 14 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 31 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-17 14:52:04,495 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 31 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 14:52:04,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-03-17 14:52:04,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 73. [2025-03-17 14:52:04,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 49 states have (on average 1.6122448979591837) internal successors, (79), 72 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-17 14:52:04,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 79 transitions. [2025-03-17 14:52:04,505 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 79 transitions. Word has length 10 [2025-03-17 14:52:04,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:52:04,505 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 79 transitions. [2025-03-17 14:52:04,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:52:04,505 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 79 transitions. [2025-03-17 14:52:04,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-17 14:52:04,506 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:52:04,506 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:52:04,512 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-17 14:52:04,707 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-17 14:52:04,707 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-17 14:52:04,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:52:04,708 INFO L85 PathProgramCache]: Analyzing trace with hash -1372359894, now seen corresponding path program 1 times [2025-03-17 14:52:04,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:52:04,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125969483] [2025-03-17 14:52:04,708 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:52:04,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:52:04,712 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-17 14:52:04,717 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 14:52:04,717 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:52:04,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:52:04,759 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-17 14:52:04,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:52:04,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125969483] [2025-03-17 14:52:04,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125969483] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:52:04,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:52:04,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 14:52:04,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960316127] [2025-03-17 14:52:04,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:52:04,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:52:04,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:52:04,761 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:52:04,761 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:52:04,762 INFO L87 Difference]: Start difference. First operand 73 states and 79 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) 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-17 14:52:04,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:52:04,879 INFO L93 Difference]: Finished difference Result 76 states and 79 transitions. [2025-03-17 14:52:04,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:52:04,879 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) 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-17 14:52:04,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:52:04,880 INFO L225 Difference]: With dead ends: 76 [2025-03-17 14:52:04,880 INFO L226 Difference]: Without dead ends: 75 [2025-03-17 14:52:04,880 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:52:04,880 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 35 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 44 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-17 14:52:04,881 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 44 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 14:52:04,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-03-17 14:52:04,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 73. [2025-03-17 14:52:04,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 49 states have (on average 1.5918367346938775) internal successors, (78), 72 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:52:04,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 78 transitions. [2025-03-17 14:52:04,887 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 78 transitions. Word has length 11 [2025-03-17 14:52:04,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:52:04,887 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 78 transitions. [2025-03-17 14:52:04,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) 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-17 14:52:04,887 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 78 transitions. [2025-03-17 14:52:04,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-17 14:52:04,887 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:52:04,887 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:52:04,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 14:52:04,888 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-17 14:52:04,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:52:04,888 INFO L85 PathProgramCache]: Analyzing trace with hash -1282322970, now seen corresponding path program 1 times [2025-03-17 14:52:04,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:52:04,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314414359] [2025-03-17 14:52:04,889 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:52:04,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:52:04,892 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-17 14:52:04,894 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-17 14:52:04,895 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:52:04,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:52:04,943 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-17 14:52:04,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:52:04,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314414359] [2025-03-17 14:52:04,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314414359] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:52:04,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:52:04,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 14:52:04,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805536711] [2025-03-17 14:52:04,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:52:04,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:52:04,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:52:04,944 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:52:04,944 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:52:04,945 INFO L87 Difference]: Start difference. First operand 73 states and 78 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:52:05,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:52:05,041 INFO L93 Difference]: Finished difference Result 76 states and 78 transitions. [2025-03-17 14:52:05,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:52:05,042 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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 15 [2025-03-17 14:52:05,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:52:05,042 INFO L225 Difference]: With dead ends: 76 [2025-03-17 14:52:05,042 INFO L226 Difference]: Without dead ends: 74 [2025-03-17 14:52:05,043 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:52:05,043 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 39 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 31 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-17 14:52:05,043 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 31 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 14:52:05,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2025-03-17 14:52:05,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 72. [2025-03-17 14:52:05,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 49 states have (on average 1.530612244897959) internal successors, (75), 71 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:52:05,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 75 transitions. [2025-03-17 14:52:05,048 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 75 transitions. Word has length 15 [2025-03-17 14:52:05,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:52:05,048 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 75 transitions. [2025-03-17 14:52:05,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:52:05,048 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 75 transitions. [2025-03-17 14:52:05,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-17 14:52:05,049 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:52:05,049 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:52:05,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 14:52:05,049 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-17 14:52:05,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:52:05,049 INFO L85 PathProgramCache]: Analyzing trace with hash -859330398, now seen corresponding path program 1 times [2025-03-17 14:52:05,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:52:05,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922172898] [2025-03-17 14:52:05,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:52:05,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:52:05,054 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-17 14:52:05,061 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-17 14:52:05,061 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:52:05,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:52:05,099 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-17 14:52:05,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:52:05,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922172898] [2025-03-17 14:52:05,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922172898] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:52:05,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:52:05,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 14:52:05,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602225871] [2025-03-17 14:52:05,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:52:05,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:52:05,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:52:05,100 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:52:05,100 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:52:05,100 INFO L87 Difference]: Start difference. First operand 72 states and 75 transitions. Second operand has 3 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:52:05,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:52:05,106 INFO L93 Difference]: Finished difference Result 72 states and 75 transitions. [2025-03-17 14:52:05,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:52:05,107 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 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 19 [2025-03-17 14:52:05,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:52:05,107 INFO L225 Difference]: With dead ends: 72 [2025-03-17 14:52:05,107 INFO L226 Difference]: Without dead ends: 71 [2025-03-17 14:52:05,107 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:52:05,108 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 28 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 45 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-17 14:52:05,108 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 45 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:52:05,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2025-03-17 14:52:05,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2025-03-17 14:52:05,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 49 states have (on average 1.489795918367347) internal successors, (73), 70 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-17 14:52:05,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 73 transitions. [2025-03-17 14:52:05,114 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 73 transitions. Word has length 19 [2025-03-17 14:52:05,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:52:05,114 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 73 transitions. [2025-03-17 14:52:05,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:52:05,114 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 73 transitions. [2025-03-17 14:52:05,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-17 14:52:05,115 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:52:05,115 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-17 14:52:05,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 14:52:05,115 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-17 14:52:05,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:52:05,115 INFO L85 PathProgramCache]: Analyzing trace with hash -869438579, now seen corresponding path program 1 times [2025-03-17 14:52:05,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:52:05,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899406964] [2025-03-17 14:52:05,115 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:52:05,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:52:05,120 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-17 14:52:05,122 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-17 14:52:05,122 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:52:05,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:52:05,146 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-17 14:52:05,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:52:05,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899406964] [2025-03-17 14:52:05,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899406964] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:52:05,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:52:05,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 14:52:05,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743022342] [2025-03-17 14:52:05,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:52:05,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:52:05,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:52:05,148 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:52:05,148 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:52:05,148 INFO L87 Difference]: Start difference. First operand 71 states and 73 transitions. Second operand has 3 states, 2 states have (on average 10.0) internal successors, (20), 2 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-17 14:52:05,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:52:05,155 INFO L93 Difference]: Finished difference Result 72 states and 73 transitions. [2025-03-17 14:52:05,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:52:05,155 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 2 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-17 14:52:05,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:52:05,155 INFO L225 Difference]: With dead ends: 72 [2025-03-17 14:52:05,155 INFO L226 Difference]: Without dead ends: 71 [2025-03-17 14:52:05,156 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:52:05,156 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 0 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 90 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-17 14:52:05,156 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 90 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:52:05,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2025-03-17 14:52:05,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2025-03-17 14:52:05,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 49 states have (on average 1.469387755102041) internal successors, (72), 70 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-17 14:52:05,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 72 transitions. [2025-03-17 14:52:05,161 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 72 transitions. Word has length 20 [2025-03-17 14:52:05,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:52:05,161 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 72 transitions. [2025-03-17 14:52:05,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 2 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-17 14:52:05,161 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 72 transitions. [2025-03-17 14:52:05,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-17 14:52:05,162 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:52:05,162 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-17 14:52:05,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 14:52:05,162 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-17 14:52:05,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:52:05,165 INFO L85 PathProgramCache]: Analyzing trace with hash -1182792192, now seen corresponding path program 1 times [2025-03-17 14:52:05,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:52:05,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356421264] [2025-03-17 14:52:05,165 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:52:05,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:52:05,169 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-17 14:52:05,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-17 14:52:05,176 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:52:05,176 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:52:05,211 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-17 14:52:05,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:52:05,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356421264] [2025-03-17 14:52:05,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356421264] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:52:05,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:52:05,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 14:52:05,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487184682] [2025-03-17 14:52:05,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:52:05,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:52:05,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:52:05,212 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:52:05,212 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:52:05,213 INFO L87 Difference]: Start difference. First operand 71 states and 72 transitions. Second operand has 3 states, 2 states have (on average 10.5) internal successors, (21), 2 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-17 14:52:05,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:52:05,255 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2025-03-17 14:52:05,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:52:05,256 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 2 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-17 14:52:05,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:52:05,256 INFO L225 Difference]: With dead ends: 72 [2025-03-17 14:52:05,256 INFO L226 Difference]: Without dead ends: 71 [2025-03-17 14:52:05,256 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:52:05,257 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 1 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 42 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-17 14:52:05,258 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 42 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:52:05,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2025-03-17 14:52:05,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2025-03-17 14:52:05,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 49 states have (on average 1.4489795918367347) internal successors, (71), 70 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:52:05,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2025-03-17 14:52:05,265 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 21 [2025-03-17 14:52:05,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:52:05,265 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2025-03-17 14:52:05,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 2 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-17 14:52:05,265 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2025-03-17 14:52:05,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-17 14:52:05,266 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:52:05,266 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] [2025-03-17 14:52:05,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 14:52:05,266 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-17 14:52:05,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:52:05,266 INFO L85 PathProgramCache]: Analyzing trace with hash 1308827836, now seen corresponding path program 1 times [2025-03-17 14:52:05,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:52:05,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928884772] [2025-03-17 14:52:05,266 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:52:05,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:52:05,274 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-17 14:52:05,277 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-17 14:52:05,277 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:52:05,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:52:05,310 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-17 14:52:05,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:52:05,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928884772] [2025-03-17 14:52:05,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928884772] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:52:05,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:52:05,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 14:52:05,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034619331] [2025-03-17 14:52:05,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:52:05,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:52:05,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:52:05,314 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:52:05,314 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:52:05,314 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand has 3 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:52:05,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:52:05,352 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2025-03-17 14:52:05,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:52:05,353 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 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 25 [2025-03-17 14:52:05,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:52:05,353 INFO L225 Difference]: With dead ends: 71 [2025-03-17 14:52:05,353 INFO L226 Difference]: Without dead ends: 69 [2025-03-17 14:52:05,353 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:52:05,354 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 8 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 16 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-17 14:52:05,354 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 16 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:52:05,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2025-03-17 14:52:05,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2025-03-17 14:52:05,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 49 states have (on average 1.4081632653061225) 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-17 14:52:05,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2025-03-17 14:52:05,360 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 25 [2025-03-17 14:52:05,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:52:05,360 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2025-03-17 14:52:05,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:52:05,361 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2025-03-17 14:52:05,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-17 14:52:05,361 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:52:05,361 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-17 14:52:05,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 14:52:05,363 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-17 14:52:05,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:52:05,363 INFO L85 PathProgramCache]: Analyzing trace with hash 1918957223, now seen corresponding path program 1 times [2025-03-17 14:52:05,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:52:05,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915584433] [2025-03-17 14:52:05,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:52:05,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:52:05,370 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-17 14:52:05,374 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-17 14:52:05,374 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:52:05,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:52:05,401 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-17 14:52:05,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:52:05,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915584433] [2025-03-17 14:52:05,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915584433] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:52:05,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:52:05,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 14:52:05,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698998679] [2025-03-17 14:52:05,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:52:05,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:52:05,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:52:05,402 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:52:05,402 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:52:05,402 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand has 3 states, 2 states have (on average 13.0) internal successors, (26), 2 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-17 14:52:05,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:52:05,469 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2025-03-17 14:52:05,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:52:05,469 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 13.0) internal successors, (26), 2 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-17 14:52:05,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:52:05,470 INFO L225 Difference]: With dead ends: 72 [2025-03-17 14:52:05,470 INFO L226 Difference]: Without dead ends: 71 [2025-03-17 14:52:05,470 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:52:05,471 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 0 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 44 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-17 14:52:05,471 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 44 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:52:05,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2025-03-17 14:52:05,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2025-03-17 14:52:05,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 51 states have (on average 1.392156862745098) internal successors, (71), 70 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:52:05,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2025-03-17 14:52:05,474 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 26 [2025-03-17 14:52:05,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:52:05,474 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2025-03-17 14:52:05,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 13.0) internal successors, (26), 2 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-17 14:52:05,475 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2025-03-17 14:52:05,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-17 14:52:05,475 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:52:05,475 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-17 14:52:05,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 14:52:05,475 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-17 14:52:05,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:52:05,476 INFO L85 PathProgramCache]: Analyzing trace with hash -641868212, now seen corresponding path program 1 times [2025-03-17 14:52:05,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:52:05,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860301771] [2025-03-17 14:52:05,476 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:52:05,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:52:05,479 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-17 14:52:05,485 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-17 14:52:05,485 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:52:05,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 14:52:05,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1853518776] [2025-03-17 14:52:05,485 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:52:05,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:52:05,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:52:05,487 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:52:05,489 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 14:52:05,510 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-17 14:52:05,518 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-17 14:52:05,519 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:52:05,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:52:05,519 INFO L256 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 14:52:05,520 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:52:05,636 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-17 14:52:05,636 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:52:05,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:52:05,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860301771] [2025-03-17 14:52:05,637 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-17 14:52:05,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1853518776] [2025-03-17 14:52:05,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1853518776] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:52:05,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:52:05,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:52:05,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798219560] [2025-03-17 14:52:05,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:52:05,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:52:05,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:52:05,639 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:52:05,639 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:52:05,639 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand has 5 states, 4 states have (on average 6.75) internal successors, (27), 4 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-17 14:52:05,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:52:05,774 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2025-03-17 14:52:05,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 14:52:05,774 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.75) internal successors, (27), 4 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-17 14:52:05,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:52:05,775 INFO L225 Difference]: With dead ends: 71 [2025-03-17 14:52:05,775 INFO L226 Difference]: Without dead ends: 68 [2025-03-17 14:52:05,775 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 23 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-17 14:52:05,776 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 26 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 27 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-17 14:52:05,776 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 27 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 14:52:05,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2025-03-17 14:52:05,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2025-03-17 14:52:05,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 51 states have (on average 1.3333333333333333) internal successors, (68), 67 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:52:05,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2025-03-17 14:52:05,780 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 27 [2025-03-17 14:52:05,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:52:05,780 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2025-03-17 14:52:05,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.75) internal successors, (27), 4 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-17 14:52:05,780 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2025-03-17 14:52:05,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-17 14:52:05,781 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:52:05,781 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] [2025-03-17 14:52:05,788 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-17 14:52:05,986 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-17 14:52:05,986 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-17 14:52:05,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:52:05,986 INFO L85 PathProgramCache]: Analyzing trace with hash 1576921925, now seen corresponding path program 1 times [2025-03-17 14:52:05,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:52:05,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254504329] [2025-03-17 14:52:05,986 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:52:05,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:52:05,990 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-17 14:52:05,993 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-17 14:52:05,993 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:52:05,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 14:52:05,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1105231356] [2025-03-17 14:52:05,993 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:52:05,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:52:05,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:52:05,995 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:52:05,995 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-17 14:52:06,020 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-17 14:52:06,026 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-17 14:52:06,026 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:52:06,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:52:06,027 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 14:52:06,027 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:52:06,120 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-17 14:52:06,120 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:52:06,583 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-17 14:52:06,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:52:06,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254504329] [2025-03-17 14:52:06,584 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-17 14:52:06,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1105231356] [2025-03-17 14:52:06,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1105231356] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:52:06,584 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 14:52:06,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2025-03-17 14:52:06,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924502259] [2025-03-17 14:52:06,584 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 14:52:06,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 14:52:06,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:52:06,585 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 14:52:06,585 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2025-03-17 14:52:06,585 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand has 8 states, 7 states have (on average 8.0) internal successors, (56), 7 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-17 14:52:07,917 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2025-03-17 14:52:09,031 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2025-03-17 14:52:09,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:52:09,174 INFO L93 Difference]: Finished difference Result 103 states and 113 transitions. [2025-03-17 14:52:09,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 14:52:09,174 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 8.0) internal successors, (56), 7 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) Word has length 28 [2025-03-17 14:52:09,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:52:09,175 INFO L225 Difference]: With dead ends: 103 [2025-03-17 14:52:09,175 INFO L226 Difference]: Without dead ends: 99 [2025-03-17 14:52:09,175 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 48 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-17 14:52:09,176 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 75 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 6 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-03-17 14:52:09,176 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 45 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 203 Invalid, 2 Unknown, 0 Unchecked, 2.6s Time] [2025-03-17 14:52:09,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-03-17 14:52:09,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 95. [2025-03-17 14:52:09,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 78 states have (on average 1.3846153846153846) internal successors, (108), 94 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-17 14:52:09,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 108 transitions. [2025-03-17 14:52:09,180 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 108 transitions. Word has length 28 [2025-03-17 14:52:09,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:52:09,180 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 108 transitions. [2025-03-17 14:52:09,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 8.0) internal successors, (56), 7 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-17 14:52:09,180 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 108 transitions. [2025-03-17 14:52:09,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-17 14:52:09,181 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:52:09,181 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] [2025-03-17 14:52:09,188 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-17 14:52:09,382 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-17 14:52:09,382 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-17 14:52:09,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:52:09,383 INFO L85 PathProgramCache]: Analyzing trace with hash 1639939434, now seen corresponding path program 1 times [2025-03-17 14:52:09,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:52:09,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091931900] [2025-03-17 14:52:09,383 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:52:09,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:52:09,388 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-17 14:52:09,391 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-17 14:52:09,391 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:52:09,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:52:09,427 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-17 14:52:09,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:52:09,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091931900] [2025-03-17 14:52:09,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091931900] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:52:09,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1432561008] [2025-03-17 14:52:09,428 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:52:09,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:52:09,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:52:09,432 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:52:09,433 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-17 14:52:09,450 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-17 14:52:09,456 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-17 14:52:09,456 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:52:09,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:52:09,457 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 14:52:09,458 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:52:09,519 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-17 14:52:09,519 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:52:09,560 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-17 14:52:09,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1432561008] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:52:09,560 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:52:09,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 5 [2025-03-17 14:52:09,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676396037] [2025-03-17 14:52:09,561 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:52:09,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 14:52:09,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:52:09,561 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 14:52:09,561 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-03-17 14:52:09,562 INFO L87 Difference]: Start difference. First operand 95 states and 108 transitions. Second operand has 7 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 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-17 14:52:09,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:52:09,698 INFO L93 Difference]: Finished difference Result 97 states and 108 transitions. [2025-03-17 14:52:09,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 14:52:09,699 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 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) Word has length 29 [2025-03-17 14:52:09,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:52:09,700 INFO L225 Difference]: With dead ends: 97 [2025-03-17 14:52:09,700 INFO L226 Difference]: Without dead ends: 96 [2025-03-17 14:52:09,700 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 53 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-17 14:52:09,701 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 40 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 14:52:09,701 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 71 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 14:52:09,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-03-17 14:52:09,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 95. [2025-03-17 14:52:09,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 78 states have (on average 1.3717948717948718) internal successors, (107), 94 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-17 14:52:09,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 107 transitions. [2025-03-17 14:52:09,705 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 107 transitions. Word has length 29 [2025-03-17 14:52:09,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:52:09,705 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 107 transitions. [2025-03-17 14:52:09,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 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-17 14:52:09,705 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 107 transitions. [2025-03-17 14:52:09,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-17 14:52:09,706 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:52:09,706 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] [2025-03-17 14:52:09,711 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-17 14:52:09,906 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-17 14:52:09,906 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-17 14:52:09,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:52:09,907 INFO L85 PathProgramCache]: Analyzing trace with hash -701485085, now seen corresponding path program 1 times [2025-03-17 14:52:09,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:52:09,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141369101] [2025-03-17 14:52:09,907 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:52:09,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:52:09,910 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-17 14:52:09,912 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-17 14:52:09,912 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:52:09,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:52:09,944 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-17 14:52:09,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:52:09,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141369101] [2025-03-17 14:52:09,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141369101] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:52:09,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1231641270] [2025-03-17 14:52:09,945 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:52:09,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:52:09,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:52:09,947 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:52:09,949 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-17 14:52:09,968 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-17 14:52:09,973 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-17 14:52:09,974 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:52:09,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:52:09,976 INFO L256 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 14:52:09,976 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:52:10,042 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-17 14:52:10,043 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:52:10,083 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-17 14:52:10,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1231641270] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:52:10,084 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:52:10,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 5 [2025-03-17 14:52:10,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554537007] [2025-03-17 14:52:10,084 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:52:10,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 14:52:10,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:52:10,085 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 14:52:10,085 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-17 14:52:10,085 INFO L87 Difference]: Start difference. First operand 95 states and 107 transitions. Second operand has 7 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:52:10,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:52:10,163 INFO L93 Difference]: Finished difference Result 97 states and 107 transitions. [2025-03-17 14:52:10,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 14:52:10,164 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 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-17 14:52:10,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:52:10,164 INFO L225 Difference]: With dead ends: 97 [2025-03-17 14:52:10,164 INFO L226 Difference]: Without dead ends: 96 [2025-03-17 14:52:10,165 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 55 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-17 14:52:10,165 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 56 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 14:52:10,165 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 42 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 14:52:10,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-03-17 14:52:10,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 95. [2025-03-17 14:52:10,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 78 states have (on average 1.358974358974359) internal successors, (106), 94 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:52:10,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 106 transitions. [2025-03-17 14:52:10,169 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 106 transitions. Word has length 30 [2025-03-17 14:52:10,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:52:10,169 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 106 transitions. [2025-03-17 14:52:10,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:52:10,169 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 106 transitions. [2025-03-17 14:52:10,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-17 14:52:10,170 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:52:10,170 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] [2025-03-17 14:52:10,177 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-17 14:52:10,370 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-17 14:52:10,370 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-17 14:52:10,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:52:10,371 INFO L85 PathProgramCache]: Analyzing trace with hash -271201144, now seen corresponding path program 1 times [2025-03-17 14:52:10,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:52:10,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148232120] [2025-03-17 14:52:10,371 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:52:10,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:52:10,374 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-17 14:52:10,377 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-17 14:52:10,377 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:52:10,377 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 14:52:10,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [967200282] [2025-03-17 14:52:10,377 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:52:10,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:52:10,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:52:10,379 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:52:10,381 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-17 14:52:10,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-17 14:52:10,403 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-17 14:52:10,403 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:52:10,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:52:10,404 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-17 14:52:10,404 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:52:10,556 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-17 14:52:10,556 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:52:10,659 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-17 14:52:10,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:52:10,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148232120] [2025-03-17 14:52:10,659 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-17 14:52:10,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [967200282] [2025-03-17 14:52:10,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [967200282] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:52:10,659 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 14:52:10,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2025-03-17 14:52:10,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664401874] [2025-03-17 14:52:10,659 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 14:52:10,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 14:52:10,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:52:10,660 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 14:52:10,660 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-03-17 14:52:10,660 INFO L87 Difference]: Start difference. First operand 95 states and 106 transitions. Second operand has 10 states, 9 states have (on average 6.888888888888889) internal successors, (62), 9 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:52:10,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:52:10,975 INFO L93 Difference]: Finished difference Result 104 states and 106 transitions. [2025-03-17 14:52:10,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 14:52:10,976 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.888888888888889) internal successors, (62), 9 states have internal predecessors, (62), 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-17 14:52:10,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:52:10,976 INFO L225 Difference]: With dead ends: 104 [2025-03-17 14:52:10,976 INFO L226 Difference]: Without dead ends: 95 [2025-03-17 14:52:10,976 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 52 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-17 14:52:10,977 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 56 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 313 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 27 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.2s IncrementalHoareTripleChecker+Time [2025-03-17 14:52:10,977 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 27 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 313 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 14:52:10,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2025-03-17 14:52:10,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 94. [2025-03-17 14:52:10,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 78 states have (on average 1.2307692307692308) internal successors, (96), 93 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:52:10,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 96 transitions. [2025-03-17 14:52:10,979 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 96 transitions. Word has length 31 [2025-03-17 14:52:10,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:52:10,980 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 96 transitions. [2025-03-17 14:52:10,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.888888888888889) internal successors, (62), 9 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:52:10,980 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 96 transitions. [2025-03-17 14:52:10,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-17 14:52:10,980 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:52:10,980 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] [2025-03-17 14:52:10,985 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-17 14:52:11,184 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-17 14:52:11,184 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-17 14:52:11,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:52:11,185 INFO L85 PathProgramCache]: Analyzing trace with hash 457520730, now seen corresponding path program 1 times [2025-03-17 14:52:11,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:52:11,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643783681] [2025-03-17 14:52:11,185 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:52:11,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:52:11,189 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-17 14:52:11,193 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-17 14:52:11,193 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:52:11,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:52:11,225 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-17 14:52:11,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:52:11,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643783681] [2025-03-17 14:52:11,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [643783681] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:52:11,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [125916271] [2025-03-17 14:52:11,226 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:52:11,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:52:11,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:52:11,228 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:52:11,229 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-17 14:52:11,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-17 14:52:11,254 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-17 14:52:11,255 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:52:11,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:52:11,255 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 14:52:11,256 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:52:11,298 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-17 14:52:11,298 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:52:11,353 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-17 14:52:11,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [125916271] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:52:11,353 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:52:11,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 4 [2025-03-17 14:52:11,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535844705] [2025-03-17 14:52:11,353 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:52:11,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 14:52:11,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:52:11,354 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 14:52:11,354 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 14:52:11,354 INFO L87 Difference]: Start difference. First operand 94 states and 96 transitions. Second operand has 6 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:52:11,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:52:11,369 INFO L93 Difference]: Finished difference Result 163 states and 165 transitions. [2025-03-17 14:52:11,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 14:52:11,369 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 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 45 [2025-03-17 14:52:11,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:52:11,370 INFO L225 Difference]: With dead ends: 163 [2025-03-17 14:52:11,370 INFO L226 Difference]: Without dead ends: 162 [2025-03-17 14:52:11,370 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 86 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-17 14:52:11,370 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 32 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:52:11,371 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 177 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:52:11,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2025-03-17 14:52:11,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 136. [2025-03-17 14:52:11,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 120 states have (on average 1.35) internal successors, (162), 135 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:52:11,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 162 transitions. [2025-03-17 14:52:11,375 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 162 transitions. Word has length 45 [2025-03-17 14:52:11,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:52:11,375 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 162 transitions. [2025-03-17 14:52:11,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:52:11,375 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 162 transitions. [2025-03-17 14:52:11,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-17 14:52:11,377 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:52:11,377 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] [2025-03-17 14:52:11,383 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-17 14:52:11,578 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-17 14:52:11,578 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-17 14:52:11,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:52:11,579 INFO L85 PathProgramCache]: Analyzing trace with hash -615074892, now seen corresponding path program 1 times [2025-03-17 14:52:11,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:52:11,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407365057] [2025-03-17 14:52:11,579 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:52:11,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:52:11,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-17 14:52:11,596 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-17 14:52:11,596 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:52:11,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:52:11,619 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-17 14:52:11,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:52:11,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407365057] [2025-03-17 14:52:11,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407365057] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:52:11,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:52:11,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 14:52:11,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752318952] [2025-03-17 14:52:11,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:52:11,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:52:11,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:52:11,620 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:52:11,620 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:52:11,620 INFO L87 Difference]: Start difference. First operand 136 states and 162 transitions. Second operand has 3 states, 2 states have (on average 20.0) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:52:11,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:52:11,668 INFO L93 Difference]: Finished difference Result 136 states and 162 transitions. [2025-03-17 14:52:11,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:52:11,669 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 20.0) internal successors, (40), 3 states have internal predecessors, (40), 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 51 [2025-03-17 14:52:11,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:52:11,669 INFO L225 Difference]: With dead ends: 136 [2025-03-17 14:52:11,669 INFO L226 Difference]: Without dead ends: 135 [2025-03-17 14:52:11,669 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-17 14:52:11,670 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 14 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 27 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.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:52:11,670 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 27 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:52:11,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2025-03-17 14:52:11,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2025-03-17 14:52:11,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 120 states have (on average 1.325) internal successors, (159), 134 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:52:11,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 159 transitions. [2025-03-17 14:52:11,675 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 159 transitions. Word has length 51 [2025-03-17 14:52:11,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:52:11,675 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 159 transitions. [2025-03-17 14:52:11,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 20.0) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:52:11,675 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 159 transitions. [2025-03-17 14:52:11,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-03-17 14:52:11,675 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:52:11,675 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] [2025-03-17 14:52:11,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-17 14:52:11,676 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-17 14:52:11,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:52:11,676 INFO L85 PathProgramCache]: Analyzing trace with hash -1365604035, now seen corresponding path program 2 times [2025-03-17 14:52:11,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:52:11,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404818783] [2025-03-17 14:52:11,676 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:52:11,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:52:11,681 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 54 statements into 2 equivalence classes. [2025-03-17 14:52:11,688 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 54 of 54 statements. [2025-03-17 14:52:11,688 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 14:52:11,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:52:11,768 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-17 14:52:11,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:52:11,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404818783] [2025-03-17 14:52:11,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404818783] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:52:11,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1708554308] [2025-03-17 14:52:11,768 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:52:11,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:52:11,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:52:11,770 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:52:11,771 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-17 14:52:11,787 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 54 statements into 2 equivalence classes. [2025-03-17 14:52:11,800 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 54 of 54 statements. [2025-03-17 14:52:11,800 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 14:52:11,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:52:11,800 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-17 14:52:11,801 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:52:11,968 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-17 14:52:11,968 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:52:12,054 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-17 14:52:12,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1708554308] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:52:12,054 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:52:12,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2025-03-17 14:52:12,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998669865] [2025-03-17 14:52:12,055 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:52:12,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 14:52:12,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:52:12,055 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 14:52:12,055 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2025-03-17 14:52:12,055 INFO L87 Difference]: Start difference. First operand 135 states and 159 transitions. Second operand has 13 states, 12 states have (on average 12.916666666666666) internal successors, (155), 12 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-17 14:52:12,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:52:12,335 INFO L93 Difference]: Finished difference Result 135 states and 159 transitions. [2025-03-17 14:52:12,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 14:52:12,336 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 12.916666666666666) internal successors, (155), 12 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) Word has length 54 [2025-03-17 14:52:12,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:52:12,336 INFO L225 Difference]: With dead ends: 135 [2025-03-17 14:52:12,336 INFO L226 Difference]: Without dead ends: 133 [2025-03-17 14:52:12,337 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 99 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-17 14:52:12,337 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 59 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 14:52:12,337 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 23 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 14:52:12,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2025-03-17 14:52:12,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2025-03-17 14:52:12,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 120 states have (on average 1.2833333333333334) internal successors, (154), 132 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-17 14:52:12,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 154 transitions. [2025-03-17 14:52:12,340 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 154 transitions. Word has length 54 [2025-03-17 14:52:12,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:52:12,341 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 154 transitions. [2025-03-17 14:52:12,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 12.916666666666666) internal successors, (155), 12 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-17 14:52:12,341 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 154 transitions. [2025-03-17 14:52:12,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-17 14:52:12,341 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:52:12,341 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] [2025-03-17 14:52:12,347 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-17 14:52:12,543 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-17 14:52:12,544 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-17 14:52:12,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:52:12,546 INFO L85 PathProgramCache]: Analyzing trace with hash 615947888, now seen corresponding path program 2 times [2025-03-17 14:52:12,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:52:12,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368474337] [2025-03-17 14:52:12,546 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:52:12,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:52:12,550 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 55 statements into 2 equivalence classes. [2025-03-17 14:52:12,554 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 55 of 55 statements. [2025-03-17 14:52:12,554 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 14:52:12,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:52:12,609 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-17 14:52:12,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:52:12,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368474337] [2025-03-17 14:52:12,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368474337] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:52:12,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [335775790] [2025-03-17 14:52:12,610 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:52:12,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:52:12,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:52:12,612 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:52:12,613 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-17 14:52:12,631 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 55 statements into 2 equivalence classes. [2025-03-17 14:52:12,640 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 55 of 55 statements. [2025-03-17 14:52:12,640 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 14:52:12,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:52:12,641 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-17 14:52:12,642 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:52:12,791 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-17 14:52:12,791 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:52:12,873 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-17 14:52:12,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [335775790] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:52:12,874 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:52:12,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2025-03-17 14:52:12,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782127574] [2025-03-17 14:52:12,874 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:52:12,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 14:52:12,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:52:12,875 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 14:52:12,875 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2025-03-17 14:52:12,875 INFO L87 Difference]: Start difference. First operand 133 states and 154 transitions. Second operand has 13 states, 12 states have (on average 13.083333333333334) internal successors, (157), 12 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-17 14:52:13,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:52:13,052 INFO L93 Difference]: Finished difference Result 136 states and 154 transitions. [2025-03-17 14:52:13,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 14:52:13,055 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 13.083333333333334) internal successors, (157), 12 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 55 [2025-03-17 14:52:13,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:52:13,056 INFO L225 Difference]: With dead ends: 136 [2025-03-17 14:52:13,056 INFO L226 Difference]: Without dead ends: 135 [2025-03-17 14:52:13,056 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 101 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-17 14:52:13,057 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 61 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 14:52:13,057 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 67 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 14:52:13,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2025-03-17 14:52:13,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 133. [2025-03-17 14:52:13,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 120 states have (on average 1.275) internal successors, (153), 132 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:52:13,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 153 transitions. [2025-03-17 14:52:13,063 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 153 transitions. Word has length 55 [2025-03-17 14:52:13,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:52:13,063 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 153 transitions. [2025-03-17 14:52:13,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 13.083333333333334) internal successors, (157), 12 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-17 14:52:13,063 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 153 transitions. [2025-03-17 14:52:13,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-17 14:52:13,063 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:52:13,063 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] [2025-03-17 14:52:13,070 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-17 14:52:13,268 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-17 14:52:13,268 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-17 14:52:13,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:52:13,268 INFO L85 PathProgramCache]: Analyzing trace with hash -779566130, now seen corresponding path program 1 times [2025-03-17 14:52:13,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:52:13,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551181854] [2025-03-17 14:52:13,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:52:13,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:52:13,272 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-17 14:52:13,275 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-17 14:52:13,275 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:52:13,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:52:13,347 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-17 14:52:13,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:52:13,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551181854] [2025-03-17 14:52:13,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551181854] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:52:13,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [509586622] [2025-03-17 14:52:13,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:52:13,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:52:13,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:52:13,350 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:52:13,352 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-17 14:52:13,368 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-17 14:52:13,377 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-17 14:52:13,378 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:52:13,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:52:13,378 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 14:52:13,380 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:52:13,610 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-17 14:52:13,610 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:52:26,301 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-17 14:52:26,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [509586622] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:52:26,302 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:52:26,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2025-03-17 14:52:26,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450969124] [2025-03-17 14:52:26,302 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:52:26,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-17 14:52:26,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:52:26,302 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-17 14:52:26,303 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=182, Unknown=5, NotChecked=0, Total=240 [2025-03-17 14:52:26,303 INFO L87 Difference]: Start difference. First operand 133 states and 153 transitions. Second operand has 16 states, 15 states have (on average 11.066666666666666) internal successors, (166), 15 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:52:26,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:52:26,742 INFO L93 Difference]: Finished difference Result 133 states and 153 transitions. [2025-03-17 14:52:26,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 14:52:26,743 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 11.066666666666666) internal successors, (166), 15 states have internal predecessors, (166), 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 57 [2025-03-17 14:52:26,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:52:26,743 INFO L225 Difference]: With dead ends: 133 [2025-03-17 14:52:26,743 INFO L226 Difference]: Without dead ends: 129 [2025-03-17 14:52:26,743 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 12.4s TimeCoverageRelationStatistics Valid=172, Invalid=375, Unknown=5, NotChecked=0, Total=552 [2025-03-17 14:52:26,744 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 112 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 14:52:26,744 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 25 Invalid, 334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 318 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 14:52:26,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2025-03-17 14:52:26,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2025-03-17 14:52:26,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 120 states have (on average 1.1833333333333333) internal successors, (142), 128 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:52:26,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 142 transitions. [2025-03-17 14:52:26,747 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 142 transitions. Word has length 57 [2025-03-17 14:52:26,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:52:26,747 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 142 transitions. [2025-03-17 14:52:26,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 11.066666666666666) internal successors, (166), 15 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:52:26,748 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 142 transitions. [2025-03-17 14:52:26,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-03-17 14:52:26,748 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:52:26,748 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] [2025-03-17 14:52:26,759 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-17 14:52:26,948 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-17 14:52:26,949 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-17 14:52:26,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:52:26,949 INFO L85 PathProgramCache]: Analyzing trace with hash -1838741204, now seen corresponding path program 1 times [2025-03-17 14:52:26,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:52:26,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672056610] [2025-03-17 14:52:26,949 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:52:26,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:52:26,955 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-17 14:52:26,960 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-17 14:52:26,960 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:52:26,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:52:27,014 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-17 14:52:27,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:52:27,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672056610] [2025-03-17 14:52:27,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672056610] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:52:27,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [948104780] [2025-03-17 14:52:27,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:52:27,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:52:27,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:52:27,016 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:52:27,018 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-17 14:52:27,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-17 14:52:27,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-17 14:52:27,047 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:52:27,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:52:27,047 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 14:52:27,048 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:52:27,173 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-17 14:52:27,174 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:52:27,256 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-17 14:52:27,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [948104780] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:52:27,256 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:52:27,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2025-03-17 14:52:27,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161165635] [2025-03-17 14:52:27,257 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:52:27,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 14:52:27,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:52:27,257 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 14:52:27,257 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-03-17 14:52:27,258 INFO L87 Difference]: Start difference. First operand 129 states and 142 transitions. Second operand has 13 states, 12 states have (on average 13.916666666666666) internal successors, (167), 12 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-17 14:52:27,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:52:27,417 INFO L93 Difference]: Finished difference Result 131 states and 142 transitions. [2025-03-17 14:52:27,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 14:52:27,418 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 13.916666666666666) internal successors, (167), 12 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 59 [2025-03-17 14:52:27,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:52:27,418 INFO L225 Difference]: With dead ends: 131 [2025-03-17 14:52:27,418 INFO L226 Difference]: Without dead ends: 130 [2025-03-17 14:52:27,418 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 109 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-17 14:52:27,419 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 92 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 14:52:27,419 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 57 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 14:52:27,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2025-03-17 14:52:27,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 129. [2025-03-17 14:52:27,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 120 states have (on average 1.1666666666666667) internal successors, (140), 128 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:52:27,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 140 transitions. [2025-03-17 14:52:27,422 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 140 transitions. Word has length 59 [2025-03-17 14:52:27,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:52:27,422 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 140 transitions. [2025-03-17 14:52:27,422 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 13.916666666666666) internal successors, (167), 12 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-17 14:52:27,422 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 140 transitions. [2025-03-17 14:52:27,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-17 14:52:27,422 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:52:27,422 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] [2025-03-17 14:52:27,428 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-03-17 14:52:27,623 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-17 14:52:27,623 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-17 14:52:27,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:52:27,623 INFO L85 PathProgramCache]: Analyzing trace with hash -1166402473, now seen corresponding path program 1 times [2025-03-17 14:52:27,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:52:27,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797210318] [2025-03-17 14:52:27,623 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:52:27,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:52:27,633 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-17 14:52:27,637 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-17 14:52:27,637 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:52:27,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 14:52:27,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [923507808] [2025-03-17 14:52:27,638 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:52:27,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:52:27,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:52:27,640 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:52:27,641 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-17 14:52:27,658 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-17 14:52:27,666 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-17 14:52:27,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:52:27,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:52:27,667 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-17 14:52:27,668 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:52:27,905 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-17 14:52:27,905 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:52:28,117 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-17 14:52:28,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:52:28,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797210318] [2025-03-17 14:52:28,118 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-17 14:52:28,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [923507808] [2025-03-17 14:52:28,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [923507808] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:52:28,118 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 14:52:28,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2025-03-17 14:52:28,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894862053] [2025-03-17 14:52:28,118 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 14:52:28,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-17 14:52:28,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:52:28,118 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-17 14:52:28,119 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2025-03-17 14:52:28,119 INFO L87 Difference]: Start difference. First operand 129 states and 140 transitions. Second operand has 16 states, 15 states have (on average 8.0) internal successors, (120), 15 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:52:29,499 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-17 14:52:29,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:52:29,871 INFO L93 Difference]: Finished difference Result 162 states and 177 transitions. [2025-03-17 14:52:29,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-17 14:52:29,871 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 8.0) internal successors, (120), 15 states have internal predecessors, (120), 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-17 14:52:29,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:52:29,872 INFO L225 Difference]: With dead ends: 162 [2025-03-17 14:52:29,872 INFO L226 Difference]: Without dead ends: 157 [2025-03-17 14:52:29,872 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 104 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-17 14:52:29,872 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 115 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 684 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 698 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 684 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-17 14:52:29,873 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 66 Invalid, 698 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 684 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-17 14:52:29,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2025-03-17 14:52:29,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 144. [2025-03-17 14:52:29,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 135 states have (on average 1.1333333333333333) internal successors, (153), 143 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:52:29,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 153 transitions. [2025-03-17 14:52:29,876 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 153 transitions. Word has length 60 [2025-03-17 14:52:29,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:52:29,876 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 153 transitions. [2025-03-17 14:52:29,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 8.0) internal successors, (120), 15 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:52:29,877 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 153 transitions. [2025-03-17 14:52:29,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-17 14:52:29,877 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:52:29,877 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] [2025-03-17 14:52:29,883 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-03-17 14:52:30,081 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-17 14:52:30,081 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-17 14:52:30,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:52:30,081 INFO L85 PathProgramCache]: Analyzing trace with hash -1821238299, now seen corresponding path program 2 times [2025-03-17 14:52:30,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:52:30,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645408295] [2025-03-17 14:52:30,082 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:52:30,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:52:30,085 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 78 statements into 2 equivalence classes. [2025-03-17 14:52:30,089 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 78 of 78 statements. [2025-03-17 14:52:30,089 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 14:52:30,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 14:52:30,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1992202246] [2025-03-17 14:52:30,090 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:52:30,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:52:30,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:52:30,092 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:52:30,093 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-17 14:52:30,114 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 78 statements into 2 equivalence classes. [2025-03-17 14:52:30,127 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 78 of 78 statements. [2025-03-17 14:52:30,127 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 14:52:30,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:52:30,128 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-17 14:52:30,129 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:52:30,329 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-17 14:52:30,329 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:52:31,450 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-17 14:52:31,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:52:31,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645408295] [2025-03-17 14:52:31,450 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-17 14:52:31,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1992202246] [2025-03-17 14:52:31,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1992202246] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:52:31,450 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 14:52:31,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2025-03-17 14:52:31,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855868564] [2025-03-17 14:52:31,450 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 14:52:31,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-17 14:52:31,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:52:31,451 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-17 14:52:31,451 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=159, Unknown=0, NotChecked=0, Total=240 [2025-03-17 14:52:31,451 INFO L87 Difference]: Start difference. First operand 144 states and 153 transitions. Second operand has 16 states, 15 states have (on average 10.4) internal successors, (156), 15 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-17 14:52:32,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:52:32,239 INFO L93 Difference]: Finished difference Result 193 states and 211 transitions. [2025-03-17 14:52:32,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-17 14:52:32,239 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 10.4) internal successors, (156), 15 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 78 [2025-03-17 14:52:32,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:52:32,241 INFO L225 Difference]: With dead ends: 193 [2025-03-17 14:52:32,241 INFO L226 Difference]: Without dead ends: 192 [2025-03-17 14:52:32,241 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=140, Invalid=240, Unknown=0, NotChecked=0, Total=380 [2025-03-17 14:52:32,241 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 199 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 716 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 725 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 716 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-17 14:52:32,241 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 147 Invalid, 725 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 716 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-17 14:52:32,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2025-03-17 14:52:32,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 187. [2025-03-17 14:52:32,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 178 states have (on average 1.1629213483146068) internal successors, (207), 186 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:52:32,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 207 transitions. [2025-03-17 14:52:32,246 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 207 transitions. Word has length 78 [2025-03-17 14:52:32,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:52:32,247 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 207 transitions. [2025-03-17 14:52:32,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 10.4) internal successors, (156), 15 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-17 14:52:32,247 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 207 transitions. [2025-03-17 14:52:32,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-17 14:52:32,247 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:52:32,247 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] [2025-03-17 14:52:32,253 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-03-17 14:52:32,447 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-17 14:52:32,448 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-17 14:52:32,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:52:32,448 INFO L85 PathProgramCache]: Analyzing trace with hash 2136651907, now seen corresponding path program 3 times [2025-03-17 14:52:32,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:52:32,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944946155] [2025-03-17 14:52:32,448 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 14:52:32,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:52:32,452 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 80 statements into 4 equivalence classes. [2025-03-17 14:52:32,458 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 80 of 80 statements. [2025-03-17 14:52:32,458 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-17 14:52:32,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:52:32,554 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-17 14:52:32,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:52:32,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944946155] [2025-03-17 14:52:32,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944946155] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:52:32,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1121018918] [2025-03-17 14:52:32,555 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 14:52:32,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:52:32,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:52:32,557 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:52:32,559 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-17 14:52:32,576 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 80 statements into 4 equivalence classes. [2025-03-17 14:52:32,582 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 30 of 80 statements. [2025-03-17 14:52:32,583 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-17 14:52:32,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:52:32,583 INFO L256 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 14:52:32,584 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:52:49,109 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~z~0#1_68| Int)) (and (<= (+ 6 |v_ULTIMATE.start_main_~z~0#1_68|) |c_ULTIMATE.start_main_~z~0#1|) (exists ((|v_ULTIMATE.start_main_~y~0#1_72| Int)) (let ((.cse1 (* |v_ULTIMATE.start_main_~y~0#1_72| 12))) (let ((.cse0 (div (+ 6 (* (- 1) |v_ULTIMATE.start_main_~y~0#1_72| |v_ULTIMATE.start_main_~z~0#1_68|) .cse1 (* (- 2) |v_ULTIMATE.start_main_~z~0#1_68|)) 18))) (and (<= (+ |v_ULTIMATE.start_main_~y~0#1_72| |v_ULTIMATE.start_main_~z~0#1_68|) |c_ULTIMATE.start_main_~y~0#1|) (<= (+ |c_ULTIMATE.start_main_~x~0#1| .cse0) |v_ULTIMATE.start_main_~y~0#1_72|) (= (mod (+ (* |v_ULTIMATE.start_main_~y~0#1_72| 17 |v_ULTIMATE.start_main_~z~0#1_68|) 6 .cse1 (* 16 |v_ULTIMATE.start_main_~z~0#1_68|)) 18) 0) (<= 0 (+ 119304647 .cse0)))))))) is different from true [2025-03-17 14:52:53,276 WARN L873 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~y~0#1| Int) (|ULTIMATE.start_main_~z~0#1| Int)) (and (exists ((|v_ULTIMATE.start_main_~z~0#1_68| Int)) (and (<= (+ 6 |v_ULTIMATE.start_main_~z~0#1_68|) |ULTIMATE.start_main_~z~0#1|) (exists ((|v_ULTIMATE.start_main_~y~0#1_72| Int)) (let ((.cse1 (* |v_ULTIMATE.start_main_~y~0#1_72| 12))) (let ((.cse0 (div (+ 6 (* (- 1) |v_ULTIMATE.start_main_~y~0#1_72| |v_ULTIMATE.start_main_~z~0#1_68|) .cse1 (* (- 2) |v_ULTIMATE.start_main_~z~0#1_68|)) 18))) (and (<= (+ |c_ULTIMATE.start_main_~x~0#1| .cse0) |v_ULTIMATE.start_main_~y~0#1_72|) (<= (+ |v_ULTIMATE.start_main_~y~0#1_72| |v_ULTIMATE.start_main_~z~0#1_68|) |ULTIMATE.start_main_~y~0#1|) (= (mod (+ (* |v_ULTIMATE.start_main_~y~0#1_72| 17 |v_ULTIMATE.start_main_~z~0#1_68|) 6 .cse1 (* 16 |v_ULTIMATE.start_main_~z~0#1_68|)) 18) 0) (<= 0 (+ 119304647 .cse0)))))))) (<= (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) 2147483647))) is different from true [2025-03-17 14:52:53,315 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-17 14:52:53,315 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:52:53,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1121018918] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:52:53,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 14:52:53,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 14 [2025-03-17 14:52:53,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596816077] [2025-03-17 14:52:53,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:52:53,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 14:52:53,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:52:53,316 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 14:52:53,316 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=129, Unknown=5, NotChecked=46, Total=210 [2025-03-17 14:52:53,316 INFO L87 Difference]: Start difference. First operand 187 states and 207 transitions. Second operand has 8 states, 7 states have (on average 7.428571428571429) internal successors, (52), 8 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:53:01,419 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-03-17 14:53:05,446 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-03-17 14:53:09,528 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-17 14:53:13,558 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-03-17 14:53:17,598 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-03-17 14:53:21,677 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-03-17 14:53:25,705 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-03-17 14:53:29,731 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-03-17 14:53:33,793 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-17 14:53:37,824 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-03-17 14:53:41,860 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-03-17 14:53:45,910 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0]