./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/termination-nla/hard2-both-nt.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/termination-nla/hard2-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 23ac641bc90237de255e915a5ed362430f6ac59f0f6642be7f9d8479ff0a7576 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 01:50:28,219 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 01:50:28,278 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-09 01:50:28,283 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 01:50:28,283 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 01:50:28,299 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 01:50:28,300 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 01:50:28,300 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 01:50:28,300 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 01:50:28,300 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 01:50:28,300 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 01:50:28,300 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 01:50:28,301 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 01:50:28,301 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 01:50:28,301 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 01:50:28,301 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 01:50:28,301 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-09 01:50:28,301 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 01:50:28,301 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 01:50:28,301 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 01:50:28,301 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 01:50:28,301 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-09 01:50:28,301 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 01:50:28,301 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-09 01:50:28,301 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-09 01:50:28,301 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 01:50:28,301 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 01:50:28,301 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-09 01:50:28,301 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 01:50:28,301 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 01:50:28,302 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 01:50:28,302 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 01:50:28,302 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 01:50:28,302 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 01:50:28,302 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:50:28,302 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 01:50:28,302 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 01:50:28,302 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-09 01:50:28,302 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-09 01:50:28,302 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 01:50:28,302 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 01:50:28,302 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 01:50:28,302 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 01:50:28,302 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 01:50:28,302 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 01:50:28,302 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 -> 23ac641bc90237de255e915a5ed362430f6ac59f0f6642be7f9d8479ff0a7576 [2025-03-09 01:50:28,496 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 01:50:28,501 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 01:50:28,503 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 01:50:28,503 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 01:50:28,504 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 01:50:28,504 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-nla/hard2-both-nt.c [2025-03-09 01:50:29,624 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c7539458d/6300550bf2c6400eb7e3382589bcb5ae/FLAG51276207f [2025-03-09 01:50:29,830 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 01:50:29,830 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-nla/hard2-both-nt.c [2025-03-09 01:50:29,850 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c7539458d/6300550bf2c6400eb7e3382589bcb5ae/FLAG51276207f [2025-03-09 01:50:30,198 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c7539458d/6300550bf2c6400eb7e3382589bcb5ae [2025-03-09 01:50:30,200 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 01:50:30,201 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 01:50:30,202 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 01:50:30,202 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 01:50:30,205 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 01:50:30,205 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:50:30" (1/1) ... [2025-03-09 01:50:30,206 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@561c575e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:50:30, skipping insertion in model container [2025-03-09 01:50:30,206 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:50:30" (1/1) ... [2025-03-09 01:50:30,218 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 01:50:30,313 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:50:30,316 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 01:50:30,326 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:50:30,334 INFO L204 MainTranslator]: Completed translation [2025-03-09 01:50:30,335 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:50:30 WrapperNode [2025-03-09 01:50:30,335 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 01:50:30,336 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 01:50:30,336 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 01:50:30,336 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 01:50:30,340 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:50:30" (1/1) ... [2025-03-09 01:50:30,342 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:50:30" (1/1) ... [2025-03-09 01:50:30,351 INFO L138 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 50 [2025-03-09 01:50:30,351 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 01:50:30,351 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 01:50:30,351 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 01:50:30,351 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 01:50:30,357 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:50:30" (1/1) ... [2025-03-09 01:50:30,357 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:50:30" (1/1) ... [2025-03-09 01:50:30,357 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:50:30" (1/1) ... [2025-03-09 01:50:30,362 INFO L175 MemorySlicer]: No memory access in input program. [2025-03-09 01:50:30,362 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:50:30" (1/1) ... [2025-03-09 01:50:30,362 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:50:30" (1/1) ... [2025-03-09 01:50:30,363 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:50:30" (1/1) ... [2025-03-09 01:50:30,364 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:50:30" (1/1) ... [2025-03-09 01:50:30,364 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:50:30" (1/1) ... [2025-03-09 01:50:30,364 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:50:30" (1/1) ... [2025-03-09 01:50:30,365 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 01:50:30,366 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 01:50:30,366 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 01:50:30,366 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 01:50:30,366 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:50:30" (1/1) ... [2025-03-09 01:50:30,370 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:50:30,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:50:30,393 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-09 01:50:30,396 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-09 01:50:30,413 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 01:50:30,413 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 01:50:30,444 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 01:50:30,445 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 01:50:30,574 INFO L? ?]: Removed 36 outVars from TransFormulas that were not future-live. [2025-03-09 01:50:30,574 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 01:50:30,579 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 01:50:30,579 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 01:50:30,580 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:50:30 BoogieIcfgContainer [2025-03-09 01:50:30,580 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 01:50:30,581 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 01:50:30,581 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 01:50:30,584 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 01:50:30,584 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 01:50:30" (1/3) ... [2025-03-09 01:50:30,584 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@950853c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:50:30, skipping insertion in model container [2025-03-09 01:50:30,584 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:50:30" (2/3) ... [2025-03-09 01:50:30,584 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@950853c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:50:30, skipping insertion in model container [2025-03-09 01:50:30,584 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:50:30" (3/3) ... [2025-03-09 01:50:30,585 INFO L128 eAbstractionObserver]: Analyzing ICFG hard2-both-nt.c [2025-03-09 01:50:30,597 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 01:50:30,599 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hard2-both-nt.c that has 1 procedures, 45 locations, 1 initial locations, 2 loop locations, and 18 error locations. [2025-03-09 01:50:30,640 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 01:50:30,650 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;@25ac8eb1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 01:50:30,650 INFO L334 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2025-03-09 01:50:30,654 INFO L276 IsEmpty]: Start isEmpty. Operand has 45 states, 26 states have (on average 1.8846153846153846) internal successors, (49), 44 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:50:30,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-03-09 01:50:30,657 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:50:30,658 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-03-09 01:50:30,659 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-09 01:50:30,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:50:30,664 INFO L85 PathProgramCache]: Analyzing trace with hash 77421, now seen corresponding path program 1 times [2025-03-09 01:50:30,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:50:30,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439569851] [2025-03-09 01:50:30,670 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:50:30,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:50:30,711 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 01:50:30,718 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 01:50:30,719 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:50:30,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 01:50:30,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [366599601] [2025-03-09 01:50:30,721 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:50:30,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:50:30,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:50:30,724 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:50:30,726 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-09 01:50:30,747 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 01:50:30,751 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 01:50:30,751 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:50:30,751 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:50:30,753 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 01:50:30,755 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:50:30,796 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-09 01:50:30,799 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 01:50:30,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:50:30,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439569851] [2025-03-09 01:50:30,801 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-09 01:50:30,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [366599601] [2025-03-09 01:50:30,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [366599601] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:50:30,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:50:30,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:50:30,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526203261] [2025-03-09 01:50:30,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:50:30,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:50:30,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:50:30,822 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:50:30,823 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:50:30,825 INFO L87 Difference]: Start difference. First operand has 45 states, 26 states have (on average 1.8846153846153846) internal successors, (49), 44 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:50:30,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:50:30,944 INFO L93 Difference]: Finished difference Result 99 states and 115 transitions. [2025-03-09 01:50:30,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:50:30,946 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2025-03-09 01:50:30,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:50:30,951 INFO L225 Difference]: With dead ends: 99 [2025-03-09 01:50:30,951 INFO L226 Difference]: Without dead ends: 61 [2025-03-09 01:50:30,953 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-09 01:50:30,956 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 19 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:50:30,957 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 46 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 01:50:30,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2025-03-09 01:50:30,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 57. [2025-03-09 01:50:30,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 39 states have (on average 1.7435897435897436) internal successors, (68), 56 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-09 01:50:30,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 68 transitions. [2025-03-09 01:50:30,992 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 68 transitions. Word has length 3 [2025-03-09 01:50:30,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:50:30,992 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 68 transitions. [2025-03-09 01:50:30,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:50:30,993 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 68 transitions. [2025-03-09 01:50:30,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-09 01:50:30,994 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:50:30,994 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-09 01:50:31,001 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-09 01:50:31,194 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-09 01:50:31,195 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-09 01:50:31,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:50:31,195 INFO L85 PathProgramCache]: Analyzing trace with hash -1988506444, now seen corresponding path program 1 times [2025-03-09 01:50:31,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:50:31,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881751415] [2025-03-09 01:50:31,195 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:50:31,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:50:31,199 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 01:50:31,204 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 01:50:31,204 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:50:31,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 01:50:31,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [888484643] [2025-03-09 01:50:31,205 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:50:31,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:50:31,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:50:31,207 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:50:31,209 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-09 01:50:31,228 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 01:50:31,232 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 01:50:31,233 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:50:31,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:50:31,234 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 01:50:31,234 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:50:31,256 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-09 01:50:31,256 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 01:50:31,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:50:31,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881751415] [2025-03-09 01:50:31,257 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-09 01:50:31,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [888484643] [2025-03-09 01:50:31,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [888484643] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:50:31,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:50:31,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:50:31,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599712046] [2025-03-09 01:50:31,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:50:31,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:50:31,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:50:31,258 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:50:31,259 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:50:31,259 INFO L87 Difference]: Start difference. First operand 57 states and 68 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:50:31,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:50:31,305 INFO L93 Difference]: Finished difference Result 79 states and 95 transitions. [2025-03-09 01:50:31,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:50:31,306 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-03-09 01:50:31,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:50:31,306 INFO L225 Difference]: With dead ends: 79 [2025-03-09 01:50:31,306 INFO L226 Difference]: Without dead ends: 77 [2025-03-09 01:50:31,307 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:50:31,307 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 31 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:50:31,307 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 47 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:50:31,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-03-09 01:50:31,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 67. [2025-03-09 01:50:31,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 49 states have (on average 1.6938775510204083) internal successors, (83), 66 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-09 01:50:31,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 83 transitions. [2025-03-09 01:50:31,316 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 83 transitions. Word has length 6 [2025-03-09 01:50:31,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:50:31,318 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 83 transitions. [2025-03-09 01:50:31,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:50:31,319 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 83 transitions. [2025-03-09 01:50:31,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-09 01:50:31,320 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:50:31,320 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-09 01:50:31,327 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-09 01:50:31,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2025-03-09 01:50:31,520 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-09 01:50:31,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:50:31,521 INFO L85 PathProgramCache]: Analyzing trace with hash -1988506404, now seen corresponding path program 1 times [2025-03-09 01:50:31,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:50:31,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422702719] [2025-03-09 01:50:31,521 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:50:31,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:50:31,524 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 01:50:31,528 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 01:50:31,528 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:50:31,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:50:31,569 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-09 01:50:31,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:50:31,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422702719] [2025-03-09 01:50:31,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422702719] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:50:31,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:50:31,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:50:31,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206911158] [2025-03-09 01:50:31,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:50:31,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:50:31,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:50:31,572 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:50:31,572 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:50:31,572 INFO L87 Difference]: Start difference. First operand 67 states and 83 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:50:31,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:50:31,604 INFO L93 Difference]: Finished difference Result 73 states and 83 transitions. [2025-03-09 01:50:31,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:50:31,605 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-03-09 01:50:31,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:50:31,605 INFO L225 Difference]: With dead ends: 73 [2025-03-09 01:50:31,605 INFO L226 Difference]: Without dead ends: 69 [2025-03-09 01:50:31,605 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-09 01:50:31,606 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 10 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:50:31,606 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 63 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:50:31,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2025-03-09 01:50:31,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2025-03-09 01:50:31,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 49 states have (on average 1.6122448979591837) internal successors, (79), 66 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-09 01:50:31,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 79 transitions. [2025-03-09 01:50:31,610 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 79 transitions. Word has length 6 [2025-03-09 01:50:31,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:50:31,610 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 79 transitions. [2025-03-09 01:50:31,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:50:31,610 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 79 transitions. [2025-03-09 01:50:31,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-09 01:50:31,611 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:50:31,611 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:50:31,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-09 01:50:31,611 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-09 01:50:31,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:50:31,611 INFO L85 PathProgramCache]: Analyzing trace with hash 305753938, now seen corresponding path program 1 times [2025-03-09 01:50:31,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:50:31,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48968236] [2025-03-09 01:50:31,611 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:50:31,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:50:31,614 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 01:50:31,619 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 01:50:31,619 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:50:31,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 01:50:31,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1929622825] [2025-03-09 01:50:31,620 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:50:31,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:50:31,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:50:31,624 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:50:31,625 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-09 01:50:31,640 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 01:50:31,643 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 01:50:31,643 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:50:31,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:50:31,644 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 01:50:31,644 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:50:31,702 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-09 01:50:31,702 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 01:50:31,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:50:31,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48968236] [2025-03-09 01:50:31,702 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-09 01:50:31,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1929622825] [2025-03-09 01:50:31,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1929622825] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:50:31,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:50:31,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:50:31,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713114479] [2025-03-09 01:50:31,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:50:31,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:50:31,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:50:31,704 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:50:31,704 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:50:31,704 INFO L87 Difference]: Start difference. First operand 67 states and 79 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:50:31,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:50:31,751 INFO L93 Difference]: Finished difference Result 74 states and 83 transitions. [2025-03-09 01:50:31,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:50:31,751 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-03-09 01:50:31,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:50:31,751 INFO L225 Difference]: With dead ends: 74 [2025-03-09 01:50:31,751 INFO L226 Difference]: Without dead ends: 73 [2025-03-09 01:50:31,752 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:50:31,752 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 25 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:50:31,752 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 40 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:50:31,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2025-03-09 01:50:31,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 67. [2025-03-09 01:50:31,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 49 states have (on average 1.5714285714285714) internal successors, (77), 66 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:50:31,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 77 transitions. [2025-03-09 01:50:31,760 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 77 transitions. Word has length 8 [2025-03-09 01:50:31,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:50:31,760 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 77 transitions. [2025-03-09 01:50:31,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:50:31,760 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 77 transitions. [2025-03-09 01:50:31,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-09 01:50:31,760 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:50:31,760 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:50:31,770 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-09 01:50:31,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:50:31,961 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-09 01:50:31,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:50:31,961 INFO L85 PathProgramCache]: Analyzing trace with hash 888437479, now seen corresponding path program 1 times [2025-03-09 01:50:31,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:50:31,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985197283] [2025-03-09 01:50:31,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:50:31,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:50:31,968 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 01:50:31,974 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 01:50:31,975 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:50:31,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 01:50:31,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1289473704] [2025-03-09 01:50:31,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:50:31,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:50:31,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:50:31,978 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:50:31,979 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-09 01:50:31,999 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 01:50:32,004 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 01:50:32,004 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:50:32,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:50:32,007 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 01:50:32,008 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:50:32,052 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-09 01:50:32,053 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 01:50:32,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:50:32,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985197283] [2025-03-09 01:50:32,053 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-09 01:50:32,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1289473704] [2025-03-09 01:50:32,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1289473704] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:50:32,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:50:32,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:50:32,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130820906] [2025-03-09 01:50:32,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:50:32,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:50:32,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:50:32,054 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:50:32,055 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:50:32,055 INFO L87 Difference]: Start difference. First operand 67 states and 77 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:50:32,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:50:32,092 INFO L93 Difference]: Finished difference Result 76 states and 85 transitions. [2025-03-09 01:50:32,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:50:32,092 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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 9 [2025-03-09 01:50:32,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:50:32,092 INFO L225 Difference]: With dead ends: 76 [2025-03-09 01:50:32,093 INFO L226 Difference]: Without dead ends: 75 [2025-03-09 01:50:32,093 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:50:32,093 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 25 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:50:32,093 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 37 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:50:32,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-03-09 01:50:32,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 67. [2025-03-09 01:50:32,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 49 states have (on average 1.530612244897959) internal successors, (75), 66 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-09 01:50:32,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 75 transitions. [2025-03-09 01:50:32,098 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 75 transitions. Word has length 9 [2025-03-09 01:50:32,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:50:32,098 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 75 transitions. [2025-03-09 01:50:32,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:50:32,098 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 75 transitions. [2025-03-09 01:50:32,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-09 01:50:32,099 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:50:32,099 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:50:32,106 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-09 01:50:32,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:50:32,303 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-09 01:50:32,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:50:32,303 INFO L85 PathProgramCache]: Analyzing trace with hash 1808975974, now seen corresponding path program 1 times [2025-03-09 01:50:32,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:50:32,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272045876] [2025-03-09 01:50:32,303 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:50:32,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:50:32,306 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-09 01:50:32,309 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-09 01:50:32,309 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:50:32,309 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 01:50:32,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1581348392] [2025-03-09 01:50:32,310 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:50:32,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:50:32,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:50:32,312 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:50:32,313 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-09 01:50:32,329 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-09 01:50:32,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-09 01:50:32,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:50:32,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:50:32,332 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 01:50:32,333 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:50:32,368 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-09 01:50:32,368 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 01:50:32,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:50:32,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272045876] [2025-03-09 01:50:32,368 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-09 01:50:32,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1581348392] [2025-03-09 01:50:32,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1581348392] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:50:32,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:50:32,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:50:32,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885989912] [2025-03-09 01:50:32,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:50:32,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:50:32,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:50:32,369 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:50:32,369 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:50:32,369 INFO L87 Difference]: Start difference. First operand 67 states and 75 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 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-09 01:50:32,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:50:32,449 INFO L93 Difference]: Finished difference Result 106 states and 128 transitions. [2025-03-09 01:50:32,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:50:32,449 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 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-09 01:50:32,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:50:32,451 INFO L225 Difference]: With dead ends: 106 [2025-03-09 01:50:32,452 INFO L226 Difference]: Without dead ends: 103 [2025-03-09 01:50:32,453 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:50:32,453 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 38 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:50:32,453 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 67 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 01:50:32,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2025-03-09 01:50:32,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 95. [2025-03-09 01:50:32,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 79 states have (on average 1.5063291139240507) internal successors, (119), 94 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:50:32,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 119 transitions. [2025-03-09 01:50:32,463 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 119 transitions. Word has length 10 [2025-03-09 01:50:32,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:50:32,463 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 119 transitions. [2025-03-09 01:50:32,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 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-09 01:50:32,464 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 119 transitions. [2025-03-09 01:50:32,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-09 01:50:32,467 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:50:32,467 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:50:32,476 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-09 01:50:32,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:50:32,667 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-09 01:50:32,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:50:32,668 INFO L85 PathProgramCache]: Analyzing trace with hash 243680358, now seen corresponding path program 1 times [2025-03-09 01:50:32,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:50:32,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845013755] [2025-03-09 01:50:32,668 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:50:32,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:50:32,670 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-09 01:50:32,673 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-09 01:50:32,674 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:50:32,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 01:50:32,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [971242101] [2025-03-09 01:50:32,674 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:50:32,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:50:32,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:50:32,676 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:50:32,678 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-09 01:50:32,692 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-09 01:50:32,696 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-09 01:50:32,696 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:50:32,696 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:50:32,696 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 01:50:32,697 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:50:32,730 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-09 01:50:32,730 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:50:32,876 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-09 01:50:32,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:50:32,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845013755] [2025-03-09 01:50:32,876 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-09 01:50:32,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [971242101] [2025-03-09 01:50:32,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [971242101] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:50:32,876 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-09 01:50:32,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2025-03-09 01:50:32,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240544161] [2025-03-09 01:50:32,877 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-09 01:50:32,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 01:50:32,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:50:32,877 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 01:50:32,877 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-09 01:50:32,877 INFO L87 Difference]: Start difference. First operand 95 states and 119 transitions. Second operand has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 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-09 01:50:33,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:50:33,036 INFO L93 Difference]: Finished difference Result 238 states and 322 transitions. [2025-03-09 01:50:33,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 01:50:33,036 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 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 11 [2025-03-09 01:50:33,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:50:33,037 INFO L225 Difference]: With dead ends: 238 [2025-03-09 01:50:33,037 INFO L226 Difference]: Without dead ends: 235 [2025-03-09 01:50:33,037 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-09 01:50:33,038 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 131 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:50:33,038 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 63 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 01:50:33,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2025-03-09 01:50:33,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 163. [2025-03-09 01:50:33,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 147 states have (on average 1.530612244897959) internal successors, (225), 162 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:50:33,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 225 transitions. [2025-03-09 01:50:33,056 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 225 transitions. Word has length 11 [2025-03-09 01:50:33,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:50:33,058 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 225 transitions. [2025-03-09 01:50:33,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 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-09 01:50:33,058 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 225 transitions. [2025-03-09 01:50:33,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-09 01:50:33,058 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:50:33,058 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:50:33,064 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-09 01:50:33,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:50:33,259 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-09 01:50:33,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:50:33,259 INFO L85 PathProgramCache]: Analyzing trace with hash -2046376893, now seen corresponding path program 1 times [2025-03-09 01:50:33,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:50:33,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415467071] [2025-03-09 01:50:33,259 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:50:33,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:50:33,262 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-09 01:50:33,268 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-09 01:50:33,268 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:50:33,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:50:33,307 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-09 01:50:33,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:50:33,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415467071] [2025-03-09 01:50:33,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415467071] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:50:33,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [997642966] [2025-03-09 01:50:33,307 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:50:33,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:50:33,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:50:33,310 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:50:33,311 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-09 01:50:33,327 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-09 01:50:33,333 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-09 01:50:33,333 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:50:33,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:50:33,333 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 01:50:33,334 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:50:33,353 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:50:33,353 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 01:50:33,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [997642966] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:50:33,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 01:50:33,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2025-03-09 01:50:33,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316789638] [2025-03-09 01:50:33,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:50:33,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:50:33,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:50:33,354 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:50:33,354 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:50:33,354 INFO L87 Difference]: Start difference. First operand 163 states and 225 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:50:33,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:50:33,397 INFO L93 Difference]: Finished difference Result 171 states and 225 transitions. [2025-03-09 01:50:33,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:50:33,398 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 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 13 [2025-03-09 01:50:33,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:50:33,398 INFO L225 Difference]: With dead ends: 171 [2025-03-09 01:50:33,416 INFO L226 Difference]: Without dead ends: 169 [2025-03-09 01:50:33,416 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:50:33,416 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 34 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:50:33,416 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 85 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:50:33,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2025-03-09 01:50:33,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 162. [2025-03-09 01:50:33,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 147 states have (on average 1.469387755102041) internal successors, (216), 161 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:50:33,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 216 transitions. [2025-03-09 01:50:33,429 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 216 transitions. Word has length 13 [2025-03-09 01:50:33,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:50:33,429 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 216 transitions. [2025-03-09 01:50:33,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:50:33,429 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 216 transitions. [2025-03-09 01:50:33,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-09 01:50:33,430 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:50:33,430 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-03-09 01:50:33,438 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-09 01:50:33,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:50:33,630 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-09 01:50:33,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:50:33,631 INFO L85 PathProgramCache]: Analyzing trace with hash 986825763, now seen corresponding path program 1 times [2025-03-09 01:50:33,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:50:33,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713130109] [2025-03-09 01:50:33,631 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:50:33,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:50:33,633 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-09 01:50:33,636 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-09 01:50:33,636 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:50:33,636 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:50:33,681 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-09 01:50:33,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:50:33,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713130109] [2025-03-09 01:50:33,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713130109] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:50:33,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1639828942] [2025-03-09 01:50:33,683 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:50:33,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:50:33,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:50:33,686 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:50:33,688 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-09 01:50:33,703 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-09 01:50:33,707 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-09 01:50:33,708 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:50:33,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:50:33,709 INFO L256 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 01:50:33,709 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:50:33,727 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-09 01:50:33,727 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:50:33,748 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-09 01:50:33,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1639828942] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:50:33,749 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:50:33,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-03-09 01:50:33,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731947357] [2025-03-09 01:50:33,749 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:50:33,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 01:50:33,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:50:33,750 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 01:50:33,750 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-09 01:50:33,750 INFO L87 Difference]: Start difference. First operand 162 states and 216 transitions. Second operand has 7 states, 6 states have (on average 5.5) internal successors, (33), 7 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:50:33,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:50:33,819 INFO L93 Difference]: Finished difference Result 244 states and 314 transitions. [2025-03-09 01:50:33,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 01:50:33,820 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.5) internal successors, (33), 7 states have internal predecessors, (33), 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 14 [2025-03-09 01:50:33,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:50:33,821 INFO L225 Difference]: With dead ends: 244 [2025-03-09 01:50:33,821 INFO L226 Difference]: Without dead ends: 242 [2025-03-09 01:50:33,821 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-09 01:50:33,821 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 120 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:50:33,821 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 110 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 01:50:33,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2025-03-09 01:50:33,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 212. [2025-03-09 01:50:33,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 197 states have (on average 1.4517766497461928) internal successors, (286), 211 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:50:33,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 286 transitions. [2025-03-09 01:50:33,834 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 286 transitions. Word has length 14 [2025-03-09 01:50:33,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:50:33,835 INFO L471 AbstractCegarLoop]: Abstraction has 212 states and 286 transitions. [2025-03-09 01:50:33,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.5) internal successors, (33), 7 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:50:33,835 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 286 transitions. [2025-03-09 01:50:33,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-09 01:50:33,835 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:50:33,835 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:50:33,841 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-09 01:50:34,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2025-03-09 01:50:34,037 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-09 01:50:34,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:50:34,037 INFO L85 PathProgramCache]: Analyzing trace with hash 1634227467, now seen corresponding path program 1 times [2025-03-09 01:50:34,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:50:34,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334510206] [2025-03-09 01:50:34,037 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:50:34,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:50:34,042 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-09 01:50:34,051 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-09 01:50:34,051 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:50:34,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:50:34,085 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-09 01:50:34,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:50:34,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334510206] [2025-03-09 01:50:34,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334510206] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:50:34,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:50:34,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:50:34,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290874939] [2025-03-09 01:50:34,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:50:34,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:50:34,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:50:34,086 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:50:34,086 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:50:34,086 INFO L87 Difference]: Start difference. First operand 212 states and 286 transitions. Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:50:34,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:50:34,119 INFO L93 Difference]: Finished difference Result 212 states and 286 transitions. [2025-03-09 01:50:34,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:50:34,119 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-03-09 01:50:34,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:50:34,120 INFO L225 Difference]: With dead ends: 212 [2025-03-09 01:50:34,120 INFO L226 Difference]: Without dead ends: 211 [2025-03-09 01:50:34,120 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-09 01:50:34,121 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 1 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:50:34,121 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 55 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:50:34,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2025-03-09 01:50:34,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2025-03-09 01:50:34,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 197 states have (on average 1.4213197969543148) internal successors, (280), 210 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:50:34,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 280 transitions. [2025-03-09 01:50:34,129 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 280 transitions. Word has length 16 [2025-03-09 01:50:34,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:50:34,129 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 280 transitions. [2025-03-09 01:50:34,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:50:34,130 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 280 transitions. [2025-03-09 01:50:34,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-09 01:50:34,130 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:50:34,130 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:50:34,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-09 01:50:34,130 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-09 01:50:34,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:50:34,130 INFO L85 PathProgramCache]: Analyzing trace with hash -878556098, now seen corresponding path program 1 times [2025-03-09 01:50:34,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:50:34,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091965292] [2025-03-09 01:50:34,130 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:50:34,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:50:34,133 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-09 01:50:34,136 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-09 01:50:34,136 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:50:34,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:50:34,193 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-09 01:50:34,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:50:34,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091965292] [2025-03-09 01:50:34,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091965292] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:50:34,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:50:34,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:50:34,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605027197] [2025-03-09 01:50:34,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:50:34,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:50:34,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:50:34,194 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:50:34,194 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:50:34,194 INFO L87 Difference]: Start difference. First operand 211 states and 280 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:50:34,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:50:34,274 INFO L93 Difference]: Finished difference Result 247 states and 331 transitions. [2025-03-09 01:50:34,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:50:34,274 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 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 17 [2025-03-09 01:50:34,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:50:34,275 INFO L225 Difference]: With dead ends: 247 [2025-03-09 01:50:34,275 INFO L226 Difference]: Without dead ends: 246 [2025-03-09 01:50:34,276 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:50:34,276 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 18 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:50:34,276 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 67 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 01:50:34,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2025-03-09 01:50:34,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 223. [2025-03-09 01:50:34,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 209 states have (on average 1.4019138755980862) internal successors, (293), 222 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:50:34,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 293 transitions. [2025-03-09 01:50:34,285 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 293 transitions. Word has length 17 [2025-03-09 01:50:34,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:50:34,285 INFO L471 AbstractCegarLoop]: Abstraction has 223 states and 293 transitions. [2025-03-09 01:50:34,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:50:34,285 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 293 transitions. [2025-03-09 01:50:34,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-09 01:50:34,286 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:50:34,286 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:50:34,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-09 01:50:34,286 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-09 01:50:34,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:50:34,286 INFO L85 PathProgramCache]: Analyzing trace with hash -1465435287, now seen corresponding path program 1 times [2025-03-09 01:50:34,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:50:34,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743271876] [2025-03-09 01:50:34,286 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:50:34,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:50:34,289 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-09 01:50:34,292 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 01:50:34,292 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:50:34,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:50:34,427 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-09 01:50:34,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:50:34,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743271876] [2025-03-09 01:50:34,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743271876] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:50:34,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:50:34,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 01:50:34,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214435660] [2025-03-09 01:50:34,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:50:34,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 01:50:34,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:50:34,428 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 01:50:34,428 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-09 01:50:34,428 INFO L87 Difference]: Start difference. First operand 223 states and 293 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:50:34,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:50:34,544 INFO L93 Difference]: Finished difference Result 237 states and 308 transitions. [2025-03-09 01:50:34,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 01:50:34,545 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 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 18 [2025-03-09 01:50:34,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:50:34,546 INFO L225 Difference]: With dead ends: 237 [2025-03-09 01:50:34,546 INFO L226 Difference]: Without dead ends: 236 [2025-03-09 01:50:34,546 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2025-03-09 01:50:34,546 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 40 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:50:34,546 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 59 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 01:50:34,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2025-03-09 01:50:34,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 224. [2025-03-09 01:50:34,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 210 states have (on average 1.3952380952380952) internal successors, (293), 223 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:50:34,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 293 transitions. [2025-03-09 01:50:34,556 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 293 transitions. Word has length 18 [2025-03-09 01:50:34,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:50:34,556 INFO L471 AbstractCegarLoop]: Abstraction has 224 states and 293 transitions. [2025-03-09 01:50:34,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:50:34,556 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 293 transitions. [2025-03-09 01:50:34,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-09 01:50:34,557 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:50:34,557 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-09 01:50:34,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-09 01:50:34,557 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-09 01:50:34,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:50:34,557 INFO L85 PathProgramCache]: Analyzing trace with hash 1816146332, now seen corresponding path program 1 times [2025-03-09 01:50:34,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:50:34,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029858740] [2025-03-09 01:50:34,557 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:50:34,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:50:34,561 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-09 01:50:34,564 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-09 01:50:34,564 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:50:34,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:50:34,660 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-09 01:50:34,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:50:34,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029858740] [2025-03-09 01:50:34,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029858740] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:50:34,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:50:34,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 01:50:34,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469708069] [2025-03-09 01:50:34,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:50:34,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 01:50:34,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:50:34,661 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 01:50:34,661 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-09 01:50:34,661 INFO L87 Difference]: Start difference. First operand 224 states and 293 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 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-09 01:50:34,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:50:34,775 INFO L93 Difference]: Finished difference Result 237 states and 306 transitions. [2025-03-09 01:50:34,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 01:50:34,775 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 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-09 01:50:34,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:50:34,776 INFO L225 Difference]: With dead ends: 237 [2025-03-09 01:50:34,776 INFO L226 Difference]: Without dead ends: 236 [2025-03-09 01:50:34,777 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2025-03-09 01:50:34,777 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 39 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:50:34,777 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 60 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 01:50:34,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2025-03-09 01:50:34,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 225. [2025-03-09 01:50:34,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 211 states have (on average 1.3886255924170616) internal successors, (293), 224 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:50:34,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 293 transitions. [2025-03-09 01:50:34,786 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 293 transitions. Word has length 19 [2025-03-09 01:50:34,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:50:34,786 INFO L471 AbstractCegarLoop]: Abstraction has 225 states and 293 transitions. [2025-03-09 01:50:34,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 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-09 01:50:34,786 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 293 transitions. [2025-03-09 01:50:34,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-09 01:50:34,787 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:50:34,787 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-09 01:50:34,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-09 01:50:34,787 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-09 01:50:34,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:50:34,787 INFO L85 PathProgramCache]: Analyzing trace with hash 465961443, now seen corresponding path program 1 times [2025-03-09 01:50:34,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:50:34,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350444600] [2025-03-09 01:50:34,787 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:50:34,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:50:34,790 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-09 01:50:34,793 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-09 01:50:34,793 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:50:34,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 01:50:34,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [569269007] [2025-03-09 01:50:34,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:50:34,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:50:34,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:50:34,798 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:50:34,799 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-09 01:50:34,818 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-09 01:50:34,825 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-09 01:50:34,825 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:50:34,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:50:34,825 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-09 01:50:34,826 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:50:34,987 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:50:34,987 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:50:39,607 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:50:39,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:50:39,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350444600] [2025-03-09 01:50:39,607 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-09 01:50:39,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [569269007] [2025-03-09 01:50:39,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [569269007] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:50:39,607 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-09 01:50:39,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2025-03-09 01:50:39,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178906263] [2025-03-09 01:50:39,607 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-09 01:50:39,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-09 01:50:39,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:50:39,608 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-09 01:50:39,608 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=55, Unknown=1, NotChecked=0, Total=90 [2025-03-09 01:50:39,608 INFO L87 Difference]: Start difference. First operand 225 states and 293 transitions. Second operand has 10 states, 9 states have (on average 4.333333333333333) internal successors, (39), 10 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:50:39,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:50:39,728 INFO L93 Difference]: Finished difference Result 243 states and 314 transitions. [2025-03-09 01:50:39,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 01:50:39,728 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.333333333333333) internal successors, (39), 10 states have internal predecessors, (39), 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-09 01:50:39,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:50:39,729 INFO L225 Difference]: With dead ends: 243 [2025-03-09 01:50:39,729 INFO L226 Difference]: Without dead ends: 240 [2025-03-09 01:50:39,729 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=41, Invalid=68, Unknown=1, NotChecked=0, Total=110 [2025-03-09 01:50:39,729 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 154 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:50:39,729 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 49 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 01:50:39,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2025-03-09 01:50:39,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 227. [2025-03-09 01:50:39,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 214 states have (on average 1.341121495327103) internal successors, (287), 226 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:50:39,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 287 transitions. [2025-03-09 01:50:39,737 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 287 transitions. Word has length 20 [2025-03-09 01:50:39,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:50:39,737 INFO L471 AbstractCegarLoop]: Abstraction has 227 states and 287 transitions. [2025-03-09 01:50:39,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.333333333333333) internal successors, (39), 10 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:50:39,737 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 287 transitions. [2025-03-09 01:50:39,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-09 01:50:39,737 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:50:39,737 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] [2025-03-09 01:50:39,744 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-09 01:50:39,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-09 01:50:39,938 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-09 01:50:39,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:50:39,938 INFO L85 PathProgramCache]: Analyzing trace with hash 1559902842, now seen corresponding path program 1 times [2025-03-09 01:50:39,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:50:39,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519970005] [2025-03-09 01:50:39,939 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:50:39,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:50:39,941 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-09 01:50:39,948 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-09 01:50:39,948 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:50:39,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 01:50:39,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [459333129] [2025-03-09 01:50:39,949 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:50:39,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:50:39,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:50:39,951 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:50:39,953 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-09 01:50:39,967 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-09 01:50:39,973 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-09 01:50:39,973 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:50:39,973 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:50:39,973 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-09 01:50:39,974 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:50:40,075 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-09 01:50:40,075 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:50:40,480 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-09 01:50:40,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:50:40,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519970005] [2025-03-09 01:50:40,481 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-09 01:50:40,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [459333129] [2025-03-09 01:50:40,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [459333129] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:50:40,481 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-09 01:50:40,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2025-03-09 01:50:40,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328183809] [2025-03-09 01:50:40,481 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-09 01:50:40,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-09 01:50:40,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:50:40,483 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-09 01:50:40,483 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-03-09 01:50:40,483 INFO L87 Difference]: Start difference. First operand 227 states and 287 transitions. Second operand has 8 states, 7 states have (on average 5.857142857142857) internal successors, (41), 8 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:50:40,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:50:40,551 INFO L93 Difference]: Finished difference Result 235 states and 293 transitions. [2025-03-09 01:50:40,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:50:40,552 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.857142857142857) internal successors, (41), 8 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-03-09 01:50:40,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:50:40,552 INFO L225 Difference]: With dead ends: 235 [2025-03-09 01:50:40,552 INFO L226 Difference]: Without dead ends: 231 [2025-03-09 01:50:40,553 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-03-09 01:50:40,554 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 61 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:50:40,554 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 42 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 01:50:40,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2025-03-09 01:50:40,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 226. [2025-03-09 01:50:40,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 215 states have (on average 1.2790697674418605) internal successors, (275), 225 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:50:40,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 275 transitions. [2025-03-09 01:50:40,564 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 275 transitions. Word has length 21 [2025-03-09 01:50:40,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:50:40,564 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 275 transitions. [2025-03-09 01:50:40,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.857142857142857) internal successors, (41), 8 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:50:40,564 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 275 transitions. [2025-03-09 01:50:40,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-09 01:50:40,564 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:50:40,564 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:50:40,571 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-09 01:50:40,765 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,SelfDestructingSolverStorable14 [2025-03-09 01:50:40,765 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-09 01:50:40,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:50:40,765 INFO L85 PathProgramCache]: Analyzing trace with hash -1255892518, now seen corresponding path program 1 times [2025-03-09 01:50:40,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:50:40,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267193533] [2025-03-09 01:50:40,765 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:50:40,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:50:40,768 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-09 01:50:40,772 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-09 01:50:40,772 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:50:40,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:50:40,832 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:50:40,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:50:40,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267193533] [2025-03-09 01:50:40,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267193533] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:50:40,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1091610012] [2025-03-09 01:50:40,833 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:50:40,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:50:40,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:50:40,836 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:50:40,837 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-09 01:50:40,852 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-09 01:50:40,858 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-09 01:50:40,859 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:50:40,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:50:40,860 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-09 01:50:40,861 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:50:40,878 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-09 01:50:40,878 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 01:50:40,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1091610012] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:50:40,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 01:50:40,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2025-03-09 01:50:40,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791926369] [2025-03-09 01:50:40,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:50:40,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:50:40,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:50:40,880 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:50:40,880 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:50:40,880 INFO L87 Difference]: Start difference. First operand 226 states and 275 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:50:40,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:50:40,927 INFO L93 Difference]: Finished difference Result 261 states and 314 transitions. [2025-03-09 01:50:40,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:50:40,928 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-03-09 01:50:40,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:50:40,928 INFO L225 Difference]: With dead ends: 261 [2025-03-09 01:50:40,928 INFO L226 Difference]: Without dead ends: 214 [2025-03-09 01:50:40,929 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:50:40,929 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 2 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:50:40,929 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 32 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:50:40,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2025-03-09 01:50:40,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 214. [2025-03-09 01:50:40,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 203 states have (on average 1.2857142857142858) internal successors, (261), 213 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:50:40,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 261 transitions. [2025-03-09 01:50:40,936 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 261 transitions. Word has length 21 [2025-03-09 01:50:40,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:50:40,936 INFO L471 AbstractCegarLoop]: Abstraction has 214 states and 261 transitions. [2025-03-09 01:50:40,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:50:40,936 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 261 transitions. [2025-03-09 01:50:40,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-09 01:50:40,936 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:50:40,936 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 1, 1, 1] [2025-03-09 01:50:40,943 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-09 01:50:41,137 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,SelfDestructingSolverStorable15 [2025-03-09 01:50:41,137 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-09 01:50:41,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:50:41,137 INFO L85 PathProgramCache]: Analyzing trace with hash 460941960, now seen corresponding path program 1 times [2025-03-09 01:50:41,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:50:41,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286071339] [2025-03-09 01:50:41,138 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:50:41,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:50:41,140 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-09 01:50:41,142 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-09 01:50:41,142 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:50:41,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:50:41,184 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:50:41,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:50:41,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286071339] [2025-03-09 01:50:41,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286071339] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:50:41,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2064380415] [2025-03-09 01:50:41,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:50:41,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:50:41,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:50:41,186 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:50:41,187 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-09 01:50:41,201 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-09 01:50:41,207 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-09 01:50:41,207 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:50:41,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:50:41,207 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 01:50:41,208 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:50:41,232 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:50:41,232 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:50:41,282 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:50:41,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2064380415] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:50:41,283 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:50:41,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8 [2025-03-09 01:50:41,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765041098] [2025-03-09 01:50:41,283 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:50:41,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-09 01:50:41,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:50:41,283 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-09 01:50:41,283 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2025-03-09 01:50:41,283 INFO L87 Difference]: Start difference. First operand 214 states and 261 transitions. Second operand has 9 states, 8 states have (on average 6.375) internal successors, (51), 9 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:50:41,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:50:41,400 INFO L93 Difference]: Finished difference Result 399 states and 477 transitions. [2025-03-09 01:50:41,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-09 01:50:41,400 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.375) internal successors, (51), 9 states have internal predecessors, (51), 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 23 [2025-03-09 01:50:41,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:50:41,401 INFO L225 Difference]: With dead ends: 399 [2025-03-09 01:50:41,402 INFO L226 Difference]: Without dead ends: 397 [2025-03-09 01:50:41,402 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2025-03-09 01:50:41,402 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 143 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:50:41,403 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 146 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 01:50:41,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2025-03-09 01:50:41,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 230. [2025-03-09 01:50:41,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 219 states have (on average 1.2922374429223744) internal successors, (283), 229 states have internal predecessors, (283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:50:41,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 283 transitions. [2025-03-09 01:50:41,413 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 283 transitions. Word has length 23 [2025-03-09 01:50:41,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:50:41,413 INFO L471 AbstractCegarLoop]: Abstraction has 230 states and 283 transitions. [2025-03-09 01:50:41,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.375) internal successors, (51), 9 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:50:41,413 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 283 transitions. [2025-03-09 01:50:41,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-09 01:50:41,414 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:50:41,414 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] [2025-03-09 01:50:41,419 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-03-09 01:50:41,614 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,SelfDestructingSolverStorable16 [2025-03-09 01:50:41,614 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-09 01:50:41,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:50:41,615 INFO L85 PathProgramCache]: Analyzing trace with hash 1050574455, now seen corresponding path program 1 times [2025-03-09 01:50:41,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:50:41,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215510711] [2025-03-09 01:50:41,615 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:50:41,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:50:41,617 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-09 01:50:41,620 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-09 01:50:41,620 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:50:41,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:50:41,676 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-09 01:50:41,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:50:41,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215510711] [2025-03-09 01:50:41,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215510711] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:50:41,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2131225253] [2025-03-09 01:50:41,676 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:50:41,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:50:41,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:50:41,678 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:50:41,680 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-09 01:50:41,696 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-09 01:50:41,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-09 01:50:41,702 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:50:41,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:50:41,703 INFO L256 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-09 01:50:41,704 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:50:41,762 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-09 01:50:41,763 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:50:41,790 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-09 01:50:41,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2131225253] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-09 01:50:41,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-09 01:50:41,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 5] total 10 [2025-03-09 01:50:41,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920587777] [2025-03-09 01:50:41,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:50:41,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:50:41,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:50:41,791 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:50:41,791 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-09 01:50:41,791 INFO L87 Difference]: Start difference. First operand 230 states and 283 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:50:41,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:50:41,816 INFO L93 Difference]: Finished difference Result 230 states and 283 transitions. [2025-03-09 01:50:41,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:50:41,817 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2025-03-09 01:50:41,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:50:41,817 INFO L225 Difference]: With dead ends: 230 [2025-03-09 01:50:41,818 INFO L226 Difference]: Without dead ends: 53 [2025-03-09 01:50:41,818 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-09 01:50:41,818 INFO L435 NwaCegarLoop]: 2 mSDtfsCounter, 0 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:50:41,818 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:50:41,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2025-03-09 01:50:41,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2025-03-09 01:50:41,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 51 states have (on average 1.0784313725490196) internal successors, (55), 52 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:50:41,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 55 transitions. [2025-03-09 01:50:41,822 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 55 transitions. Word has length 24 [2025-03-09 01:50:41,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:50:41,822 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 55 transitions. [2025-03-09 01:50:41,822 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:50:41,822 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 55 transitions. [2025-03-09 01:50:41,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-09 01:50:41,823 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:50:41,823 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 1, 1, 1] [2025-03-09 01:50:41,828 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-09 01:50:42,027 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,SelfDestructingSolverStorable17 [2025-03-09 01:50:42,027 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-09 01:50:42,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:50:42,028 INFO L85 PathProgramCache]: Analyzing trace with hash 1930769002, now seen corresponding path program 2 times [2025-03-09 01:50:42,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:50:42,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780138128] [2025-03-09 01:50:42,028 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:50:42,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:50:42,031 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 35 statements into 2 equivalence classes. [2025-03-09 01:50:42,034 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 35 of 35 statements. [2025-03-09 01:50:42,034 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:50:42,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:50:42,092 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 62 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:50:42,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:50:42,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780138128] [2025-03-09 01:50:42,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1780138128] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:50:42,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1001612572] [2025-03-09 01:50:42,093 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:50:42,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:50:42,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:50:42,095 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:50:42,097 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-09 01:50:42,111 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 35 statements into 2 equivalence classes. [2025-03-09 01:50:42,119 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 35 of 35 statements. [2025-03-09 01:50:42,119 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:50:42,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:50:42,120 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-09 01:50:42,120 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:50:42,157 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 62 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:50:42,158 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:50:42,220 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 62 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:50:42,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1001612572] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:50:42,220 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:50:42,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-03-09 01:50:42,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974822055] [2025-03-09 01:50:42,220 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:50:42,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-09 01:50:42,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:50:42,221 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-09 01:50:42,221 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-09 01:50:42,221 INFO L87 Difference]: Start difference. First operand 53 states and 55 transitions. Second operand has 13 states, 12 states have (on average 6.25) internal successors, (75), 13 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-09 01:50:42,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:50:42,266 INFO L93 Difference]: Finished difference Result 83 states and 88 transitions. [2025-03-09 01:50:42,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-09 01:50:42,266 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 6.25) internal successors, (75), 13 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) Word has length 35 [2025-03-09 01:50:42,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:50:42,267 INFO L225 Difference]: With dead ends: 83 [2025-03-09 01:50:42,267 INFO L226 Difference]: Without dead ends: 82 [2025-03-09 01:50:42,267 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-09 01:50:42,267 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 7 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 59 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-09 01:50:42,267 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 59 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:50:42,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-03-09 01:50:42,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 79. [2025-03-09 01:50:42,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 77 states have (on average 1.0649350649350648) internal successors, (82), 78 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-09 01:50:42,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 82 transitions. [2025-03-09 01:50:42,271 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 82 transitions. Word has length 35 [2025-03-09 01:50:42,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:50:42,272 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 82 transitions. [2025-03-09 01:50:42,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 6.25) internal successors, (75), 13 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-09 01:50:42,272 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 82 transitions. [2025-03-09 01:50:42,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-09 01:50:42,272 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:50:42,272 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 6, 1, 1, 1] [2025-03-09 01:50:42,278 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-03-09 01:50:42,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:50:42,473 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-09 01:50:42,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:50:42,474 INFO L85 PathProgramCache]: Analyzing trace with hash -821080504, now seen corresponding path program 2 times [2025-03-09 01:50:42,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:50:42,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807045604] [2025-03-09 01:50:42,474 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:50:42,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:50:42,477 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 51 statements into 2 equivalence classes. [2025-03-09 01:50:42,481 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 51 of 51 statements. [2025-03-09 01:50:42,481 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:50:42,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:50:42,601 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 147 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:50:42,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:50:42,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807045604] [2025-03-09 01:50:42,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807045604] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:50:42,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1130912896] [2025-03-09 01:50:42,602 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:50:42,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:50:42,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:50:42,603 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:50:42,605 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-09 01:50:42,619 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 51 statements into 2 equivalence classes. [2025-03-09 01:50:42,623 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 9 of 51 statements. [2025-03-09 01:50:42,623 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 01:50:42,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:50:42,623 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 01:50:42,624 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:50:42,686 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2025-03-09 01:50:42,686 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:50:42,889 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2025-03-09 01:50:42,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1130912896] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:50:42,890 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:50:42,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 4, 4] total 14 [2025-03-09 01:50:42,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135899521] [2025-03-09 01:50:42,890 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:50:42,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-09 01:50:42,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:50:42,891 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-09 01:50:42,892 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2025-03-09 01:50:42,892 INFO L87 Difference]: Start difference. First operand 79 states and 82 transitions. Second operand has 15 states, 14 states have (on average 5.357142857142857) internal successors, (75), 15 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-09 01:50:43,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:50:43,092 INFO L93 Difference]: Finished difference Result 79 states and 82 transitions. [2025-03-09 01:50:43,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-09 01:50:43,092 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 5.357142857142857) internal successors, (75), 15 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) Word has length 51 [2025-03-09 01:50:43,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:50:43,092 INFO L225 Difference]: With dead ends: 79 [2025-03-09 01:50:43,093 INFO L226 Difference]: Without dead ends: 78 [2025-03-09 01:50:43,093 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=351, Invalid=641, Unknown=0, NotChecked=0, Total=992 [2025-03-09 01:50:43,094 INFO L435 NwaCegarLoop]: 2 mSDtfsCounter, 8 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:50:43,094 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 6 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 01:50:43,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2025-03-09 01:50:43,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2025-03-09 01:50:43,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 77 states have (on average 1.0129870129870129) internal successors, (78), 77 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-09 01:50:43,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2025-03-09 01:50:43,101 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 51 [2025-03-09 01:50:43,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:50:43,101 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2025-03-09 01:50:43,101 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 5.357142857142857) internal successors, (75), 15 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-09 01:50:43,101 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2025-03-09 01:50:43,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-09 01:50:43,102 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:50:43,102 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 10, 10, 10, 1, 1, 1] [2025-03-09 01:50:43,108 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-03-09 01:50:43,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:50:43,303 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-09 01:50:43,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:50:43,303 INFO L85 PathProgramCache]: Analyzing trace with hash -1086788598, now seen corresponding path program 3 times [2025-03-09 01:50:43,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:50:43,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695644290] [2025-03-09 01:50:43,303 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 01:50:43,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:50:43,307 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 77 statements into 11 equivalence classes. [2025-03-09 01:50:43,314 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 77 of 77 statements. [2025-03-09 01:50:43,314 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-03-09 01:50:43,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:50:43,465 INFO L134 CoverageAnalysis]: Checked inductivity of 365 backedges. 0 proven. 365 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:50:43,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:50:43,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695644290] [2025-03-09 01:50:43,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695644290] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:50:43,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1884270368] [2025-03-09 01:50:43,466 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 01:50:43,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:50:43,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:50:43,467 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:50:43,469 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-03-09 01:50:43,486 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 77 statements into 11 equivalence classes. [2025-03-09 01:50:43,506 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 77 of 77 statements. [2025-03-09 01:50:43,506 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-03-09 01:50:43,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:50:43,507 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-09 01:50:43,508 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:50:43,585 INFO L134 CoverageAnalysis]: Checked inductivity of 365 backedges. 0 proven. 365 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:50:43,585 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:50:43,790 INFO L134 CoverageAnalysis]: Checked inductivity of 365 backedges. 0 proven. 365 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:50:43,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1884270368] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:50:43,790 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:50:43,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 24 [2025-03-09 01:50:43,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521467694] [2025-03-09 01:50:43,790 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:50:43,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-09 01:50:43,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:50:43,791 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-09 01:50:43,791 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2025-03-09 01:50:43,792 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand has 25 states, 24 states have (on average 6.625) internal successors, (159), 25 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-09 01:50:43,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:50:43,876 INFO L93 Difference]: Finished difference Result 163 states and 174 transitions. [2025-03-09 01:50:43,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-09 01:50:43,877 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 6.625) internal successors, (159), 25 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) Word has length 77 [2025-03-09 01:50:43,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:50:43,877 INFO L225 Difference]: With dead ends: 163 [2025-03-09 01:50:43,877 INFO L226 Difference]: Without dead ends: 162 [2025-03-09 01:50:43,878 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2025-03-09 01:50:43,878 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 2 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:50:43,879 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 101 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 01:50:43,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2025-03-09 01:50:43,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2025-03-09 01:50:43,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 161 states have (on average 1.0062111801242235) internal successors, (162), 161 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-09 01:50:43,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 162 transitions. [2025-03-09 01:50:43,886 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 162 transitions. Word has length 77 [2025-03-09 01:50:43,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:50:43,886 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 162 transitions. [2025-03-09 01:50:43,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 6.625) internal successors, (159), 25 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-09 01:50:43,886 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 162 transitions. [2025-03-09 01:50:43,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-03-09 01:50:43,888 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:50:43,888 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 23, 22, 22, 22, 1, 1, 1] [2025-03-09 01:50:43,894 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2025-03-09 01:50:44,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:50:44,089 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-09 01:50:44,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:50:44,089 INFO L85 PathProgramCache]: Analyzing trace with hash -720091318, now seen corresponding path program 4 times [2025-03-09 01:50:44,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:50:44,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106644296] [2025-03-09 01:50:44,090 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 01:50:44,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:50:44,094 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 161 statements into 2 equivalence classes. [2025-03-09 01:50:44,103 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 161 of 161 statements. [2025-03-09 01:50:44,103 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-09 01:50:44,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:50:44,574 INFO L134 CoverageAnalysis]: Checked inductivity of 1727 backedges. 0 proven. 1727 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:50:44,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:50:44,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106644296] [2025-03-09 01:50:44,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106644296] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:50:44,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [722381759] [2025-03-09 01:50:44,574 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 01:50:44,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:50:44,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:50:44,579 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:50:44,580 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-03-09 01:50:44,600 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 161 statements into 2 equivalence classes. [2025-03-09 01:50:44,628 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 161 of 161 statements. [2025-03-09 01:50:44,628 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-09 01:50:44,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:50:44,629 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-09 01:50:44,632 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:50:44,789 INFO L134 CoverageAnalysis]: Checked inductivity of 1727 backedges. 0 proven. 1727 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:50:44,789 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:50:45,265 INFO L134 CoverageAnalysis]: Checked inductivity of 1727 backedges. 0 proven. 1727 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:50:45,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [722381759] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:50:45,265 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:50:45,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 47 [2025-03-09 01:50:45,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165859436] [2025-03-09 01:50:45,265 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:50:45,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2025-03-09 01:50:45,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:50:45,267 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2025-03-09 01:50:45,267 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2025-03-09 01:50:45,268 INFO L87 Difference]: Start difference. First operand 162 states and 162 transitions. Second operand has 48 states, 47 states have (on average 6.829787234042553) internal successors, (321), 48 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:50:45,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:50:45,391 INFO L93 Difference]: Finished difference Result 219 states and 226 transitions. [2025-03-09 01:50:45,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-03-09 01:50:45,392 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 47 states have (on average 6.829787234042553) internal successors, (321), 48 states have internal predecessors, (321), 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 161 [2025-03-09 01:50:45,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:50:45,393 INFO L225 Difference]: With dead ends: 219 [2025-03-09 01:50:45,393 INFO L226 Difference]: Without dead ends: 218 [2025-03-09 01:50:45,394 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 344 GetRequests, 298 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 660 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2025-03-09 01:50:45,395 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 0 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:50:45,397 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 158 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 01:50:45,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2025-03-09 01:50:45,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 218. [2025-03-09 01:50:45,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 217 states have (on average 1.0046082949308757) internal successors, (218), 217 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:50:45,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 218 transitions. [2025-03-09 01:50:45,405 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 218 transitions. Word has length 161 [2025-03-09 01:50:45,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:50:45,405 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 218 transitions. [2025-03-09 01:50:45,405 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 47 states have (on average 6.829787234042553) internal successors, (321), 48 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:50:45,405 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 218 transitions. [2025-03-09 01:50:45,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2025-03-09 01:50:45,407 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:50:45,407 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 31, 30, 30, 30, 1, 1, 1] [2025-03-09 01:50:45,416 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2025-03-09 01:50:45,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:50:45,611 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-09 01:50:45,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:50:45,611 INFO L85 PathProgramCache]: Analyzing trace with hash -2075816246, now seen corresponding path program 5 times [2025-03-09 01:50:45,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:50:45,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78890812] [2025-03-09 01:50:45,611 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-09 01:50:45,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:50:45,618 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 217 statements into 31 equivalence classes. [2025-03-09 01:50:45,646 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 31 check-sat command(s) and asserted 217 of 217 statements. [2025-03-09 01:50:45,646 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 31 check-sat command(s) [2025-03-09 01:50:45,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 01:50:45,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2128548273] [2025-03-09 01:50:45,647 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-09 01:50:45,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:50:45,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:50:45,650 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:50:45,651 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-03-09 01:50:45,677 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 217 statements into 31 equivalence classes. [2025-03-09 01:50:45,718 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 31 check-sat command(s) and asserted 217 of 217 statements. [2025-03-09 01:50:45,718 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 31 check-sat command(s) [2025-03-09 01:50:45,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 01:50:45,718 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 01:50:45,724 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 217 statements into 1 equivalence classes. [2025-03-09 01:50:45,743 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 217 of 217 statements. [2025-03-09 01:50:45,743 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:50:45,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 01:50:45,770 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 01:50:45,771 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-09 01:50:45,771 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 18 remaining) [2025-03-09 01:50:45,772 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 18 remaining) [2025-03-09 01:50:45,773 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 18 remaining) [2025-03-09 01:50:45,773 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 18 remaining) [2025-03-09 01:50:45,773 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 18 remaining) [2025-03-09 01:50:45,773 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 18 remaining) [2025-03-09 01:50:45,773 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 18 remaining) [2025-03-09 01:50:45,773 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 18 remaining) [2025-03-09 01:50:45,773 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 18 remaining) [2025-03-09 01:50:45,773 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 18 remaining) [2025-03-09 01:50:45,773 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 18 remaining) [2025-03-09 01:50:45,773 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 18 remaining) [2025-03-09 01:50:45,773 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 18 remaining) [2025-03-09 01:50:45,773 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 18 remaining) [2025-03-09 01:50:45,773 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 18 remaining) [2025-03-09 01:50:45,773 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 18 remaining) [2025-03-09 01:50:45,774 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 18 remaining) [2025-03-09 01:50:45,774 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 18 remaining) [2025-03-09 01:50:45,780 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2025-03-09 01:50:45,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:50:45,977 INFO L422 BasicCegarLoop]: Path program histogram: [5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:50:46,027 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-09 01:50:46,029 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.03 01:50:46 BoogieIcfgContainer [2025-03-09 01:50:46,029 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-09 01:50:46,030 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-09 01:50:46,030 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-09 01:50:46,030 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-09 01:50:46,030 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:50:30" (3/4) ... [2025-03-09 01:50:46,031 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-03-09 01:50:46,079 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 32. [2025-03-09 01:50:46,147 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-09 01:50:46,147 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-09 01:50:46,147 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-09 01:50:46,148 INFO L158 Benchmark]: Toolchain (without parser) took 15947.15ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 113.2MB in the beginning and 142.4MB in the end (delta: -29.2MB). Peak memory consumption was 95.6MB. Max. memory is 16.1GB. [2025-03-09 01:50:46,148 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 124.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 01:50:46,148 INFO L158 Benchmark]: CACSL2BoogieTranslator took 133.67ms. Allocated memory is still 142.6MB. Free memory was 112.8MB in the beginning and 102.8MB in the end (delta: 9.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 01:50:46,148 INFO L158 Benchmark]: Boogie Procedure Inliner took 15.05ms. Allocated memory is still 142.6MB. Free memory was 102.8MB in the beginning and 101.8MB in the end (delta: 984.7kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 01:50:46,148 INFO L158 Benchmark]: Boogie Preprocessor took 13.82ms. Allocated memory is still 142.6MB. Free memory was 101.8MB in the beginning and 100.9MB in the end (delta: 928.0kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 01:50:46,149 INFO L158 Benchmark]: IcfgBuilder took 214.11ms. Allocated memory is still 142.6MB. Free memory was 100.9MB in the beginning and 87.9MB in the end (delta: 13.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-09 01:50:46,149 INFO L158 Benchmark]: TraceAbstraction took 15448.15ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 87.0MB in the beginning and 61.8MB in the end (delta: 25.3MB). Peak memory consumption was 60.6MB. Max. memory is 16.1GB. [2025-03-09 01:50:46,149 INFO L158 Benchmark]: Witness Printer took 117.69ms. Allocated memory is still 176.2MB. Free memory was 61.8MB in the beginning and 142.4MB in the end (delta: -80.6MB). Peak memory consumption was 9.9MB. Max. memory is 16.1GB. [2025-03-09 01:50:46,150 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 124.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 133.67ms. Allocated memory is still 142.6MB. Free memory was 112.8MB in the beginning and 102.8MB in the end (delta: 9.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 15.05ms. Allocated memory is still 142.6MB. Free memory was 102.8MB in the beginning and 101.8MB in the end (delta: 984.7kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 13.82ms. Allocated memory is still 142.6MB. Free memory was 101.8MB in the beginning and 100.9MB in the end (delta: 928.0kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 214.11ms. Allocated memory is still 142.6MB. Free memory was 100.9MB in the beginning and 87.9MB in the end (delta: 13.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 15448.15ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 87.0MB in the beginning and 61.8MB in the end (delta: 25.3MB). Peak memory consumption was 60.6MB. Max. memory is 16.1GB. * Witness Printer took 117.69ms. Allocated memory is still 176.2MB. Free memory was 61.8MB in the beginning and 142.4MB in the end (delta: -80.6MB). Peak memory consumption was 9.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 39]: integer overflow possible integer overflow possible We found a FailurePath: [L23] int A, B; [L24] int r, d, p, q; [L25] A = __VERIFIER_nondet_int() [L26] B = 1 [L28] r = A [L29] d = B [L30] p = 1 [L31] q = 0 VAL [A=0, B=1, d=1, p=1, q=0, r=0] [L37] EXPR B * p VAL [A=0, B=1, d=1, p=1, q=0, r=0] [L37] COND FALSE !(!(d == B * p)) VAL [A=0, B=1, d=1, p=1, q=0, r=0] [L39] EXPR 2 * d [L39] d = 2 * d VAL [A=0, B=1, d=2, p=1, q=0, r=0] [L40] EXPR 2 * p [L40] p = 2 * p VAL [A=0, B=1, d=2, p=2, q=0, r=0] [L37] EXPR B * p VAL [A=0, B=1, d=2, p=2, q=0, r=0] [L37] COND FALSE !(!(d == B * p)) VAL [A=0, B=1, d=2, p=2, q=0, r=0] [L39] EXPR 2 * d [L39] d = 2 * d VAL [A=0, B=1, d=4, p=2, q=0, r=0] [L40] EXPR 2 * p [L40] p = 2 * p VAL [A=0, B=1, d=4, p=4, q=0, r=0] [L37] EXPR B * p VAL [A=0, B=1, d=4, p=4, q=0, r=0] [L37] COND FALSE !(!(d == B * p)) VAL [A=0, B=1, d=4, p=4, q=0, r=0] [L39] EXPR 2 * d [L39] d = 2 * d VAL [A=0, B=1, d=8, p=4, q=0, r=0] [L40] EXPR 2 * p [L40] p = 2 * p VAL [A=0, B=1, d=8, p=8, q=0, r=0] [L37] EXPR B * p VAL [A=0, B=1, d=8, p=8, q=0, r=0] [L37] COND FALSE !(!(d == B * p)) VAL [A=0, B=1, d=8, p=8, q=0, r=0] [L39] EXPR 2 * d [L39] d = 2 * d VAL [A=0, B=1, d=16, p=8, q=0, r=0] [L40] EXPR 2 * p [L40] p = 2 * p VAL [A=0, B=1, d=16, p=16, q=0, r=0] [L37] EXPR B * p VAL [A=0, B=1, d=16, p=16, q=0, r=0] [L37] COND FALSE !(!(d == B * p)) VAL [A=0, B=1, d=16, p=16, q=0, r=0] [L39] EXPR 2 * d [L39] d = 2 * d VAL [A=0, B=1, d=32, p=16, q=0, r=0] [L40] EXPR 2 * p [L40] p = 2 * p VAL [A=0, B=1, d=32, p=32, q=0, r=0] [L37] EXPR B * p VAL [A=0, B=1, d=32, p=32, q=0, r=0] [L37] COND FALSE !(!(d == B * p)) VAL [A=0, B=1, d=32, p=32, q=0, r=0] [L39] EXPR 2 * d [L39] d = 2 * d VAL [A=0, B=1, d=64, p=32, q=0, r=0] [L40] EXPR 2 * p [L40] p = 2 * p VAL [A=0, B=1, d=64, p=64, q=0, r=0] [L37] EXPR B * p VAL [A=0, B=1, d=64, p=64, q=0, r=0] [L37] COND FALSE !(!(d == B * p)) VAL [A=0, B=1, d=64, p=64, q=0, r=0] [L39] EXPR 2 * d [L39] d = 2 * d VAL [A=0, B=1, d=128, p=64, q=0, r=0] [L40] EXPR 2 * p [L40] p = 2 * p VAL [A=0, B=1, d=128, p=128, q=0, r=0] [L37] EXPR B * p VAL [A=0, B=1, d=128, p=128, q=0, r=0] [L37] COND FALSE !(!(d == B * p)) VAL [A=0, B=1, d=128, p=128, q=0, r=0] [L39] EXPR 2 * d [L39] d = 2 * d VAL [A=0, B=1, d=256, p=128, q=0, r=0] [L40] EXPR 2 * p [L40] p = 2 * p VAL [A=0, B=1, d=256, p=256, q=0, r=0] [L37] EXPR B * p VAL [A=0, B=1, d=256, p=256, q=0, r=0] [L37] COND FALSE !(!(d == B * p)) VAL [A=0, B=1, d=256, p=256, q=0, r=0] [L39] EXPR 2 * d [L39] d = 2 * d VAL [A=0, B=1, d=512, p=256, q=0, r=0] [L40] EXPR 2 * p [L40] p = 2 * p VAL [A=0, B=1, d=512, p=512, q=0, r=0] [L37] EXPR B * p VAL [A=0, B=1, d=512, p=512, q=0, r=0] [L37] COND FALSE !(!(d == B * p)) VAL [A=0, B=1, d=512, p=512, q=0, r=0] [L39] EXPR 2 * d [L39] d = 2 * d VAL [A=0, B=1, d=1024, p=512, q=0, r=0] [L40] EXPR 2 * p [L40] p = 2 * p VAL [A=0, B=1, d=1024, p=1024, q=0, r=0] [L37] EXPR B * p VAL [A=0, B=1, d=1024, p=1024, q=0, r=0] [L37] COND FALSE !(!(d == B * p)) VAL [A=0, B=1, d=1024, p=1024, q=0, r=0] [L39] EXPR 2 * d [L39] d = 2 * d VAL [A=0, B=1, d=2048, p=1024, q=0, r=0] [L40] EXPR 2 * p [L40] p = 2 * p VAL [A=0, B=1, d=2048, p=2048, q=0, r=0] [L37] EXPR B * p VAL [A=0, B=1, d=2048, p=2048, q=0, r=0] [L37] COND FALSE !(!(d == B * p)) VAL [A=0, B=1, d=2048, p=2048, q=0, r=0] [L39] EXPR 2 * d [L39] d = 2 * d VAL [A=0, B=1, d=4096, p=2048, q=0, r=0] [L40] EXPR 2 * p [L40] p = 2 * p VAL [A=0, B=1, d=4096, p=4096, q=0, r=0] [L37] EXPR B * p VAL [A=0, B=1, d=4096, p=4096, q=0, r=0] [L37] COND FALSE !(!(d == B * p)) VAL [A=0, B=1, d=4096, p=4096, q=0, r=0] [L39] EXPR 2 * d [L39] d = 2 * d VAL [A=0, B=1, d=8192, p=4096, q=0, r=0] [L40] EXPR 2 * p [L40] p = 2 * p VAL [A=0, B=1, d=8192, p=8192, q=0, r=0] [L37] EXPR B * p VAL [A=0, B=1, d=8192, p=8192, q=0, r=0] [L37] COND FALSE !(!(d == B * p)) VAL [A=0, B=1, d=8192, p=8192, q=0, r=0] [L39] EXPR 2 * d [L39] d = 2 * d VAL [A=0, B=1, d=16384, p=8192, q=0, r=0] [L40] EXPR 2 * p [L40] p = 2 * p VAL [A=0, B=1, d=16384, p=16384, q=0, r=0] [L37] EXPR B * p VAL [A=0, B=1, d=16384, p=16384, q=0, r=0] [L37] COND FALSE !(!(d == B * p)) VAL [A=0, B=1, d=16384, p=16384, q=0, r=0] [L39] EXPR 2 * d [L39] d = 2 * d VAL [A=0, B=1, d=32768, p=16384, q=0, r=0] [L40] EXPR 2 * p [L40] p = 2 * p VAL [A=0, B=1, d=32768, p=32768, q=0, r=0] [L37] EXPR B * p VAL [A=0, B=1, d=32768, p=32768, q=0, r=0] [L37] COND FALSE !(!(d == B * p)) VAL [A=0, B=1, d=32768, p=32768, q=0, r=0] [L39] EXPR 2 * d [L39] d = 2 * d VAL [A=0, B=1, d=65536, p=32768, q=0, r=0] [L40] EXPR 2 * p [L40] p = 2 * p VAL [A=0, B=1, d=65536, p=65536, q=0, r=0] [L37] EXPR B * p VAL [A=0, B=1, d=65536, p=65536, q=0, r=0] [L37] COND FALSE !(!(d == B * p)) VAL [A=0, B=1, d=65536, p=65536, q=0, r=0] [L39] EXPR 2 * d [L39] d = 2 * d VAL [A=0, B=1, d=131072, p=65536, q=0, r=0] [L40] EXPR 2 * p [L40] p = 2 * p VAL [A=0, B=1, d=131072, p=131072, q=0, r=0] [L37] EXPR B * p VAL [A=0, B=1, d=131072, p=131072, q=0, r=0] [L37] COND FALSE !(!(d == B * p)) VAL [A=0, B=1, d=131072, p=131072, q=0, r=0] [L39] EXPR 2 * d [L39] d = 2 * d VAL [A=0, B=1, d=262144, p=131072, q=0, r=0] [L40] EXPR 2 * p [L40] p = 2 * p VAL [A=0, B=1, d=262144, p=262144, q=0, r=0] [L37] EXPR B * p VAL [A=0, B=1, d=262144, p=262144, q=0, r=0] [L37] COND FALSE !(!(d == B * p)) VAL [A=0, B=1, d=262144, p=262144, q=0, r=0] [L39] EXPR 2 * d [L39] d = 2 * d VAL [A=0, B=1, d=524288, p=262144, q=0, r=0] [L40] EXPR 2 * p [L40] p = 2 * p VAL [A=0, B=1, d=524288, p=524288, q=0, r=0] [L37] EXPR B * p VAL [A=0, B=1, d=524288, p=524288, q=0, r=0] [L37] COND FALSE !(!(d == B * p)) VAL [A=0, B=1, d=524288, p=524288, q=0, r=0] [L39] EXPR 2 * d [L39] d = 2 * d VAL [A=0, B=1, d=1048576, p=524288, q=0, r=0] [L40] EXPR 2 * p [L40] p = 2 * p VAL [A=0, B=1, d=1048576, p=1048576, q=0, r=0] [L37] EXPR B * p VAL [A=0, B=1, d=1048576, p=1048576, q=0, r=0] [L37] COND FALSE !(!(d == B * p)) VAL [A=0, B=1, d=1048576, p=1048576, q=0, r=0] [L39] EXPR 2 * d [L39] d = 2 * d VAL [A=0, B=1, d=2097152, p=1048576, q=0, r=0] [L40] EXPR 2 * p [L40] p = 2 * p VAL [A=0, B=1, d=2097152, p=2097152, q=0, r=0] [L37] EXPR B * p VAL [A=0, B=1, d=2097152, p=2097152, q=0, r=0] [L37] COND FALSE !(!(d == B * p)) VAL [A=0, B=1, d=2097152, p=2097152, q=0, r=0] [L39] EXPR 2 * d [L39] d = 2 * d VAL [A=0, B=1, d=4194304, p=2097152, q=0, r=0] [L40] EXPR 2 * p [L40] p = 2 * p VAL [A=0, B=1, d=4194304, p=4194304, q=0, r=0] [L37] EXPR B * p VAL [A=0, B=1, d=4194304, p=4194304, q=0, r=0] [L37] COND FALSE !(!(d == B * p)) VAL [A=0, B=1, d=4194304, p=4194304, q=0, r=0] [L39] EXPR 2 * d [L39] d = 2 * d VAL [A=0, B=1, d=8388608, p=4194304, q=0, r=0] [L40] EXPR 2 * p [L40] p = 2 * p VAL [A=0, B=1, d=8388608, p=8388608, q=0, r=0] [L37] EXPR B * p VAL [A=0, B=1, d=8388608, p=8388608, q=0, r=0] [L37] COND FALSE !(!(d == B * p)) VAL [A=0, B=1, d=8388608, p=8388608, q=0, r=0] [L39] EXPR 2 * d [L39] d = 2 * d VAL [A=0, B=1, d=16777216, p=8388608, q=0, r=0] [L40] EXPR 2 * p [L40] p = 2 * p VAL [A=0, B=1, d=16777216, p=16777216, q=0, r=0] [L37] EXPR B * p VAL [A=0, B=1, d=16777216, p=16777216, q=0, r=0] [L37] COND FALSE !(!(d == B * p)) VAL [A=0, B=1, d=16777216, p=16777216, q=0, r=0] [L39] EXPR 2 * d [L39] d = 2 * d VAL [A=0, B=1, d=33554432, p=16777216, q=0, r=0] [L40] EXPR 2 * p [L40] p = 2 * p VAL [A=0, B=1, d=33554432, p=33554432, q=0, r=0] [L37] EXPR B * p VAL [A=0, B=1, d=33554432, p=33554432, q=0, r=0] [L37] COND FALSE !(!(d == B * p)) VAL [A=0, B=1, d=33554432, p=33554432, q=0, r=0] [L39] EXPR 2 * d [L39] d = 2 * d VAL [A=0, B=1, d=67108864, p=33554432, q=0, r=0] [L40] EXPR 2 * p [L40] p = 2 * p VAL [A=0, B=1, d=67108864, p=67108864, q=0, r=0] [L37] EXPR B * p VAL [A=0, B=1, d=67108864, p=67108864, q=0, r=0] [L37] COND FALSE !(!(d == B * p)) VAL [A=0, B=1, d=67108864, p=67108864, q=0, r=0] [L39] EXPR 2 * d [L39] d = 2 * d VAL [A=0, B=1, d=134217728, p=67108864, q=0, r=0] [L40] EXPR 2 * p [L40] p = 2 * p VAL [A=0, B=1, d=134217728, p=134217728, q=0, r=0] [L37] EXPR B * p VAL [A=0, B=1, d=134217728, p=134217728, q=0, r=0] [L37] COND FALSE !(!(d == B * p)) VAL [A=0, B=1, d=134217728, p=134217728, q=0, r=0] [L39] EXPR 2 * d [L39] d = 2 * d VAL [A=0, B=1, d=268435456, p=134217728, q=0, r=0] [L40] EXPR 2 * p [L40] p = 2 * p VAL [A=0, B=1, d=268435456, p=268435456, q=0, r=0] [L37] EXPR B * p VAL [A=0, B=1, d=268435456, p=268435456, q=0, r=0] [L37] COND FALSE !(!(d == B * p)) VAL [A=0, B=1, d=268435456, p=268435456, q=0, r=0] [L39] EXPR 2 * d [L39] d = 2 * d VAL [A=0, B=1, d=536870912, p=268435456, q=0, r=0] [L40] EXPR 2 * p [L40] p = 2 * p VAL [A=0, B=1, d=536870912, p=536870912, q=0, r=0] [L37] EXPR B * p VAL [A=0, B=1, d=536870912, p=536870912, q=0, r=0] [L37] COND FALSE !(!(d == B * p)) VAL [A=0, B=1, d=536870912, p=536870912, q=0, r=0] [L39] EXPR 2 * d [L39] d = 2 * d VAL [A=0, B=1, d=1073741824, p=536870912, q=0, r=0] [L40] EXPR 2 * p [L40] p = 2 * p VAL [A=0, B=1, d=1073741824, p=1073741824, q=0, r=0] [L37] EXPR B * p VAL [A=0, B=1, d=1073741824, p=1073741824, q=0, r=0] [L37] COND FALSE !(!(d == B * p)) VAL [A=0, B=1, d=1073741824, p=1073741824, q=0, r=0] [L39] 2 * d VAL [A=0, B=1, p=1073741824, q=0, r=0] - UnprovableResult [Line: 53]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 53]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 52]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 52]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 50]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 50]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 49]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 49]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 47]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 47]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 47]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 47]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 40]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 40]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 39]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 37]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 37]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 45 locations, 49 edges, 18 error locations. Started 1 CEGAR loops. OverallTime: 15.3s, OverallIterations: 23, TraceHistogramMax: 31, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 908 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 908 mSDsluCounter, 1396 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 892 mSDsCounter, 83 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1355 IncrementalHoareTripleChecker+Invalid, 1438 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 83 mSolverCounterUnsat, 504 mSDtfsCounter, 1355 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1026 GetRequests, 850 SyntacticMatches, 1 SemanticMatches, 175 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 937 ImplicationChecksByTransitivity, 5.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=230occurred in iteration=17, InterpolantAutomatonStates: 171, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 22 MinimizatonAttempts, 381 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 8.6s InterpolantComputationTime, 1524 NumberOfCodeBlocks, 1482 NumberOfCodeBlocksAsserted, 126 NumberOfCheckSat, 1398 ConstructedInterpolants, 86 QuantifiedInterpolants, 6221 SizeOfPredicates, 14 NumberOfNonLiveVariables, 941 ConjunctsInSsa, 122 ConjunctsInUnsatCore, 41 InterpolantComputations, 13 PerfectInterpolantSequences, 260/7021 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2025-03-09 01:50:46,168 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(OVERFLOW)