./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/termination-crafted-lit/LarrazOliverasRodriguez-CarbonellRubio-FMCAD2013-Fig1.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/termination-crafted-lit/LarrazOliverasRodriguez-CarbonellRubio-FMCAD2013-Fig1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-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 64bit --witnessprinter.graph.data.programhash 33be026e9ca846df0a8faa91fc9c2bbf64ee20dbba0f4f48a9cd42fbefb372d5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 10:32:12,659 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 10:32:12,729 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-03-04 10:32:12,736 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 10:32:12,736 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 10:32:12,757 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 10:32:12,758 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 10:32:12,758 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 10:32:12,759 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 10:32:12,759 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 10:32:12,759 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 10:32:12,759 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 10:32:12,759 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 10:32:12,759 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 10:32:12,759 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 10:32:12,759 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 10:32:12,759 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 10:32:12,759 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 10:32:12,760 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 10:32:12,760 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 10:32:12,760 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 10:32:12,760 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 10:32:12,760 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 10:32:12,760 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 10:32:12,760 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 10:32:12,760 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 10:32:12,760 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 10:32:12,760 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 10:32:12,760 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 10:32:12,760 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 10:32:12,760 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 10:32:12,760 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:32:12,760 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 10:32:12,760 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 10:32:12,760 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 10:32:12,760 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 10:32:12,760 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 10:32:12,761 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 10:32:12,761 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 10:32:12,761 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 10:32:12,761 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 10:32:12,761 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 10:32:12,761 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 33be026e9ca846df0a8faa91fc9c2bbf64ee20dbba0f4f48a9cd42fbefb372d5 [2025-03-04 10:32:12,979 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 10:32:12,984 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 10:32:12,986 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 10:32:12,988 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 10:32:12,988 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 10:32:12,989 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted-lit/LarrazOliverasRodriguez-CarbonellRubio-FMCAD2013-Fig1.c [2025-03-04 10:32:14,114 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00642db95/3ba2eab0c22d4112867ddbba3ed82e05/FLAG8f75afb26 [2025-03-04 10:32:14,326 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 10:32:14,330 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted-lit/LarrazOliverasRodriguez-CarbonellRubio-FMCAD2013-Fig1.c [2025-03-04 10:32:14,337 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00642db95/3ba2eab0c22d4112867ddbba3ed82e05/FLAG8f75afb26 [2025-03-04 10:32:14,353 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00642db95/3ba2eab0c22d4112867ddbba3ed82e05 [2025-03-04 10:32:14,355 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 10:32:14,356 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 10:32:14,357 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 10:32:14,357 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 10:32:14,360 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 10:32:14,361 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:32:14" (1/1) ... [2025-03-04 10:32:14,362 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72531e9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:32:14, skipping insertion in model container [2025-03-04 10:32:14,362 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:32:14" (1/1) ... [2025-03-04 10:32:14,372 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 10:32:14,467 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:32:14,472 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 10:32:14,482 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:32:14,492 INFO L204 MainTranslator]: Completed translation [2025-03-04 10:32:14,493 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:32:14 WrapperNode [2025-03-04 10:32:14,493 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 10:32:14,494 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 10:32:14,494 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 10:32:14,495 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 10:32:14,500 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:32:14" (1/1) ... [2025-03-04 10:32:14,502 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:32:14" (1/1) ... [2025-03-04 10:32:14,513 INFO L138 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 34 [2025-03-04 10:32:14,514 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 10:32:14,515 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 10:32:14,515 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 10:32:14,516 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 10:32:14,522 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:32:14" (1/1) ... [2025-03-04 10:32:14,522 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:32:14" (1/1) ... [2025-03-04 10:32:14,523 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:32:14" (1/1) ... [2025-03-04 10:32:14,531 INFO L175 MemorySlicer]: No memory access in input program. [2025-03-04 10:32:14,532 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:32:14" (1/1) ... [2025-03-04 10:32:14,532 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:32:14" (1/1) ... [2025-03-04 10:32:14,533 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:32:14" (1/1) ... [2025-03-04 10:32:14,533 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:32:14" (1/1) ... [2025-03-04 10:32:14,534 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:32:14" (1/1) ... [2025-03-04 10:32:14,534 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:32:14" (1/1) ... [2025-03-04 10:32:14,535 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 10:32:14,536 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 10:32:14,536 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 10:32:14,536 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 10:32:14,537 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:32:14" (1/1) ... [2025-03-04 10:32:14,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:32:14,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:32:14,567 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 10:32:14,577 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 10:32:14,594 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 10:32:14,594 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 10:32:14,635 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 10:32:14,636 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 10:32:14,701 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2025-03-04 10:32:14,701 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 10:32:14,707 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 10:32:14,708 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 10:32:14,708 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:32:14 BoogieIcfgContainer [2025-03-04 10:32:14,708 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 10:32:14,710 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 10:32:14,710 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 10:32:14,713 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 10:32:14,714 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 10:32:14" (1/3) ... [2025-03-04 10:32:14,714 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a165c8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:32:14, skipping insertion in model container [2025-03-04 10:32:14,714 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:32:14" (2/3) ... [2025-03-04 10:32:14,714 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a165c8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:32:14, skipping insertion in model container [2025-03-04 10:32:14,714 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:32:14" (3/3) ... [2025-03-04 10:32:14,719 INFO L128 eAbstractionObserver]: Analyzing ICFG LarrazOliverasRodriguez-CarbonellRubio-FMCAD2013-Fig1.c [2025-03-04 10:32:14,729 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 10:32:14,730 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG LarrazOliverasRodriguez-CarbonellRubio-FMCAD2013-Fig1.c that has 1 procedures, 25 locations, 1 initial locations, 2 loop locations, and 8 error locations. [2025-03-04 10:32:14,769 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 10:32:14,779 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;@22eb1e6b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 10:32:14,779 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-03-04 10:32:14,783 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 16 states have (on average 1.6875) internal successors, (27), 24 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:32:14,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-04 10:32:14,786 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:32:14,787 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-04 10:32:14,787 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 10:32:14,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:32:14,790 INFO L85 PathProgramCache]: Analyzing trace with hash 53408246, now seen corresponding path program 1 times [2025-03-04 10:32:14,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:32:14,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881991493] [2025-03-04 10:32:14,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:32:14,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:32:14,848 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 10:32:14,852 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 10:32:14,852 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:32:14,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:32:14,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:32:14,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:32:14,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881991493] [2025-03-04 10:32:14,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881991493] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:32:14,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:32:14,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:32:14,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490490074] [2025-03-04 10:32:14,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:32:14,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:32:14,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:32:14,915 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:32:14,915 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:32:14,917 INFO L87 Difference]: Start difference. First operand has 25 states, 16 states have (on average 1.6875) internal successors, (27), 24 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:32:14,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:32:14,953 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2025-03-04 10:32:14,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:32:14,955 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-03-04 10:32:14,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:32:14,959 INFO L225 Difference]: With dead ends: 31 [2025-03-04 10:32:14,960 INFO L226 Difference]: Without dead ends: 24 [2025-03-04 10:32:14,961 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:32:14,963 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 3 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:32:14,963 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 37 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:32:14,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2025-03-04 10:32:14,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2025-03-04 10:32:14,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 15 states have (on average 1.6) internal successors, (24), 22 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:32:14,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2025-03-04 10:32:14,986 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 5 [2025-03-04 10:32:14,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:32:14,986 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2025-03-04 10:32:14,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:32:14,987 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2025-03-04 10:32:14,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-04 10:32:14,987 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:32:14,987 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-04 10:32:14,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 10:32:14,987 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 10:32:14,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:32:14,988 INFO L85 PathProgramCache]: Analyzing trace with hash 1655655613, now seen corresponding path program 1 times [2025-03-04 10:32:14,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:32:14,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650893333] [2025-03-04 10:32:14,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:32:14,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:32:14,995 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 10:32:14,999 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 10:32:15,002 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:32:15,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:32:15,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:32:15,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:32:15,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650893333] [2025-03-04 10:32:15,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650893333] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:32:15,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:32:15,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:32:15,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633965492] [2025-03-04 10:32:15,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:32:15,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:32:15,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:32:15,044 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:32:15,044 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:32:15,044 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:32:15,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:32:15,076 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2025-03-04 10:32:15,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:32:15,077 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-03-04 10:32:15,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:32:15,077 INFO L225 Difference]: With dead ends: 23 [2025-03-04 10:32:15,078 INFO L226 Difference]: Without dead ends: 22 [2025-03-04 10:32:15,078 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:32:15,079 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 9 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:32:15,082 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 10 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:32:15,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2025-03-04 10:32:15,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2025-03-04 10:32:15,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 21 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:32:15,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2025-03-04 10:32:15,084 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 6 [2025-03-04 10:32:15,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:32:15,085 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2025-03-04 10:32:15,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:32:15,085 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2025-03-04 10:32:15,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-04 10:32:15,085 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:32:15,085 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:32:15,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 10:32:15,085 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 10:32:15,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:32:15,086 INFO L85 PathProgramCache]: Analyzing trace with hash 1947144114, now seen corresponding path program 1 times [2025-03-04 10:32:15,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:32:15,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317307362] [2025-03-04 10:32:15,086 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:32:15,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:32:15,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 10:32:15,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 10:32:15,099 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:32:15,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:32:15,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:32:15,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:32:15,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317307362] [2025-03-04 10:32:15,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317307362] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:32:15,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:32:15,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:32:15,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312150117] [2025-03-04 10:32:15,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:32:15,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:32:15,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:32:15,170 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:32:15,171 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:32:15,171 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:32:15,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:32:15,259 INFO L93 Difference]: Finished difference Result 38 states and 48 transitions. [2025-03-04 10:32:15,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:32:15,260 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-03-04 10:32:15,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:32:15,260 INFO L225 Difference]: With dead ends: 38 [2025-03-04 10:32:15,260 INFO L226 Difference]: Without dead ends: 37 [2025-03-04 10:32:15,260 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:32:15,261 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 17 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:32:15,261 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 21 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:32:15,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2025-03-04 10:32:15,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 29. [2025-03-04 10:32:15,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 22 states have (on average 1.5909090909090908) internal successors, (35), 28 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:32:15,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2025-03-04 10:32:15,269 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 8 [2025-03-04 10:32:15,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:32:15,269 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. [2025-03-04 10:32:15,269 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:32:15,270 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2025-03-04 10:32:15,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-04 10:32:15,270 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:32:15,270 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:32:15,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 10:32:15,270 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 10:32:15,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:32:15,271 INFO L85 PathProgramCache]: Analyzing trace with hash 1947144091, now seen corresponding path program 1 times [2025-03-04 10:32:15,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:32:15,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216612585] [2025-03-04 10:32:15,271 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:32:15,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:32:15,274 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 10:32:15,280 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 10:32:15,282 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:32:15,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:32:15,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:32:15,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:32:15,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216612585] [2025-03-04 10:32:15,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216612585] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:32:15,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:32:15,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:32:15,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57292180] [2025-03-04 10:32:15,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:32:15,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:32:15,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:32:15,318 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:32:15,319 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:32:15,319 INFO L87 Difference]: Start difference. First operand 29 states and 35 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:32:15,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:32:15,362 INFO L93 Difference]: Finished difference Result 55 states and 74 transitions. [2025-03-04 10:32:15,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:32:15,362 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-03-04 10:32:15,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:32:15,363 INFO L225 Difference]: With dead ends: 55 [2025-03-04 10:32:15,363 INFO L226 Difference]: Without dead ends: 53 [2025-03-04 10:32:15,364 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:32:15,364 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 19 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:32:15,364 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 26 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:32:15,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2025-03-04 10:32:15,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 46. [2025-03-04 10:32:15,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 39 states have (on average 1.564102564102564) internal successors, (61), 45 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:32:15,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 61 transitions. [2025-03-04 10:32:15,370 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 61 transitions. Word has length 8 [2025-03-04 10:32:15,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:32:15,372 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 61 transitions. [2025-03-04 10:32:15,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:32:15,372 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 61 transitions. [2025-03-04 10:32:15,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-04 10:32:15,373 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:32:15,373 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:32:15,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 10:32:15,373 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 10:32:15,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:32:15,374 INFO L85 PathProgramCache]: Analyzing trace with hash 231925363, now seen corresponding path program 1 times [2025-03-04 10:32:15,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:32:15,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169010752] [2025-03-04 10:32:15,374 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:32:15,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:32:15,381 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 10:32:15,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 10:32:15,388 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:32:15,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:32:15,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:32:15,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:32:15,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169010752] [2025-03-04 10:32:15,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169010752] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:32:15,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:32:15,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:32:15,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075748199] [2025-03-04 10:32:15,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:32:15,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:32:15,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:32:15,425 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:32:15,425 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:32:15,425 INFO L87 Difference]: Start difference. First operand 46 states and 61 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 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-04 10:32:15,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:32:15,477 INFO L93 Difference]: Finished difference Result 59 states and 78 transitions. [2025-03-04 10:32:15,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:32:15,477 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 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-04 10:32:15,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:32:15,478 INFO L225 Difference]: With dead ends: 59 [2025-03-04 10:32:15,478 INFO L226 Difference]: Without dead ends: 58 [2025-03-04 10:32:15,478 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:32:15,479 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 10 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:32:15,479 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 21 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:32:15,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2025-03-04 10:32:15,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 54. [2025-03-04 10:32:15,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 47 states have (on average 1.553191489361702) internal successors, (73), 53 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:32:15,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 73 transitions. [2025-03-04 10:32:15,486 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 73 transitions. Word has length 9 [2025-03-04 10:32:15,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:32:15,487 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 73 transitions. [2025-03-04 10:32:15,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 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-04 10:32:15,487 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 73 transitions. [2025-03-04 10:32:15,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-04 10:32:15,488 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:32:15,488 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:32:15,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 10:32:15,488 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 10:32:15,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:32:15,488 INFO L85 PathProgramCache]: Analyzing trace with hash 231924658, now seen corresponding path program 1 times [2025-03-04 10:32:15,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:32:15,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140885455] [2025-03-04 10:32:15,488 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:32:15,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:32:15,494 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 10:32:15,497 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 10:32:15,500 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:32:15,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:32:15,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:32:15,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:32:15,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140885455] [2025-03-04 10:32:15,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140885455] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:32:15,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:32:15,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:32:15,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993710657] [2025-03-04 10:32:15,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:32:15,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:32:15,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:32:15,529 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:32:15,529 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:32:15,529 INFO L87 Difference]: Start difference. First operand 54 states and 73 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 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-04 10:32:15,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:32:15,584 INFO L93 Difference]: Finished difference Result 94 states and 135 transitions. [2025-03-04 10:32:15,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:32:15,584 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 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-04 10:32:15,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:32:15,585 INFO L225 Difference]: With dead ends: 94 [2025-03-04 10:32:15,586 INFO L226 Difference]: Without dead ends: 93 [2025-03-04 10:32:15,586 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:32:15,587 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 14 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:32:15,587 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 28 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:32:15,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2025-03-04 10:32:15,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 86. [2025-03-04 10:32:15,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 79 states have (on average 1.5316455696202531) internal successors, (121), 85 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:32:15,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 121 transitions. [2025-03-04 10:32:15,600 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 121 transitions. Word has length 9 [2025-03-04 10:32:15,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:32:15,600 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 121 transitions. [2025-03-04 10:32:15,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 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-04 10:32:15,600 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 121 transitions. [2025-03-04 10:32:15,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-04 10:32:15,600 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:32:15,600 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:32:15,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 10:32:15,601 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 10:32:15,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:32:15,601 INFO L85 PathProgramCache]: Analyzing trace with hash -1400270215, now seen corresponding path program 1 times [2025-03-04 10:32:15,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:32:15,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418028722] [2025-03-04 10:32:15,602 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:32:15,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:32:15,605 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 10:32:15,607 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 10:32:15,607 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:32:15,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:32:15,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:32:15,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:32:15,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418028722] [2025-03-04 10:32:15,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418028722] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:32:15,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:32:15,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:32:15,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145115701] [2025-03-04 10:32:15,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:32:15,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:32:15,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:32:15,629 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:32:15,629 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:32:15,630 INFO L87 Difference]: Start difference. First operand 86 states and 121 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-04 10:32:15,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:32:15,663 INFO L93 Difference]: Finished difference Result 86 states and 121 transitions. [2025-03-04 10:32:15,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:32:15,663 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-04 10:32:15,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:32:15,664 INFO L225 Difference]: With dead ends: 86 [2025-03-04 10:32:15,664 INFO L226 Difference]: Without dead ends: 85 [2025-03-04 10:32:15,664 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:32:15,666 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 14 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:32:15,666 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 17 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:32:15,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2025-03-04 10:32:15,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2025-03-04 10:32:15,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 79 states have (on average 1.4556962025316456) internal successors, (115), 84 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:32:15,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 115 transitions. [2025-03-04 10:32:15,679 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 115 transitions. Word has length 10 [2025-03-04 10:32:15,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:32:15,679 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 115 transitions. [2025-03-04 10:32:15,679 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-04 10:32:15,680 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 115 transitions. [2025-03-04 10:32:15,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-04 10:32:15,680 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:32:15,680 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:32:15,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 10:32:15,680 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 10:32:15,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:32:15,681 INFO L85 PathProgramCache]: Analyzing trace with hash -458703728, now seen corresponding path program 1 times [2025-03-04 10:32:15,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:32:15,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239684522] [2025-03-04 10:32:15,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:32:15,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:32:15,684 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 10:32:15,687 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 10:32:15,689 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:32:15,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:32:15,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:32:15,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:32:15,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239684522] [2025-03-04 10:32:15,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239684522] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:32:15,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:32:15,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:32:15,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165860862] [2025-03-04 10:32:15,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:32:15,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:32:15,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:32:15,719 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:32:15,719 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:32:15,720 INFO L87 Difference]: Start difference. First operand 85 states and 115 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:32:15,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:32:15,732 INFO L93 Difference]: Finished difference Result 85 states and 115 transitions. [2025-03-04 10:32:15,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:32:15,732 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-03-04 10:32:15,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:32:15,732 INFO L225 Difference]: With dead ends: 85 [2025-03-04 10:32:15,733 INFO L226 Difference]: Without dead ends: 84 [2025-03-04 10:32:15,733 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:32:15,733 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 8 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:32:15,733 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 15 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:32:15,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2025-03-04 10:32:15,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2025-03-04 10:32:15,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 79 states have (on average 1.379746835443038) internal successors, (109), 83 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:32:15,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 109 transitions. [2025-03-04 10:32:15,740 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 109 transitions. Word has length 11 [2025-03-04 10:32:15,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:32:15,740 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 109 transitions. [2025-03-04 10:32:15,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:32:15,740 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 109 transitions. [2025-03-04 10:32:15,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-04 10:32:15,740 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:32:15,740 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-03-04 10:32:15,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 10:32:15,740 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 10:32:15,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:32:15,741 INFO L85 PathProgramCache]: Analyzing trace with hash 63316791, now seen corresponding path program 1 times [2025-03-04 10:32:15,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:32:15,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714793585] [2025-03-04 10:32:15,741 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:32:15,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:32:15,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 10:32:15,746 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 10:32:15,746 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:32:15,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:32:15,811 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:32:15,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:32:15,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714793585] [2025-03-04 10:32:15,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714793585] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:32:15,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1132781829] [2025-03-04 10:32:15,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:32:15,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:32:15,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:32:15,813 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:32:15,815 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 10:32:15,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 10:32:15,841 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 10:32:15,841 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:32:15,841 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:32:15,842 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 10:32:15,844 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:32:15,923 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:32:15,923 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:32:15,988 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:32:15,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1132781829] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:32:15,989 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:32:15,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2025-03-04 10:32:15,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856265988] [2025-03-04 10:32:15,989 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:32:15,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 10:32:15,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:32:15,989 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 10:32:15,990 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2025-03-04 10:32:15,990 INFO L87 Difference]: Start difference. First operand 84 states and 109 transitions. Second operand has 14 states, 13 states have (on average 2.923076923076923) internal successors, (38), 14 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:32:16,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:32:16,278 INFO L93 Difference]: Finished difference Result 207 states and 298 transitions. [2025-03-04 10:32:16,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-04 10:32:16,279 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.923076923076923) internal successors, (38), 14 states have internal predecessors, (38), 0 states have call successors, (0), 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-04 10:32:16,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:32:16,280 INFO L225 Difference]: With dead ends: 207 [2025-03-04 10:32:16,280 INFO L226 Difference]: Without dead ends: 204 [2025-03-04 10:32:16,280 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=241, Invalid=515, Unknown=0, NotChecked=0, Total=756 [2025-03-04 10:32:16,281 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 141 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:32:16,281 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 29 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:32:16,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2025-03-04 10:32:16,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 110. [2025-03-04 10:32:16,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 107 states have (on average 1.280373831775701) internal successors, (137), 109 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:32:16,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 137 transitions. [2025-03-04 10:32:16,291 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 137 transitions. Word has length 14 [2025-03-04 10:32:16,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:32:16,291 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 137 transitions. [2025-03-04 10:32:16,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.923076923076923) internal successors, (38), 14 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:32:16,291 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 137 transitions. [2025-03-04 10:32:16,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-04 10:32:16,293 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:32:16,293 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2025-03-04 10:32:16,299 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 10:32:16,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:32:16,498 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 10:32:16,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:32:16,498 INFO L85 PathProgramCache]: Analyzing trace with hash 1962820494, now seen corresponding path program 1 times [2025-03-04 10:32:16,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:32:16,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982400127] [2025-03-04 10:32:16,499 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:32:16,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:32:16,501 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 10:32:16,508 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 10:32:16,508 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:32:16,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:32:16,549 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-04 10:32:16,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:32:16,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982400127] [2025-03-04 10:32:16,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982400127] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:32:16,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1648861522] [2025-03-04 10:32:16,550 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:32:16,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:32:16,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:32:16,552 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:32:16,554 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 10:32:16,573 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 10:32:16,576 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 10:32:16,576 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:32:16,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:32:16,577 INFO L256 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 10:32:16,578 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:32:16,649 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-04 10:32:16,650 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:32:16,696 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-04 10:32:16,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1648861522] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:32:16,696 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:32:16,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2025-03-04 10:32:16,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487184682] [2025-03-04 10:32:16,697 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:32:16,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 10:32:16,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:32:16,697 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 10:32:16,697 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2025-03-04 10:32:16,698 INFO L87 Difference]: Start difference. First operand 110 states and 137 transitions. Second operand has 14 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 14 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:32:16,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:32:16,888 INFO L93 Difference]: Finished difference Result 223 states and 287 transitions. [2025-03-04 10:32:16,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 10:32:16,890 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 14 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 15 [2025-03-04 10:32:16,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:32:16,890 INFO L225 Difference]: With dead ends: 223 [2025-03-04 10:32:16,890 INFO L226 Difference]: Without dead ends: 222 [2025-03-04 10:32:16,891 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=137, Invalid=243, Unknown=0, NotChecked=0, Total=380 [2025-03-04 10:32:16,891 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 104 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:32:16,891 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 34 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:32:16,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2025-03-04 10:32:16,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 170. [2025-03-04 10:32:16,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 167 states have (on average 1.2455089820359282) internal successors, (208), 169 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:32:16,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 208 transitions. [2025-03-04 10:32:16,914 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 208 transitions. Word has length 15 [2025-03-04 10:32:16,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:32:16,915 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 208 transitions. [2025-03-04 10:32:16,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 14 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:32:16,915 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 208 transitions. [2025-03-04 10:32:16,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-04 10:32:16,915 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:32:16,915 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:32:16,924 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 10:32:17,115 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,SelfDestructingSolverStorable9 [2025-03-04 10:32:17,116 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 10:32:17,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:32:17,116 INFO L85 PathProgramCache]: Analyzing trace with hash -1450120238, now seen corresponding path program 1 times [2025-03-04 10:32:17,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:32:17,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049950408] [2025-03-04 10:32:17,116 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:32:17,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:32:17,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 10:32:17,127 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 10:32:17,127 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:32:17,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:32:17,155 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:32:17,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:32:17,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049950408] [2025-03-04 10:32:17,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049950408] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:32:17,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1124572283] [2025-03-04 10:32:17,156 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:32:17,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:32:17,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:32:17,158 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:32:17,159 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 10:32:17,175 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 10:32:17,181 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 10:32:17,181 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:32:17,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:32:17,181 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 10:32:17,182 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:32:17,204 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:32:17,205 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:32:17,237 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:32:17,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1124572283] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:32:17,237 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:32:17,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-04 10:32:17,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826367374] [2025-03-04 10:32:17,238 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:32:17,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 10:32:17,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:32:17,238 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 10:32:17,238 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2025-03-04 10:32:17,238 INFO L87 Difference]: Start difference. First operand 170 states and 208 transitions. Second operand has 8 states, 7 states have (on average 5.142857142857143) internal successors, (36), 8 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:32:17,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:32:17,308 INFO L93 Difference]: Finished difference Result 372 states and 473 transitions. [2025-03-04 10:32:17,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 10:32:17,308 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.142857142857143) internal successors, (36), 8 states have internal predecessors, (36), 0 states have call successors, (0), 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-04 10:32:17,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:32:17,310 INFO L225 Difference]: With dead ends: 372 [2025-03-04 10:32:17,310 INFO L226 Difference]: Without dead ends: 371 [2025-03-04 10:32:17,310 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2025-03-04 10:32:17,310 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 42 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:32:17,310 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 43 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:32:17,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2025-03-04 10:32:17,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 277. [2025-03-04 10:32:17,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 274 states have (on average 1.2372262773722629) internal successors, (339), 276 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:32:17,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 339 transitions. [2025-03-04 10:32:17,332 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 339 transitions. Word has length 19 [2025-03-04 10:32:17,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:32:17,332 INFO L471 AbstractCegarLoop]: Abstraction has 277 states and 339 transitions. [2025-03-04 10:32:17,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.142857142857143) internal successors, (36), 8 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:32:17,332 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 339 transitions. [2025-03-04 10:32:17,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-04 10:32:17,332 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:32:17,332 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2025-03-04 10:32:17,339 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 10:32:17,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:32:17,533 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 10:32:17,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:32:17,533 INFO L85 PathProgramCache]: Analyzing trace with hash -643014632, now seen corresponding path program 1 times [2025-03-04 10:32:17,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:32:17,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677588344] [2025-03-04 10:32:17,533 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:32:17,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:32:17,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 10:32:17,541 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 10:32:17,542 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:32:17,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:32:17,608 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:32:17,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:32:17,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677588344] [2025-03-04 10:32:17,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677588344] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:32:17,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [314184101] [2025-03-04 10:32:17,609 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:32:17,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:32:17,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:32:17,611 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:32:17,612 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 10:32:17,632 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 10:32:17,637 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 10:32:17,638 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:32:17,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:32:17,638 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 10:32:17,639 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:32:17,736 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:32:17,737 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:32:17,829 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:32:17,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [314184101] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:32:17,829 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:32:17,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 18 [2025-03-04 10:32:17,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378643310] [2025-03-04 10:32:17,830 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:32:17,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-04 10:32:17,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:32:17,830 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-04 10:32:17,831 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=256, Unknown=0, NotChecked=0, Total=342 [2025-03-04 10:32:17,831 INFO L87 Difference]: Start difference. First operand 277 states and 339 transitions. Second operand has 19 states, 18 states have (on average 3.9444444444444446) internal successors, (71), 19 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:32:18,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:32:18,251 INFO L93 Difference]: Finished difference Result 509 states and 639 transitions. [2025-03-04 10:32:18,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-03-04 10:32:18,252 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 3.9444444444444446) internal successors, (71), 19 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-03-04 10:32:18,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:32:18,253 INFO L225 Difference]: With dead ends: 509 [2025-03-04 10:32:18,253 INFO L226 Difference]: Without dead ends: 507 [2025-03-04 10:32:18,254 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 336 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=498, Invalid=1142, Unknown=0, NotChecked=0, Total=1640 [2025-03-04 10:32:18,255 INFO L435 NwaCegarLoop]: 2 mSDtfsCounter, 53 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:32:18,255 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 9 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:32:18,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2025-03-04 10:32:18,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 311. [2025-03-04 10:32:18,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 311 states, 308 states have (on average 1.2175324675324675) internal successors, (375), 310 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:32:18,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 375 transitions. [2025-03-04 10:32:18,274 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 375 transitions. Word has length 25 [2025-03-04 10:32:18,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:32:18,276 INFO L471 AbstractCegarLoop]: Abstraction has 311 states and 375 transitions. [2025-03-04 10:32:18,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 3.9444444444444446) internal successors, (71), 19 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:32:18,276 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 375 transitions. [2025-03-04 10:32:18,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-04 10:32:18,276 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:32:18,276 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2025-03-04 10:32:18,282 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-04 10:32:18,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:32:18,477 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 10:32:18,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:32:18,477 INFO L85 PathProgramCache]: Analyzing trace with hash 278631675, now seen corresponding path program 2 times [2025-03-04 10:32:18,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:32:18,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806283686] [2025-03-04 10:32:18,478 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:32:18,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:32:18,482 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-03-04 10:32:18,489 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 10:32:18,489 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:32:18,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:32:18,569 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:32:18,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:32:18,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806283686] [2025-03-04 10:32:18,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806283686] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:32:18,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [243499404] [2025-03-04 10:32:18,570 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:32:18,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:32:18,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:32:18,578 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:32:18,580 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 10:32:18,596 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-03-04 10:32:18,602 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 10:32:18,602 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:32:18,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:32:18,602 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 10:32:18,603 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:32:18,728 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:32:18,728 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:32:18,831 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:32:18,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [243499404] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:32:18,831 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:32:18,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 21 [2025-03-04 10:32:18,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932360137] [2025-03-04 10:32:18,832 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:32:18,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-04 10:32:18,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:32:18,832 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-04 10:32:18,833 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=338, Unknown=0, NotChecked=0, Total=462 [2025-03-04 10:32:18,833 INFO L87 Difference]: Start difference. First operand 311 states and 375 transitions. Second operand has 22 states, 21 states have (on average 4.095238095238095) internal successors, (86), 22 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:32:19,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:32:19,817 INFO L93 Difference]: Finished difference Result 1497 states and 1791 transitions. [2025-03-04 10:32:19,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2025-03-04 10:32:19,818 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 4.095238095238095) internal successors, (86), 22 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-03-04 10:32:19,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:32:19,841 INFO L225 Difference]: With dead ends: 1497 [2025-03-04 10:32:19,841 INFO L226 Difference]: Without dead ends: 1496 [2025-03-04 10:32:19,844 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2860 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1920, Invalid=5390, Unknown=0, NotChecked=0, Total=7310 [2025-03-04 10:32:19,844 INFO L435 NwaCegarLoop]: 3 mSDtfsCounter, 290 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 386 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 10:32:19,844 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [290 Valid, 29 Invalid, 439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 386 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 10:32:19,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1496 states. [2025-03-04 10:32:19,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1496 to 707. [2025-03-04 10:32:19,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 707 states, 704 states have (on average 1.2144886363636365) internal successors, (855), 706 states have internal predecessors, (855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:32:19,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 707 states to 707 states and 855 transitions. [2025-03-04 10:32:19,884 INFO L78 Accepts]: Start accepts. Automaton has 707 states and 855 transitions. Word has length 30 [2025-03-04 10:32:19,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:32:19,884 INFO L471 AbstractCegarLoop]: Abstraction has 707 states and 855 transitions. [2025-03-04 10:32:19,884 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 4.095238095238095) internal successors, (86), 22 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:32:19,884 INFO L276 IsEmpty]: Start isEmpty. Operand 707 states and 855 transitions. [2025-03-04 10:32:19,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-04 10:32:19,885 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:32:19,885 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 1, 1, 1, 1] [2025-03-04 10:32:19,891 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-04 10:32:20,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-04 10:32:20,086 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 10:32:20,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:32:20,086 INFO L85 PathProgramCache]: Analyzing trace with hash 813177183, now seen corresponding path program 2 times [2025-03-04 10:32:20,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:32:20,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784879975] [2025-03-04 10:32:20,086 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:32:20,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:32:20,089 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-03-04 10:32:20,097 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-03-04 10:32:20,097 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:32:20,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:32:20,190 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:32:20,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:32:20,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784879975] [2025-03-04 10:32:20,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784879975] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:32:20,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1816777755] [2025-03-04 10:32:20,190 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:32:20,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:32:20,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:32:20,192 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:32:20,194 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 10:32:20,208 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-03-04 10:32:20,214 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-03-04 10:32:20,214 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:32:20,214 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:32:20,214 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 10:32:20,215 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:32:20,394 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:32:20,394 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:32:20,553 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:32:20,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1816777755] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:32:20,554 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:32:20,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 31 [2025-03-04 10:32:20,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115291281] [2025-03-04 10:32:20,554 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:32:20,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-03-04 10:32:20,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:32:20,555 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-03-04 10:32:20,555 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=247, Invalid=745, Unknown=0, NotChecked=0, Total=992 [2025-03-04 10:32:20,555 INFO L87 Difference]: Start difference. First operand 707 states and 855 transitions. Second operand has 32 states, 31 states have (on average 3.064516129032258) internal successors, (95), 32 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:32:21,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:32:21,405 INFO L93 Difference]: Finished difference Result 1334 states and 1582 transitions. [2025-03-04 10:32:21,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2025-03-04 10:32:21,406 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 3.064516129032258) internal successors, (95), 32 states have internal predecessors, (95), 0 states have call successors, (0), 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 33 [2025-03-04 10:32:21,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:32:21,409 INFO L225 Difference]: With dead ends: 1334 [2025-03-04 10:32:21,409 INFO L226 Difference]: Without dead ends: 1333 [2025-03-04 10:32:21,411 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1364 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1263, Invalid=2643, Unknown=0, NotChecked=0, Total=3906 [2025-03-04 10:32:21,412 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 492 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 662 mSolverCounterSat, 149 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 492 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 811 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 149 IncrementalHoareTripleChecker+Valid, 662 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 10:32:21,412 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [492 Valid, 104 Invalid, 811 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [149 Valid, 662 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 10:32:21,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1333 states. [2025-03-04 10:32:21,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1333 to 884. [2025-03-04 10:32:21,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 884 states, 881 states have (on average 1.2088535754824064) internal successors, (1065), 883 states have internal predecessors, (1065), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:32:21,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 884 states to 884 states and 1065 transitions. [2025-03-04 10:32:21,481 INFO L78 Accepts]: Start accepts. Automaton has 884 states and 1065 transitions. Word has length 33 [2025-03-04 10:32:21,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:32:21,482 INFO L471 AbstractCegarLoop]: Abstraction has 884 states and 1065 transitions. [2025-03-04 10:32:21,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 3.064516129032258) internal successors, (95), 32 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:32:21,483 INFO L276 IsEmpty]: Start isEmpty. Operand 884 states and 1065 transitions. [2025-03-04 10:32:21,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-04 10:32:21,483 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:32:21,483 INFO L218 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 1, 1, 1, 1] [2025-03-04 10:32:21,491 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-04 10:32:21,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:32:21,689 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 10:32:21,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:32:21,689 INFO L85 PathProgramCache]: Analyzing trace with hash -220775299, now seen corresponding path program 1 times [2025-03-04 10:32:21,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:32:21,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186818880] [2025-03-04 10:32:21,689 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:32:21,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:32:21,692 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-04 10:32:21,695 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-04 10:32:21,695 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:32:21,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:32:21,725 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 32 proven. 2 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-04 10:32:21,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:32:21,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186818880] [2025-03-04 10:32:21,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1186818880] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:32:21,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1553490293] [2025-03-04 10:32:21,725 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:32:21,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:32:21,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:32:21,727 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:32:21,728 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 10:32:21,747 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-04 10:32:21,753 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-04 10:32:21,753 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:32:21,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:32:21,753 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 10:32:21,754 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:32:21,816 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:32:21,816 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:32:21,892 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:32:21,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1553490293] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:32:21,892 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:32:21,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7, 7] total 15 [2025-03-04 10:32:21,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640834608] [2025-03-04 10:32:21,893 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:32:21,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-04 10:32:21,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:32:21,893 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-04 10:32:21,893 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=145, Unknown=0, NotChecked=0, Total=240 [2025-03-04 10:32:21,893 INFO L87 Difference]: Start difference. First operand 884 states and 1065 transitions. Second operand has 16 states, 15 states have (on average 5.6) internal successors, (84), 16 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:32:22,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:32:22,330 INFO L93 Difference]: Finished difference Result 3034 states and 3717 transitions. [2025-03-04 10:32:22,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-03-04 10:32:22,331 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 5.6) internal successors, (84), 16 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2025-03-04 10:32:22,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:32:22,338 INFO L225 Difference]: With dead ends: 3034 [2025-03-04 10:32:22,338 INFO L226 Difference]: Without dead ends: 2830 [2025-03-04 10:32:22,339 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 69 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 388 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=545, Invalid=1015, Unknown=0, NotChecked=0, Total=1560 [2025-03-04 10:32:22,339 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 212 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:32:22,340 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 28 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:32:22,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2830 states. [2025-03-04 10:32:22,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2830 to 458. [2025-03-04 10:32:22,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 458 states, 456 states have (on average 1.1864035087719298) internal successors, (541), 457 states have internal predecessors, (541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:32:22,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 541 transitions. [2025-03-04 10:32:22,388 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 541 transitions. Word has length 35 [2025-03-04 10:32:22,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:32:22,388 INFO L471 AbstractCegarLoop]: Abstraction has 458 states and 541 transitions. [2025-03-04 10:32:22,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 5.6) internal successors, (84), 16 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:32:22,388 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 541 transitions. [2025-03-04 10:32:22,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-03-04 10:32:22,389 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:32:22,389 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:32:22,395 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-04 10:32:22,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:32:22,593 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 10:32:22,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:32:22,594 INFO L85 PathProgramCache]: Analyzing trace with hash -1652292590, now seen corresponding path program 2 times [2025-03-04 10:32:22,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:32:22,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009824141] [2025-03-04 10:32:22,594 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:32:22,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:32:22,597 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 39 statements into 2 equivalence classes. [2025-03-04 10:32:22,599 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 39 of 39 statements. [2025-03-04 10:32:22,599 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:32:22,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:32:22,707 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 93 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:32:22,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:32:22,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009824141] [2025-03-04 10:32:22,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009824141] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:32:22,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [456913112] [2025-03-04 10:32:22,707 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:32:22,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:32:22,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:32:22,709 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:32:22,711 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-04 10:32:22,726 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 39 statements into 2 equivalence classes. [2025-03-04 10:32:22,733 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 39 of 39 statements. [2025-03-04 10:32:22,733 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:32:22,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:32:22,733 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 10:32:22,734 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:32:22,766 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 93 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:32:22,766 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:32:22,845 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 93 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:32:22,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [456913112] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:32:22,845 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:32:22,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2025-03-04 10:32:22,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627676967] [2025-03-04 10:32:22,845 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:32:22,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-04 10:32:22,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:32:22,846 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-04 10:32:22,846 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2025-03-04 10:32:22,846 INFO L87 Difference]: Start difference. First operand 458 states and 541 transitions. Second operand has 16 states, 15 states have (on average 5.066666666666666) internal successors, (76), 16 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:32:23,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:32:23,104 INFO L93 Difference]: Finished difference Result 1683 states and 2064 transitions. [2025-03-04 10:32:23,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-04 10:32:23,105 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 5.066666666666666) internal successors, (76), 16 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2025-03-04 10:32:23,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:32:23,108 INFO L225 Difference]: With dead ends: 1683 [2025-03-04 10:32:23,108 INFO L226 Difference]: Without dead ends: 1682 [2025-03-04 10:32:23,109 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2025-03-04 10:32:23,109 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 146 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:32:23,109 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 83 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:32:23,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1682 states. [2025-03-04 10:32:23,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1682 to 1156. [2025-03-04 10:32:23,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1156 states, 1154 states have (on average 1.1785095320623917) internal successors, (1360), 1155 states have internal predecessors, (1360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:32:23,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1156 states to 1156 states and 1360 transitions. [2025-03-04 10:32:23,217 INFO L78 Accepts]: Start accepts. Automaton has 1156 states and 1360 transitions. Word has length 39 [2025-03-04 10:32:23,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:32:23,217 INFO L471 AbstractCegarLoop]: Abstraction has 1156 states and 1360 transitions. [2025-03-04 10:32:23,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 5.066666666666666) internal successors, (76), 16 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:32:23,218 INFO L276 IsEmpty]: Start isEmpty. Operand 1156 states and 1360 transitions. [2025-03-04 10:32:23,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-04 10:32:23,218 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:32:23,218 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1] [2025-03-04 10:32:23,224 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-04 10:32:23,423 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,SelfDestructingSolverStorable15 [2025-03-04 10:32:23,423 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 10:32:23,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:32:23,423 INFO L85 PathProgramCache]: Analyzing trace with hash 2017054710, now seen corresponding path program 3 times [2025-03-04 10:32:23,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:32:23,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039125414] [2025-03-04 10:32:23,424 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:32:23,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:32:23,427 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 46 statements into 8 equivalence classes. [2025-03-04 10:32:23,434 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) and asserted 46 of 46 statements. [2025-03-04 10:32:23,434 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2025-03-04 10:32:23,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:32:23,551 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 0 proven. 83 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:32:23,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:32:23,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039125414] [2025-03-04 10:32:23,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039125414] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:32:23,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1011334900] [2025-03-04 10:32:23,551 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:32:23,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:32:23,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:32:23,553 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:32:23,554 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-04 10:32:23,569 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 46 statements into 8 equivalence classes. [2025-03-04 10:32:23,576 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) and asserted 46 of 46 statements. [2025-03-04 10:32:23,577 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2025-03-04 10:32:23,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:32:23,577 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-04 10:32:23,578 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:32:23,802 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 0 proven. 83 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:32:23,802 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:32:24,027 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 0 proven. 83 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:32:24,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1011334900] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:32:24,027 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:32:24,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 16, 16] total 43 [2025-03-04 10:32:24,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340579442] [2025-03-04 10:32:24,027 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:32:24,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2025-03-04 10:32:24,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:32:24,028 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2025-03-04 10:32:24,028 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=336, Invalid=1556, Unknown=0, NotChecked=0, Total=1892 [2025-03-04 10:32:24,028 INFO L87 Difference]: Start difference. First operand 1156 states and 1360 transitions. Second operand has 44 states, 43 states have (on average 3.116279069767442) internal successors, (134), 44 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:32:29,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:32:29,934 INFO L93 Difference]: Finished difference Result 7769 states and 9098 transitions. [2025-03-04 10:32:29,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 226 states. [2025-03-04 10:32:29,934 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 43 states have (on average 3.116279069767442) internal successors, (134), 44 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2025-03-04 10:32:29,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:32:29,950 INFO L225 Difference]: With dead ends: 7769 [2025-03-04 10:32:29,950 INFO L226 Difference]: Without dead ends: 7768 [2025-03-04 10:32:29,958 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 321 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 260 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33619 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=18526, Invalid=49856, Unknown=0, NotChecked=0, Total=68382 [2025-03-04 10:32:29,959 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 1019 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 3631 mSolverCounterSat, 255 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1019 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 3886 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 255 IncrementalHoareTripleChecker+Valid, 3631 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-04 10:32:29,959 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1019 Valid, 28 Invalid, 3886 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [255 Valid, 3631 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-04 10:32:29,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7768 states. [2025-03-04 10:32:30,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7768 to 4016. [2025-03-04 10:32:30,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4016 states, 4014 states have (on average 1.1878425510712507) internal successors, (4768), 4015 states have internal predecessors, (4768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:32:30,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4016 states to 4016 states and 4768 transitions. [2025-03-04 10:32:30,505 INFO L78 Accepts]: Start accepts. Automaton has 4016 states and 4768 transitions. Word has length 46 [2025-03-04 10:32:30,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:32:30,505 INFO L471 AbstractCegarLoop]: Abstraction has 4016 states and 4768 transitions. [2025-03-04 10:32:30,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 43 states have (on average 3.116279069767442) internal successors, (134), 44 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:32:30,506 INFO L276 IsEmpty]: Start isEmpty. Operand 4016 states and 4768 transitions. [2025-03-04 10:32:30,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-04 10:32:30,506 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:32:30,506 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2025-03-04 10:32:30,512 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-04 10:32:30,707 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,SelfDestructingSolverStorable16 [2025-03-04 10:32:30,707 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 10:32:30,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:32:30,708 INFO L85 PathProgramCache]: Analyzing trace with hash 1279469058, now seen corresponding path program 4 times [2025-03-04 10:32:30,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:32:30,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942360696] [2025-03-04 10:32:30,708 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 10:32:30,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:32:30,711 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 60 statements into 2 equivalence classes. [2025-03-04 10:32:30,718 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 60 of 60 statements. [2025-03-04 10:32:30,720 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 10:32:30,721 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:32:30,951 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 0 proven. 162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:32:30,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:32:30,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942360696] [2025-03-04 10:32:30,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942360696] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:32:30,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1499994041] [2025-03-04 10:32:30,951 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 10:32:30,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:32:30,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:32:30,954 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:32:30,955 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-04 10:32:30,971 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 60 statements into 2 equivalence classes. [2025-03-04 10:32:30,981 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 60 of 60 statements. [2025-03-04 10:32:30,981 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 10:32:30,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:32:30,982 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-04 10:32:30,983 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:32:31,363 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 0 proven. 162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:32:31,363 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:32:31,700 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 0 proven. 162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:32:31,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1499994041] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:32:31,700 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:32:31,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 58 [2025-03-04 10:32:31,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122608178] [2025-03-04 10:32:31,700 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:32:31,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2025-03-04 10:32:31,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:32:31,701 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2025-03-04 10:32:31,701 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=549, Invalid=2873, Unknown=0, NotChecked=0, Total=3422 [2025-03-04 10:32:31,702 INFO L87 Difference]: Start difference. First operand 4016 states and 4768 transitions. Second operand has 59 states, 58 states have (on average 3.0344827586206895) internal successors, (176), 59 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:32:47,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:32:47,937 INFO L93 Difference]: Finished difference Result 31307 states and 36529 transitions. [2025-03-04 10:32:47,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 405 states. [2025-03-04 10:32:47,937 INFO L78 Accepts]: Start accepts. Automaton has has 59 states, 58 states have (on average 3.0344827586206895) internal successors, (176), 59 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2025-03-04 10:32:47,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:32:48,004 INFO L225 Difference]: With dead ends: 31307 [2025-03-04 10:32:48,004 INFO L226 Difference]: Without dead ends: 31306 [2025-03-04 10:32:48,024 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 529 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 447 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108054 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=57344, Invalid=143808, Unknown=0, NotChecked=0, Total=201152 [2025-03-04 10:32:48,024 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 2100 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 4947 mSolverCounterSat, 740 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2100 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 5687 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 740 IncrementalHoareTripleChecker+Valid, 4947 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-04 10:32:48,024 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2100 Valid, 75 Invalid, 5687 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [740 Valid, 4947 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-04 10:32:48,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31306 states. [2025-03-04 10:32:51,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31306 to 16726. [2025-03-04 10:32:51,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16726 states, 16724 states have (on average 1.185601530734274) internal successors, (19828), 16725 states have internal predecessors, (19828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:32:51,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16726 states to 16726 states and 19828 transitions. [2025-03-04 10:32:51,257 INFO L78 Accepts]: Start accepts. Automaton has 16726 states and 19828 transitions. Word has length 60 [2025-03-04 10:32:51,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:32:51,257 INFO L471 AbstractCegarLoop]: Abstraction has 16726 states and 19828 transitions. [2025-03-04 10:32:51,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 58 states have (on average 3.0344827586206895) internal successors, (176), 59 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:32:51,258 INFO L276 IsEmpty]: Start isEmpty. Operand 16726 states and 19828 transitions. [2025-03-04 10:32:51,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-04 10:32:51,261 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:32:51,261 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1] [2025-03-04 10:32:51,267 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-04 10:32:51,465 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,SelfDestructingSolverStorable17 [2025-03-04 10:32:51,465 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 10:32:51,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:32:51,465 INFO L85 PathProgramCache]: Analyzing trace with hash 318562993, now seen corresponding path program 5 times [2025-03-04 10:32:51,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:32:51,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679557620] [2025-03-04 10:32:51,466 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 10:32:51,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:32:51,469 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 62 statements into 11 equivalence classes. [2025-03-04 10:32:51,481 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) and asserted 62 of 62 statements. [2025-03-04 10:32:51,482 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2025-03-04 10:32:51,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:32:51,811 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:32:51,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:32:51,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679557620] [2025-03-04 10:32:51,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679557620] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:32:51,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [234632057] [2025-03-04 10:32:51,812 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 10:32:51,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:32:51,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:32:51,814 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:32:51,816 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-04 10:32:51,836 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 62 statements into 11 equivalence classes. [2025-03-04 10:32:51,849 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) and asserted 62 of 62 statements. [2025-03-04 10:32:51,850 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2025-03-04 10:32:51,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:32:51,851 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-04 10:32:51,852 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:32:52,256 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:32:52,256 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:32:52,652 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:32:52,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [234632057] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:32:52,652 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:32:52,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 64 [2025-03-04 10:32:52,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180747993] [2025-03-04 10:32:52,652 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:32:52,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2025-03-04 10:32:52,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:32:52,653 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2025-03-04 10:32:52,654 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=850, Invalid=3310, Unknown=0, NotChecked=0, Total=4160 [2025-03-04 10:32:52,654 INFO L87 Difference]: Start difference. First operand 16726 states and 19828 transitions. Second operand has 65 states, 64 states have (on average 2.84375) internal successors, (182), 65 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:33:25,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:33:25,926 INFO L93 Difference]: Finished difference Result 65678 states and 77100 transitions. [2025-03-04 10:33:25,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 810 states. [2025-03-04 10:33:25,927 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 64 states have (on average 2.84375) internal successors, (182), 65 states have internal predecessors, (182), 0 states have call successors, (0), 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 62 [2025-03-04 10:33:25,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:33:26,045 INFO L225 Difference]: With dead ends: 65678 [2025-03-04 10:33:26,046 INFO L226 Difference]: Without dead ends: 65677 [2025-03-04 10:33:26,081 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 942 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 860 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 401031 ImplicationChecksByTransitivity, 18.4s TimeCoverageRelationStatistics Valid=166251, Invalid=575931, Unknown=0, NotChecked=0, Total=742182 [2025-03-04 10:33:26,081 INFO L435 NwaCegarLoop]: 3 mSDtfsCounter, 2442 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 9598 mSolverCounterSat, 619 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2442 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 10217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 619 IncrementalHoareTripleChecker+Valid, 9598 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2025-03-04 10:33:26,081 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2442 Valid, 30 Invalid, 10217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [619 Valid, 9598 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2025-03-04 10:33:26,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65677 states. [2025-03-04 10:33:30,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65677 to 22759. [2025-03-04 10:33:30,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22759 states, 22757 states have (on average 1.1875027464076988) internal successors, (27024), 22758 states have internal predecessors, (27024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:33:30,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22759 states to 22759 states and 27024 transitions. [2025-03-04 10:33:30,553 INFO L78 Accepts]: Start accepts. Automaton has 22759 states and 27024 transitions. Word has length 62 [2025-03-04 10:33:30,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:33:30,554 INFO L471 AbstractCegarLoop]: Abstraction has 22759 states and 27024 transitions. [2025-03-04 10:33:30,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 64 states have (on average 2.84375) internal successors, (182), 65 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:33:30,554 INFO L276 IsEmpty]: Start isEmpty. Operand 22759 states and 27024 transitions. [2025-03-04 10:33:30,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-04 10:33:30,558 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:33:30,558 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 11, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2025-03-04 10:33:30,563 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-04 10:33:30,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:33:30,758 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 10:33:30,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:33:30,759 INFO L85 PathProgramCache]: Analyzing trace with hash -1435716485, now seen corresponding path program 6 times [2025-03-04 10:33:30,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:33:30,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183603637] [2025-03-04 10:33:30,759 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 10:33:30,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:33:30,762 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 70 statements into 13 equivalence classes. [2025-03-04 10:33:30,768 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) and asserted 70 of 70 statements. [2025-03-04 10:33:30,768 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2025-03-04 10:33:30,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:30,955 INFO L134 CoverageAnalysis]: Checked inductivity of 303 backedges. 0 proven. 303 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:33:30,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:33:30,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183603637] [2025-03-04 10:33:30,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183603637] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:33:30,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2139695622] [2025-03-04 10:33:30,956 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 10:33:30,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:33:30,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:33:30,958 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:33:30,959 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-04 10:33:30,997 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 70 statements into 13 equivalence classes. [2025-03-04 10:33:31,012 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) and asserted 70 of 70 statements. [2025-03-04 10:33:31,012 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2025-03-04 10:33:31,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:31,013 INFO L256 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-04 10:33:31,015 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:33:31,271 INFO L134 CoverageAnalysis]: Checked inductivity of 303 backedges. 0 proven. 303 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:33:31,272 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:33:31,538 INFO L134 CoverageAnalysis]: Checked inductivity of 303 backedges. 0 proven. 303 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:33:31,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2139695622] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:33:31,538 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:33:31,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15, 15] total 45 [2025-03-04 10:33:31,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279966929] [2025-03-04 10:33:31,539 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:33:31,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2025-03-04 10:33:31,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:33:31,539 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2025-03-04 10:33:31,539 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=736, Invalid=1334, Unknown=0, NotChecked=0, Total=2070 [2025-03-04 10:33:31,540 INFO L87 Difference]: Start difference. First operand 22759 states and 27024 transitions. Second operand has 46 states, 45 states have (on average 4.5777777777777775) internal successors, (206), 46 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:33:36,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:33:36,633 INFO L93 Difference]: Finished difference Result 28195 states and 33322 transitions. [2025-03-04 10:33:36,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2025-03-04 10:33:36,633 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 45 states have (on average 4.5777777777777775) internal successors, (206), 46 states have internal predecessors, (206), 0 states have call successors, (0), 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 70 [2025-03-04 10:33:36,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:33:36,665 INFO L225 Difference]: With dead ends: 28195 [2025-03-04 10:33:36,665 INFO L226 Difference]: Without dead ends: 28194 [2025-03-04 10:33:36,670 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2184 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=2302, Invalid=5008, Unknown=0, NotChecked=0, Total=7310 [2025-03-04 10:33:36,670 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 299 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 489 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 558 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 489 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 10:33:36,670 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [299 Valid, 97 Invalid, 558 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 489 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 10:33:36,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28194 states. [2025-03-04 10:33:41,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28194 to 25115. [2025-03-04 10:33:41,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25115 states, 25113 states have (on average 1.1886274041333174) internal successors, (29850), 25114 states have internal predecessors, (29850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:33:41,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25115 states to 25115 states and 29850 transitions. [2025-03-04 10:33:41,384 INFO L78 Accepts]: Start accepts. Automaton has 25115 states and 29850 transitions. Word has length 70 [2025-03-04 10:33:41,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:33:41,385 INFO L471 AbstractCegarLoop]: Abstraction has 25115 states and 29850 transitions. [2025-03-04 10:33:41,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 45 states have (on average 4.5777777777777775) internal successors, (206), 46 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:33:41,385 INFO L276 IsEmpty]: Start isEmpty. Operand 25115 states and 29850 transitions. [2025-03-04 10:33:41,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-04 10:33:41,394 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:33:41,394 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1] [2025-03-04 10:33:41,402 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-03-04 10:33:41,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:33:41,595 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 10:33:41,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:33:41,596 INFO L85 PathProgramCache]: Analyzing trace with hash -36438740, now seen corresponding path program 7 times [2025-03-04 10:33:41,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:33:41,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093223871] [2025-03-04 10:33:41,596 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 10:33:41,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:33:41,598 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-04 10:33:41,603 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-04 10:33:41,604 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:33:41,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:41,878 INFO L134 CoverageAnalysis]: Checked inductivity of 285 backedges. 0 proven. 285 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:33:41,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:33:41,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093223871] [2025-03-04 10:33:41,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2093223871] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:33:41,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2120495139] [2025-03-04 10:33:41,878 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 10:33:41,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:33:41,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:33:41,880 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:33:41,882 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-04 10:33:41,900 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-04 10:33:41,911 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-04 10:33:41,911 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:33:41,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:41,912 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-04 10:33:41,915 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:33:42,277 INFO L134 CoverageAnalysis]: Checked inductivity of 285 backedges. 0 proven. 285 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:33:42,277 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:33:42,625 INFO L134 CoverageAnalysis]: Checked inductivity of 285 backedges. 0 proven. 285 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:33:42,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2120495139] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:33:42,625 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:33:42,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 19, 19] total 64 [2025-03-04 10:33:42,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278751178] [2025-03-04 10:33:42,625 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:33:42,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2025-03-04 10:33:42,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:33:42,626 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2025-03-04 10:33:42,626 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=871, Invalid=3289, Unknown=0, NotChecked=0, Total=4160 [2025-03-04 10:33:42,627 INFO L87 Difference]: Start difference. First operand 25115 states and 29850 transitions. Second operand has 65 states, 64 states have (on average 3.59375) internal successors, (230), 65 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)