./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/array-multidimensional/rev-3-u.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/array-multidimensional/rev-3-u.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash fe3cf414f0e241a9a4e73e59647cf6619ea50b905df4a1c2a404b3413992b780 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 01:37:01,367 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 01:37:01,426 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-09 01:37:01,431 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 01:37:01,431 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 01:37:01,448 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 01:37:01,449 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 01:37:01,449 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 01:37:01,449 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 01:37:01,450 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 01:37:01,450 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 01:37:01,450 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 01:37:01,451 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 01:37:01,451 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 01:37:01,451 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 01:37:01,451 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 01:37:01,452 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-09 01:37:01,452 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 01:37:01,452 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 01:37:01,452 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 01:37:01,452 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 01:37:01,452 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-09 01:37:01,452 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 01:37:01,452 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-09 01:37:01,452 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-09 01:37:01,452 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 01:37:01,452 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 01:37:01,452 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-09 01:37:01,452 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 01:37:01,453 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 01:37:01,453 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 01:37:01,453 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 01:37:01,453 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 01:37:01,453 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 01:37:01,453 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:37:01,453 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 01:37:01,453 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 01:37:01,453 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-09 01:37:01,454 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-09 01:37:01,454 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 01:37:01,454 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 01:37:01,454 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 01:37:01,454 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 01:37:01,454 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 01:37:01,454 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 01:37:01,454 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> fe3cf414f0e241a9a4e73e59647cf6619ea50b905df4a1c2a404b3413992b780 [2025-03-09 01:37:01,655 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 01:37:01,661 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 01:37:01,664 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 01:37:01,666 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 01:37:01,666 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 01:37:01,668 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-multidimensional/rev-3-u.c [2025-03-09 01:37:02,788 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d365e0e0/d0b8a79272c4475d869fc3b8cc574d96/FLAG1e9c8f32e [2025-03-09 01:37:03,022 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 01:37:03,024 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-multidimensional/rev-3-u.c [2025-03-09 01:37:03,033 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d365e0e0/d0b8a79272c4475d869fc3b8cc574d96/FLAG1e9c8f32e [2025-03-09 01:37:03,356 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d365e0e0/d0b8a79272c4475d869fc3b8cc574d96 [2025-03-09 01:37:03,358 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 01:37:03,359 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 01:37:03,360 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 01:37:03,360 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 01:37:03,363 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 01:37:03,363 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:37:03" (1/1) ... [2025-03-09 01:37:03,363 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19d1a6a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:37:03, skipping insertion in model container [2025-03-09 01:37:03,364 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:37:03" (1/1) ... [2025-03-09 01:37:03,374 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 01:37:03,465 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:37:03,474 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 01:37:03,490 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:37:03,503 INFO L204 MainTranslator]: Completed translation [2025-03-09 01:37:03,504 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:37:03 WrapperNode [2025-03-09 01:37:03,504 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 01:37:03,507 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 01:37:03,507 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 01:37:03,507 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 01:37:03,511 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:37:03" (1/1) ... [2025-03-09 01:37:03,515 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:37:03" (1/1) ... [2025-03-09 01:37:03,527 INFO L138 Inliner]: procedures = 14, calls = 20, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 122 [2025-03-09 01:37:03,527 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 01:37:03,528 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 01:37:03,528 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 01:37:03,528 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 01:37:03,533 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:37:03" (1/1) ... [2025-03-09 01:37:03,533 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:37:03" (1/1) ... [2025-03-09 01:37:03,535 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:37:03" (1/1) ... [2025-03-09 01:37:03,543 INFO L175 MemorySlicer]: Split 7 memory accesses to 3 slices as follows [2, 2, 3]. 43 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 2 writes are split as follows [0, 1, 1]. [2025-03-09 01:37:03,543 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:37:03" (1/1) ... [2025-03-09 01:37:03,543 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:37:03" (1/1) ... [2025-03-09 01:37:03,547 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:37:03" (1/1) ... [2025-03-09 01:37:03,548 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:37:03" (1/1) ... [2025-03-09 01:37:03,550 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:37:03" (1/1) ... [2025-03-09 01:37:03,551 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:37:03" (1/1) ... [2025-03-09 01:37:03,552 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 01:37:03,554 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 01:37:03,554 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 01:37:03,554 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 01:37:03,555 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:37:03" (1/1) ... [2025-03-09 01:37:03,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:37:03,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:37:03,579 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-09 01:37:03,582 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-09 01:37:03,600 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 01:37:03,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 01:37:03,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-09 01:37:03,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-09 01:37:03,600 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-09 01:37:03,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-09 01:37:03,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-09 01:37:03,601 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-09 01:37:03,601 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 01:37:03,601 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 01:37:03,601 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-09 01:37:03,601 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-09 01:37:03,601 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-09 01:37:03,601 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-09 01:37:03,657 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 01:37:03,658 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 01:37:03,895 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L18: call ULTIMATE.dealloc(main_~#A~0#1.base, main_~#A~0#1.offset);havoc main_~#A~0#1.base, main_~#A~0#1.offset;call ULTIMATE.dealloc(main_~#B~0#1.base, main_~#B~0#1.offset);havoc main_~#B~0#1.base, main_~#B~0#1.offset; [2025-03-09 01:37:03,906 INFO L? ?]: Removed 90 outVars from TransFormulas that were not future-live. [2025-03-09 01:37:03,907 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 01:37:03,918 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 01:37:03,918 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 01:37:03,919 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:37:03 BoogieIcfgContainer [2025-03-09 01:37:03,919 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 01:37:03,920 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 01:37:03,920 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 01:37:03,925 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 01:37:03,926 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 01:37:03" (1/3) ... [2025-03-09 01:37:03,927 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39965cd8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:37:03, skipping insertion in model container [2025-03-09 01:37:03,927 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:37:03" (2/3) ... [2025-03-09 01:37:03,927 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39965cd8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:37:03, skipping insertion in model container [2025-03-09 01:37:03,928 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:37:03" (3/3) ... [2025-03-09 01:37:03,928 INFO L128 eAbstractionObserver]: Analyzing ICFG rev-3-u.c [2025-03-09 01:37:03,939 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 01:37:03,940 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG rev-3-u.c that has 1 procedures, 102 locations, 1 initial locations, 9 loop locations, and 42 error locations. [2025-03-09 01:37:03,975 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 01:37:03,984 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;@16f4b158, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 01:37:03,984 INFO L334 AbstractCegarLoop]: Starting to check reachability of 42 error locations. [2025-03-09 01:37:03,988 INFO L276 IsEmpty]: Start isEmpty. Operand has 102 states, 59 states have (on average 1.88135593220339) internal successors, (111), 101 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:37:03,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-09 01:37:03,993 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:37:03,993 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-09 01:37:03,993 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-03-09 01:37:03,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:37:03,998 INFO L85 PathProgramCache]: Analyzing trace with hash 135479490, now seen corresponding path program 1 times [2025-03-09 01:37:04,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:37:04,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243551719] [2025-03-09 01:37:04,005 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:37:04,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:37:04,059 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 01:37:04,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 01:37:04,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:37:04,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:37:04,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:37:04,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:37:04,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243551719] [2025-03-09 01:37:04,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243551719] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:37:04,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:37:04,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 01:37:04,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830362381] [2025-03-09 01:37:04,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:37:04,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:37:04,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:37:04,222 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:37:04,222 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:37:04,224 INFO L87 Difference]: Start difference. First operand has 102 states, 59 states have (on average 1.88135593220339) internal successors, (111), 101 states have internal predecessors, (111), 0 states have call successors, (0), 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 4 states, 4 states have (on average 1.25) internal successors, (5), 4 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-09 01:37:04,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:37:04,430 INFO L93 Difference]: Finished difference Result 252 states and 307 transitions. [2025-03-09 01:37:04,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:37:04,432 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 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-09 01:37:04,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:37:04,437 INFO L225 Difference]: With dead ends: 252 [2025-03-09 01:37:04,437 INFO L226 Difference]: Without dead ends: 147 [2025-03-09 01:37:04,439 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:37:04,441 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 131 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 01:37:04,442 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 68 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 01:37:04,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2025-03-09 01:37:04,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 141. [2025-03-09 01:37:04,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 99 states have (on average 1.797979797979798) internal successors, (178), 140 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:37:04,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 178 transitions. [2025-03-09 01:37:04,480 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 178 transitions. Word has length 5 [2025-03-09 01:37:04,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:37:04,481 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 178 transitions. [2025-03-09 01:37:04,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 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-09 01:37:04,482 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 178 transitions. [2025-03-09 01:37:04,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-09 01:37:04,483 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:37:04,483 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-09 01:37:04,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 01:37:04,484 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr41ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-03-09 01:37:04,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:37:04,485 INFO L85 PathProgramCache]: Analyzing trace with hash -95103683, now seen corresponding path program 1 times [2025-03-09 01:37:04,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:37:04,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349790347] [2025-03-09 01:37:04,485 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:37:04,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:37:04,494 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 01:37:04,504 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 01:37:04,507 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:37:04,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:37:04,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:37:04,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:37:04,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349790347] [2025-03-09 01:37:04,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349790347] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:37:04,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:37:04,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:37:04,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279663781] [2025-03-09 01:37:04,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:37:04,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:37:04,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:37:04,568 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:37:04,568 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:37:04,568 INFO L87 Difference]: Start difference. First operand 141 states and 178 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:37:04,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:37:04,671 INFO L93 Difference]: Finished difference Result 233 states and 310 transitions. [2025-03-09 01:37:04,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:37:04,672 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-03-09 01:37:04,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:37:04,674 INFO L225 Difference]: With dead ends: 233 [2025-03-09 01:37:04,675 INFO L226 Difference]: Without dead ends: 227 [2025-03-09 01:37:04,676 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:37:04,676 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 47 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:37:04,677 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 145 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 01:37:04,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2025-03-09 01:37:04,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 211. [2025-03-09 01:37:04,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 169 states have (on average 1.7633136094674555) internal successors, (298), 210 states have internal predecessors, (298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:37:04,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 298 transitions. [2025-03-09 01:37:04,698 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 298 transitions. Word has length 6 [2025-03-09 01:37:04,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:37:04,698 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 298 transitions. [2025-03-09 01:37:04,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:37:04,698 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 298 transitions. [2025-03-09 01:37:04,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-09 01:37:04,698 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:37:04,700 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:37:04,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-09 01:37:04,700 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-03-09 01:37:04,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:37:04,701 INFO L85 PathProgramCache]: Analyzing trace with hash 1330560794, now seen corresponding path program 1 times [2025-03-09 01:37:04,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:37:04,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918769907] [2025-03-09 01:37:04,701 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:37:04,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:37:04,706 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 01:37:04,709 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 01:37:04,709 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:37:04,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:37:04,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:37:04,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:37:04,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918769907] [2025-03-09 01:37:04,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918769907] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:37:04,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:37:04,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:37:04,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050576505] [2025-03-09 01:37:04,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:37:04,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:37:04,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:37:04,739 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:37:04,739 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:37:04,740 INFO L87 Difference]: Start difference. First operand 211 states and 298 transitions. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:37:04,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:37:04,865 INFO L93 Difference]: Finished difference Result 420 states and 594 transitions. [2025-03-09 01:37:04,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:37:04,866 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-03-09 01:37:04,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:37:04,867 INFO L225 Difference]: With dead ends: 420 [2025-03-09 01:37:04,870 INFO L226 Difference]: Without dead ends: 236 [2025-03-09 01:37:04,871 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:37:04,871 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 14 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:37:04,871 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 125 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 01:37:04,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2025-03-09 01:37:04,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 232. [2025-03-09 01:37:04,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 190 states have (on average 1.736842105263158) internal successors, (330), 231 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:37:04,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 330 transitions. [2025-03-09 01:37:04,891 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 330 transitions. Word has length 7 [2025-03-09 01:37:04,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:37:04,892 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 330 transitions. [2025-03-09 01:37:04,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:37:04,892 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 330 transitions. [2025-03-09 01:37:04,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-09 01:37:04,892 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:37:04,892 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:37:04,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-09 01:37:04,892 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr41ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-03-09 01:37:04,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:37:04,893 INFO L85 PathProgramCache]: Analyzing trace with hash 1444666729, now seen corresponding path program 1 times [2025-03-09 01:37:04,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:37:04,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941085293] [2025-03-09 01:37:04,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:37:04,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:37:04,902 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 01:37:04,914 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 01:37:04,918 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:37:04,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:37:04,949 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:37:04,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:37:04,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941085293] [2025-03-09 01:37:04,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941085293] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:37:04,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2032934012] [2025-03-09 01:37:04,950 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:37:04,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:37:04,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:37:04,952 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:37:04,954 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-09 01:37:04,985 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 01:37:04,994 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 01:37:04,994 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:37:04,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:37:04,995 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 01:37:04,998 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:37:05,025 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:37:05,025 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 01:37:05,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2032934012] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:37:05,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 01:37:05,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2025-03-09 01:37:05,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924450854] [2025-03-09 01:37:05,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:37:05,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:37:05,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:37:05,026 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:37:05,026 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:37:05,027 INFO L87 Difference]: Start difference. First operand 232 states and 330 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-09 01:37:05,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:37:05,117 INFO L93 Difference]: Finished difference Result 248 states and 330 transitions. [2025-03-09 01:37:05,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:37:05,117 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-09 01:37:05,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:37:05,118 INFO L225 Difference]: With dead ends: 248 [2025-03-09 01:37:05,118 INFO L226 Difference]: Without dead ends: 245 [2025-03-09 01:37:05,118 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:37:05,119 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 93 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:37:05,119 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 173 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 01:37:05,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2025-03-09 01:37:05,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 229. [2025-03-09 01:37:05,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 190 states have (on average 1.694736842105263) internal successors, (322), 228 states have internal predecessors, (322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:37:05,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 322 transitions. [2025-03-09 01:37:05,139 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 322 transitions. Word has length 9 [2025-03-09 01:37:05,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:37:05,139 INFO L471 AbstractCegarLoop]: Abstraction has 229 states and 322 transitions. [2025-03-09 01:37:05,139 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-09 01:37:05,139 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 322 transitions. [2025-03-09 01:37:05,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-09 01:37:05,139 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:37:05,139 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2025-03-09 01:37:05,146 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-09 01:37:05,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:37:05,340 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-03-09 01:37:05,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:37:05,340 INFO L85 PathProgramCache]: Analyzing trace with hash 1834995711, now seen corresponding path program 1 times [2025-03-09 01:37:05,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:37:05,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735190931] [2025-03-09 01:37:05,340 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:37:05,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:37:05,354 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-09 01:37:05,361 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-09 01:37:05,364 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:37:05,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:37:05,399 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:37:05,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:37:05,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735190931] [2025-03-09 01:37:05,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735190931] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:37:05,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [762645414] [2025-03-09 01:37:05,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:37:05,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:37:05,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:37:05,402 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:37:05,403 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-09 01:37:05,437 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-09 01:37:05,451 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-09 01:37:05,451 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:37:05,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:37:05,452 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 01:37:05,453 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:37:05,468 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:37:05,469 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:37:05,487 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:37:05,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [762645414] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:37:05,489 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:37:05,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-03-09 01:37:05,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900599541] [2025-03-09 01:37:05,489 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:37:05,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 01:37:05,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:37:05,490 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 01:37:05,491 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-09 01:37:05,491 INFO L87 Difference]: Start difference. First operand 229 states and 322 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:37:05,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:37:05,648 INFO L93 Difference]: Finished difference Result 524 states and 730 transitions. [2025-03-09 01:37:05,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 01:37:05,649 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-03-09 01:37:05,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:37:05,650 INFO L225 Difference]: With dead ends: 524 [2025-03-09 01:37:05,651 INFO L226 Difference]: Without dead ends: 521 [2025-03-09 01:37:05,651 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-09 01:37:05,651 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 230 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:37:05,652 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 346 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 01:37:05,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2025-03-09 01:37:05,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 457. [2025-03-09 01:37:05,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 457 states, 418 states have (on average 1.6889952153110048) internal successors, (706), 456 states have internal predecessors, (706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:37:05,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 706 transitions. [2025-03-09 01:37:05,672 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 706 transitions. Word has length 10 [2025-03-09 01:37:05,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:37:05,672 INFO L471 AbstractCegarLoop]: Abstraction has 457 states and 706 transitions. [2025-03-09 01:37:05,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:37:05,672 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 706 transitions. [2025-03-09 01:37:05,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-09 01:37:05,673 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:37:05,673 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2025-03-09 01:37:05,680 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-09 01:37:05,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:37:05,878 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-03-09 01:37:05,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:37:05,878 INFO L85 PathProgramCache]: Analyzing trace with hash 1859813627, now seen corresponding path program 1 times [2025-03-09 01:37:05,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:37:05,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899638121] [2025-03-09 01:37:05,878 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:37:05,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:37:05,883 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-09 01:37:05,890 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-09 01:37:05,891 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:37:05,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:37:05,952 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:37:05,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:37:05,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899638121] [2025-03-09 01:37:05,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899638121] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:37:05,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:37:05,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 01:37:05,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533347873] [2025-03-09 01:37:05,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:37:05,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:37:05,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:37:05,953 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:37:05,954 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:37:05,954 INFO L87 Difference]: Start difference. First operand 457 states and 706 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:37:06,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:37:06,076 INFO L93 Difference]: Finished difference Result 895 states and 1387 transitions. [2025-03-09 01:37:06,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:37:06,076 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-03-09 01:37:06,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:37:06,078 INFO L225 Difference]: With dead ends: 895 [2025-03-09 01:37:06,078 INFO L226 Difference]: Without dead ends: 457 [2025-03-09 01:37:06,079 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:37:06,079 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 141 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:37:06,080 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 58 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 01:37:06,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2025-03-09 01:37:06,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 457. [2025-03-09 01:37:06,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 457 states, 418 states have (on average 1.6507177033492824) internal successors, (690), 456 states have internal predecessors, (690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:37:06,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 690 transitions. [2025-03-09 01:37:06,100 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 690 transitions. Word has length 10 [2025-03-09 01:37:06,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:37:06,100 INFO L471 AbstractCegarLoop]: Abstraction has 457 states and 690 transitions. [2025-03-09 01:37:06,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:37:06,100 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 690 transitions. [2025-03-09 01:37:06,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-09 01:37:06,100 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:37:06,100 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-03-09 01:37:06,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-09 01:37:06,100 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-03-09 01:37:06,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:37:06,101 INFO L85 PathProgramCache]: Analyzing trace with hash 804264277, now seen corresponding path program 1 times [2025-03-09 01:37:06,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:37:06,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006105719] [2025-03-09 01:37:06,101 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:37:06,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:37:06,110 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-09 01:37:06,116 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-09 01:37:06,116 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:37:06,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:37:06,167 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 01:37:06,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:37:06,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006105719] [2025-03-09 01:37:06,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006105719] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:37:06,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [977517777] [2025-03-09 01:37:06,168 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:37:06,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:37:06,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:37:06,170 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:37:06,172 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-09 01:37:06,204 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-09 01:37:06,215 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-09 01:37:06,215 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:37:06,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:37:06,216 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 01:37:06,217 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:37:06,254 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 01:37:06,254 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:37:06,288 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 01:37:06,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [977517777] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:37:06,290 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:37:06,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 5, 5] total 10 [2025-03-09 01:37:06,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701858522] [2025-03-09 01:37:06,290 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:37:06,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-09 01:37:06,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:37:06,291 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-09 01:37:06,291 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-03-09 01:37:06,291 INFO L87 Difference]: Start difference. First operand 457 states and 690 transitions. Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 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-09 01:37:06,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:37:06,874 INFO L93 Difference]: Finished difference Result 903 states and 1356 transitions. [2025-03-09 01:37:06,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-09 01:37:06,875 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 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 16 [2025-03-09 01:37:06,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:37:06,877 INFO L225 Difference]: With dead ends: 903 [2025-03-09 01:37:06,877 INFO L226 Difference]: Without dead ends: 465 [2025-03-09 01:37:06,878 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=118, Invalid=262, Unknown=0, NotChecked=0, Total=380 [2025-03-09 01:37:06,878 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 1013 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 762 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1013 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 835 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 762 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-09 01:37:06,878 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1013 Valid, 102 Invalid, 835 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 762 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-09 01:37:06,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2025-03-09 01:37:06,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 450. [2025-03-09 01:37:06,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 450 states, 418 states have (on average 1.507177033492823) internal successors, (630), 449 states have internal predecessors, (630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:37:06,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 630 transitions. [2025-03-09 01:37:06,897 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 630 transitions. Word has length 16 [2025-03-09 01:37:06,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:37:06,897 INFO L471 AbstractCegarLoop]: Abstraction has 450 states and 630 transitions. [2025-03-09 01:37:06,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 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-09 01:37:06,897 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 630 transitions. [2025-03-09 01:37:06,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-09 01:37:06,897 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:37:06,897 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1] [2025-03-09 01:37:06,906 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-09 01:37:07,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:37:07,098 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-03-09 01:37:07,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:37:07,098 INFO L85 PathProgramCache]: Analyzing trace with hash 1462653355, now seen corresponding path program 2 times [2025-03-09 01:37:07,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:37:07,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595045774] [2025-03-09 01:37:07,098 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:37:07,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:37:07,108 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-03-09 01:37:07,115 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 7 of 19 statements. [2025-03-09 01:37:07,115 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 01:37:07,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:37:07,148 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-09 01:37:07,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:37:07,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595045774] [2025-03-09 01:37:07,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595045774] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:37:07,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [176715622] [2025-03-09 01:37:07,149 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:37:07,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:37:07,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:37:07,151 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:37:07,152 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-09 01:37:07,188 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-03-09 01:37:07,196 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 7 of 19 statements. [2025-03-09 01:37:07,196 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 01:37:07,196 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:37:07,196 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 01:37:07,197 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:37:07,219 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-09 01:37:07,220 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:37:07,248 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-09 01:37:07,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [176715622] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:37:07,248 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:37:07,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2025-03-09 01:37:07,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116705565] [2025-03-09 01:37:07,249 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:37:07,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 01:37:07,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:37:07,250 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 01:37:07,250 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-09 01:37:07,250 INFO L87 Difference]: Start difference. First operand 450 states and 630 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:37:07,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:37:07,367 INFO L93 Difference]: Finished difference Result 450 states and 630 transitions. [2025-03-09 01:37:07,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 01:37:07,368 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-03-09 01:37:07,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:37:07,369 INFO L225 Difference]: With dead ends: 450 [2025-03-09 01:37:07,369 INFO L226 Difference]: Without dead ends: 447 [2025-03-09 01:37:07,370 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-03-09 01:37:07,370 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 113 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:37:07,370 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 73 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 01:37:07,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2025-03-09 01:37:07,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 379. [2025-03-09 01:37:07,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 379 states, 350 states have (on average 1.48) internal successors, (518), 378 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:37:07,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 518 transitions. [2025-03-09 01:37:07,387 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 518 transitions. Word has length 19 [2025-03-09 01:37:07,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:37:07,388 INFO L471 AbstractCegarLoop]: Abstraction has 379 states and 518 transitions. [2025-03-09 01:37:07,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:37:07,388 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 518 transitions. [2025-03-09 01:37:07,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-09 01:37:07,388 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:37:07,389 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:37:07,395 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-09 01:37:07,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:37:07,593 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-03-09 01:37:07,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:37:07,593 INFO L85 PathProgramCache]: Analyzing trace with hash -1890332550, now seen corresponding path program 1 times [2025-03-09 01:37:07,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:37:07,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870615342] [2025-03-09 01:37:07,594 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:37:07,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:37:07,603 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-09 01:37:07,613 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-09 01:37:07,614 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:37:07,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:37:07,642 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-09 01:37:07,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:37:07,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870615342] [2025-03-09 01:37:07,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870615342] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:37:07,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:37:07,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:37:07,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799895430] [2025-03-09 01:37:07,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:37:07,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:37:07,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:37:07,643 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:37:07,643 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:37:07,643 INFO L87 Difference]: Start difference. First operand 379 states and 518 transitions. Second operand has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:37:07,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:37:07,714 INFO L93 Difference]: Finished difference Result 379 states and 518 transitions. [2025-03-09 01:37:07,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:37:07,715 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2025-03-09 01:37:07,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:37:07,716 INFO L225 Difference]: With dead ends: 379 [2025-03-09 01:37:07,717 INFO L226 Difference]: Without dead ends: 375 [2025-03-09 01:37:07,717 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:37:07,718 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 55 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:37:07,718 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 24 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 01:37:07,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2025-03-09 01:37:07,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 375. [2025-03-09 01:37:07,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 375 states, 350 states have (on average 1.3885714285714286) internal successors, (486), 374 states have internal predecessors, (486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:37:07,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 486 transitions. [2025-03-09 01:37:07,734 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 486 transitions. Word has length 27 [2025-03-09 01:37:07,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:37:07,735 INFO L471 AbstractCegarLoop]: Abstraction has 375 states and 486 transitions. [2025-03-09 01:37:07,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:37:07,735 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 486 transitions. [2025-03-09 01:37:07,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-09 01:37:07,736 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:37:07,736 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:37:07,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-09 01:37:07,738 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-03-09 01:37:07,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:37:07,738 INFO L85 PathProgramCache]: Analyzing trace with hash 1529233148, now seen corresponding path program 1 times [2025-03-09 01:37:07,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:37:07,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80501738] [2025-03-09 01:37:07,739 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:37:07,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:37:07,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-09 01:37:07,751 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-09 01:37:07,753 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:37:07,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:37:07,808 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-09 01:37:07,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:37:07,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80501738] [2025-03-09 01:37:07,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80501738] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:37:07,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:37:07,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:37:07,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166021281] [2025-03-09 01:37:07,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:37:07,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:37:07,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:37:07,809 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:37:07,809 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:37:07,810 INFO L87 Difference]: Start difference. First operand 375 states and 486 transitions. Second operand has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:37:07,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:37:07,918 INFO L93 Difference]: Finished difference Result 664 states and 889 transitions. [2025-03-09 01:37:07,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:37:07,918 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-03-09 01:37:07,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:37:07,920 INFO L225 Difference]: With dead ends: 664 [2025-03-09 01:37:07,921 INFO L226 Difference]: Without dead ends: 656 [2025-03-09 01:37:07,921 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:37:07,922 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 161 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:37:07,922 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 43 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 01:37:07,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2025-03-09 01:37:07,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 653. [2025-03-09 01:37:07,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 653 states, 628 states have (on average 1.35828025477707) internal successors, (853), 652 states have internal predecessors, (853), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:37:07,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 653 states to 653 states and 853 transitions. [2025-03-09 01:37:07,939 INFO L78 Accepts]: Start accepts. Automaton has 653 states and 853 transitions. Word has length 28 [2025-03-09 01:37:07,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:37:07,941 INFO L471 AbstractCegarLoop]: Abstraction has 653 states and 853 transitions. [2025-03-09 01:37:07,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:37:07,941 INFO L276 IsEmpty]: Start isEmpty. Operand 653 states and 853 transitions. [2025-03-09 01:37:07,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-03-09 01:37:07,943 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:37:07,943 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:37:07,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-09 01:37:07,943 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-03-09 01:37:07,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:37:07,944 INFO L85 PathProgramCache]: Analyzing trace with hash -808532488, now seen corresponding path program 1 times [2025-03-09 01:37:07,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:37:07,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454711755] [2025-03-09 01:37:07,944 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:37:07,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:37:07,953 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-09 01:37:07,960 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-09 01:37:07,960 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:37:07,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:37:08,014 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-09 01:37:08,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:37:08,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454711755] [2025-03-09 01:37:08,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454711755] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:37:08,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:37:08,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:37:08,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501049075] [2025-03-09 01:37:08,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:37:08,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:37:08,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:37:08,016 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:37:08,016 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:37:08,016 INFO L87 Difference]: Start difference. First operand 653 states and 853 transitions. Second operand has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 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-09 01:37:08,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:37:08,135 INFO L93 Difference]: Finished difference Result 657 states and 853 transitions. [2025-03-09 01:37:08,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:37:08,136 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 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) Word has length 32 [2025-03-09 01:37:08,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:37:08,138 INFO L225 Difference]: With dead ends: 657 [2025-03-09 01:37:08,138 INFO L226 Difference]: Without dead ends: 653 [2025-03-09 01:37:08,139 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:37:08,139 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 95 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:37:08,139 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 47 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 01:37:08,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2025-03-09 01:37:08,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 653. [2025-03-09 01:37:08,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 653 states, 628 states have (on average 1.3073248407643312) internal successors, (821), 652 states have internal predecessors, (821), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:37:08,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 653 states to 653 states and 821 transitions. [2025-03-09 01:37:08,157 INFO L78 Accepts]: Start accepts. Automaton has 653 states and 821 transitions. Word has length 32 [2025-03-09 01:37:08,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:37:08,158 INFO L471 AbstractCegarLoop]: Abstraction has 653 states and 821 transitions. [2025-03-09 01:37:08,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 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-09 01:37:08,158 INFO L276 IsEmpty]: Start isEmpty. Operand 653 states and 821 transitions. [2025-03-09 01:37:08,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-09 01:37:08,158 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:37:08,158 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 2, 2, 2, 1, 1, 1, 1, 1] [2025-03-09 01:37:08,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-09 01:37:08,159 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-03-09 01:37:08,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:37:08,159 INFO L85 PathProgramCache]: Analyzing trace with hash -1799853783, now seen corresponding path program 1 times [2025-03-09 01:37:08,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:37:08,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203482575] [2025-03-09 01:37:08,159 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:37:08,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:37:08,166 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-09 01:37:08,171 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-09 01:37:08,171 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:37:08,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:37:08,213 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2025-03-09 01:37:08,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:37:08,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203482575] [2025-03-09 01:37:08,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203482575] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:37:08,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [612042417] [2025-03-09 01:37:08,213 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:37:08,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:37:08,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:37:08,215 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:37:08,217 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-09 01:37:08,253 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-09 01:37:08,268 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-09 01:37:08,269 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:37:08,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:37:08,270 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-09 01:37:08,271 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:37:08,345 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 58 proven. 22 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-09 01:37:08,345 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:37:08,415 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 58 proven. 22 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-09 01:37:08,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [612042417] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:37:08,415 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:37:08,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 8, 8] total 16 [2025-03-09 01:37:08,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031110834] [2025-03-09 01:37:08,415 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:37:08,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-09 01:37:08,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:37:08,416 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-09 01:37:08,416 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2025-03-09 01:37:08,416 INFO L87 Difference]: Start difference. First operand 653 states and 821 transitions. Second operand has 16 states, 16 states have (on average 3.5625) internal successors, (57), 16 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:37:09,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:37:09,431 INFO L93 Difference]: Finished difference Result 2869 states and 3834 transitions. [2025-03-09 01:37:09,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2025-03-09 01:37:09,432 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.5625) internal successors, (57), 16 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2025-03-09 01:37:09,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:37:09,438 INFO L225 Difference]: With dead ends: 2869 [2025-03-09 01:37:09,439 INFO L226 Difference]: Without dead ends: 2233 [2025-03-09 01:37:09,440 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 468 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=643, Invalid=1163, Unknown=0, NotChecked=0, Total=1806 [2025-03-09 01:37:09,441 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 4298 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 609 mSolverCounterSat, 217 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4298 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 826 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 217 IncrementalHoareTripleChecker+Valid, 609 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-09 01:37:09,441 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4298 Valid, 117 Invalid, 826 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [217 Valid, 609 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-09 01:37:09,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2233 states. [2025-03-09 01:37:09,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2233 to 2217. [2025-03-09 01:37:09,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2217 states, 2192 states have (on average 1.291514598540146) internal successors, (2831), 2216 states have internal predecessors, (2831), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:37:09,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2217 states to 2217 states and 2831 transitions. [2025-03-09 01:37:09,525 INFO L78 Accepts]: Start accepts. Automaton has 2217 states and 2831 transitions. Word has length 35 [2025-03-09 01:37:09,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:37:09,525 INFO L471 AbstractCegarLoop]: Abstraction has 2217 states and 2831 transitions. [2025-03-09 01:37:09,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.5625) internal successors, (57), 16 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:37:09,526 INFO L276 IsEmpty]: Start isEmpty. Operand 2217 states and 2831 transitions. [2025-03-09 01:37:09,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-09 01:37:09,527 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:37:09,527 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:37:09,536 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-09 01:37:09,728 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,SelfDestructingSolverStorable11 [2025-03-09 01:37:09,728 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-03-09 01:37:09,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:37:09,729 INFO L85 PathProgramCache]: Analyzing trace with hash -302929257, now seen corresponding path program 1 times [2025-03-09 01:37:09,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:37:09,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419546589] [2025-03-09 01:37:09,729 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:37:09,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:37:09,746 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-09 01:37:09,760 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-09 01:37:09,760 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:37:09,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:37:09,854 INFO L134 CoverageAnalysis]: Checked inductivity of 617 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 617 trivial. 0 not checked. [2025-03-09 01:37:09,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:37:09,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419546589] [2025-03-09 01:37:09,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419546589] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:37:09,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:37:09,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:37:09,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268577513] [2025-03-09 01:37:09,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:37:09,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:37:09,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:37:09,856 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:37:09,856 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:37:09,856 INFO L87 Difference]: Start difference. First operand 2217 states and 2831 transitions. Second operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:37:09,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:37:09,969 INFO L93 Difference]: Finished difference Result 2221 states and 2831 transitions. [2025-03-09 01:37:09,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:37:09,970 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 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 88 [2025-03-09 01:37:09,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:37:09,976 INFO L225 Difference]: With dead ends: 2221 [2025-03-09 01:37:09,976 INFO L226 Difference]: Without dead ends: 2217 [2025-03-09 01:37:09,977 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:37:09,977 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 100 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:37:09,977 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 49 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 01:37:09,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2217 states. [2025-03-09 01:37:10,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2217 to 2217. [2025-03-09 01:37:10,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2217 states, 2192 states have (on average 1.2805656934306568) internal successors, (2807), 2216 states have internal predecessors, (2807), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:37:10,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2217 states to 2217 states and 2807 transitions. [2025-03-09 01:37:10,033 INFO L78 Accepts]: Start accepts. Automaton has 2217 states and 2807 transitions. Word has length 88 [2025-03-09 01:37:10,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:37:10,033 INFO L471 AbstractCegarLoop]: Abstraction has 2217 states and 2807 transitions. [2025-03-09 01:37:10,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:37:10,033 INFO L276 IsEmpty]: Start isEmpty. Operand 2217 states and 2807 transitions. [2025-03-09 01:37:10,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-09 01:37:10,034 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:37:10,034 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:37:10,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-09 01:37:10,034 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-03-09 01:37:10,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:37:10,035 INFO L85 PathProgramCache]: Analyzing trace with hash -883183427, now seen corresponding path program 1 times [2025-03-09 01:37:10,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:37:10,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782226344] [2025-03-09 01:37:10,035 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:37:10,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:37:10,047 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-09 01:37:10,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-09 01:37:10,065 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:37:10,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:37:10,337 INFO L134 CoverageAnalysis]: Checked inductivity of 628 backedges. 324 proven. 145 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2025-03-09 01:37:10,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:37:10,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782226344] [2025-03-09 01:37:10,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782226344] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:37:10,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1087553160] [2025-03-09 01:37:10,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:37:10,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:37:10,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:37:10,340 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:37:10,340 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-09 01:37:10,396 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-09 01:37:10,426 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-09 01:37:10,426 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:37:10,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:37:10,430 INFO L256 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-09 01:37:10,431 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:37:10,624 INFO L134 CoverageAnalysis]: Checked inductivity of 628 backedges. 324 proven. 145 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2025-03-09 01:37:10,625 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:37:10,831 INFO L134 CoverageAnalysis]: Checked inductivity of 628 backedges. 324 proven. 145 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2025-03-09 01:37:10,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1087553160] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:37:10,831 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:37:10,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 37 [2025-03-09 01:37:10,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678040534] [2025-03-09 01:37:10,832 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:37:10,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-03-09 01:37:10,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:37:10,833 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-03-09 01:37:10,833 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=579, Invalid=753, Unknown=0, NotChecked=0, Total=1332 [2025-03-09 01:37:10,833 INFO L87 Difference]: Start difference. First operand 2217 states and 2807 transitions. Second operand has 37 states, 37 states have (on average 3.5135135135135136) internal successors, (130), 37 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:37:12,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:37:12,002 INFO L93 Difference]: Finished difference Result 6919 states and 9034 transitions. [2025-03-09 01:37:12,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-09 01:37:12,003 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 3.5135135135135136) internal successors, (130), 37 states have internal predecessors, (130), 0 states have call successors, (0), 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 103 [2025-03-09 01:37:12,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:37:12,016 INFO L225 Difference]: With dead ends: 6919 [2025-03-09 01:37:12,017 INFO L226 Difference]: Without dead ends: 4737 [2025-03-09 01:37:12,020 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 745 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=876, Invalid=1380, Unknown=0, NotChecked=0, Total=2256 [2025-03-09 01:37:12,021 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 2514 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 1190 mSolverCounterSat, 152 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2514 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 1342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 152 IncrementalHoareTripleChecker+Valid, 1190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-09 01:37:12,021 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2514 Valid, 215 Invalid, 1342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [152 Valid, 1190 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-09 01:37:12,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4737 states. [2025-03-09 01:37:12,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4737 to 4737. [2025-03-09 01:37:12,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4737 states, 4712 states have (on average 1.2833191850594228) internal successors, (6047), 4736 states have internal predecessors, (6047), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:37:12,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4737 states to 4737 states and 6047 transitions. [2025-03-09 01:37:12,111 INFO L78 Accepts]: Start accepts. Automaton has 4737 states and 6047 transitions. Word has length 103 [2025-03-09 01:37:12,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:37:12,112 INFO L471 AbstractCegarLoop]: Abstraction has 4737 states and 6047 transitions. [2025-03-09 01:37:12,112 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 3.5135135135135136) internal successors, (130), 37 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:37:12,112 INFO L276 IsEmpty]: Start isEmpty. Operand 4737 states and 6047 transitions. [2025-03-09 01:37:12,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-03-09 01:37:12,115 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:37:12,115 INFO L218 NwaCegarLoop]: trace histogram [44, 44, 44, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:37:12,122 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-09 01:37:12,318 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-09 01:37:12,318 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-03-09 01:37:12,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:37:12,319 INFO L85 PathProgramCache]: Analyzing trace with hash 1914581053, now seen corresponding path program 2 times [2025-03-09 01:37:12,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:37:12,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582618781] [2025-03-09 01:37:12,319 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:37:12,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:37:12,351 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 175 statements into 2 equivalence classes. [2025-03-09 01:37:12,376 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 175 of 175 statements. [2025-03-09 01:37:12,376 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:37:12,377 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:37:12,525 INFO L134 CoverageAnalysis]: Checked inductivity of 2944 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2943 trivial. 0 not checked. [2025-03-09 01:37:12,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:37:12,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582618781] [2025-03-09 01:37:12,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582618781] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:37:12,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [404307977] [2025-03-09 01:37:12,526 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:37:12,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:37:12,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:37:12,528 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:37:12,529 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-09 01:37:12,598 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 175 statements into 2 equivalence classes. [2025-03-09 01:37:12,653 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 175 of 175 statements. [2025-03-09 01:37:12,654 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:37:12,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:37:12,656 INFO L256 TraceCheckSpWp]: Trace formula consists of 608 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-09 01:37:12,659 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:37:13,148 INFO L134 CoverageAnalysis]: Checked inductivity of 2944 backedges. 1500 proven. 715 refuted. 0 times theorem prover too weak. 729 trivial. 0 not checked. [2025-03-09 01:37:13,148 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:37:13,638 INFO L134 CoverageAnalysis]: Checked inductivity of 2944 backedges. 1500 proven. 715 refuted. 0 times theorem prover too weak. 729 trivial. 0 not checked. [2025-03-09 01:37:13,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [404307977] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:37:13,638 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:37:13,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 26, 26] total 52 [2025-03-09 01:37:13,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364457345] [2025-03-09 01:37:13,639 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:37:13,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2025-03-09 01:37:13,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:37:13,640 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2025-03-09 01:37:13,640 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1186, Invalid=1466, Unknown=0, NotChecked=0, Total=2652 [2025-03-09 01:37:13,640 INFO L87 Difference]: Start difference. First operand 4737 states and 6047 transitions. Second operand has 52 states, 52 states have (on average 3.519230769230769) internal successors, (183), 52 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:37:21,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:37:21,316 INFO L93 Difference]: Finished difference Result 19324 states and 25692 transitions. [2025-03-09 01:37:21,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 143 states. [2025-03-09 01:37:21,316 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 3.519230769230769) internal successors, (183), 52 states have internal predecessors, (183), 0 states have call successors, (0), 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 175 [2025-03-09 01:37:21,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:37:21,351 INFO L225 Difference]: With dead ends: 19324 [2025-03-09 01:37:21,351 INFO L226 Difference]: Without dead ends: 14658 [2025-03-09 01:37:21,363 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 468 GetRequests, 302 SyntacticMatches, 0 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9132 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=9863, Invalid=18193, Unknown=0, NotChecked=0, Total=28056 [2025-03-09 01:37:21,364 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 24765 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 1863 mSolverCounterSat, 1142 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24765 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 3005 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1142 IncrementalHoareTripleChecker+Valid, 1863 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-09 01:37:21,364 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24765 Valid, 167 Invalid, 3005 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1142 Valid, 1863 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-09 01:37:21,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14658 states. [2025-03-09 01:37:21,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14658 to 9779. [2025-03-09 01:37:21,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9779 states, 9754 states have (on average 1.2843961451712118) internal successors, (12528), 9778 states have internal predecessors, (12528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:37:21,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9779 states to 9779 states and 12528 transitions. [2025-03-09 01:37:21,619 INFO L78 Accepts]: Start accepts. Automaton has 9779 states and 12528 transitions. Word has length 175 [2025-03-09 01:37:21,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:37:21,619 INFO L471 AbstractCegarLoop]: Abstraction has 9779 states and 12528 transitions. [2025-03-09 01:37:21,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 3.519230769230769) internal successors, (183), 52 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:37:21,619 INFO L276 IsEmpty]: Start isEmpty. Operand 9779 states and 12528 transitions. [2025-03-09 01:37:21,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 430 [2025-03-09 01:37:21,622 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:37:21,623 INFO L218 NwaCegarLoop]: trace histogram [138, 138, 138, 3, 3, 3, 2, 1, 1, 1, 1] [2025-03-09 01:37:21,630 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-09 01:37:21,823 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-09 01:37:21,824 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-03-09 01:37:21,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:37:21,824 INFO L85 PathProgramCache]: Analyzing trace with hash 561509798, now seen corresponding path program 2 times [2025-03-09 01:37:21,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:37:21,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495010153] [2025-03-09 01:37:21,824 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:37:21,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:37:21,877 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 429 statements into 2 equivalence classes. [2025-03-09 01:37:21,879 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 7 of 429 statements. [2025-03-09 01:37:21,880 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 01:37:21,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:37:21,904 INFO L134 CoverageAnalysis]: Checked inductivity of 28785 backedges. 0 proven. 12886 refuted. 0 times theorem prover too weak. 15899 trivial. 0 not checked. [2025-03-09 01:37:21,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:37:21,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495010153] [2025-03-09 01:37:21,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495010153] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:37:21,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1851944685] [2025-03-09 01:37:21,906 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:37:21,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:37:21,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:37:21,908 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:37:21,909 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-09 01:37:22,053 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 429 statements into 2 equivalence classes. [2025-03-09 01:37:22,060 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 7 of 429 statements. [2025-03-09 01:37:22,060 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 01:37:22,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:37:22,061 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 01:37:22,069 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:37:22,453 INFO L134 CoverageAnalysis]: Checked inductivity of 28785 backedges. 0 proven. 12886 refuted. 0 times theorem prover too weak. 15899 trivial. 0 not checked. [2025-03-09 01:37:22,453 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:37:22,760 INFO L134 CoverageAnalysis]: Checked inductivity of 28785 backedges. 0 proven. 12886 refuted. 0 times theorem prover too weak. 15899 trivial. 0 not checked. [2025-03-09 01:37:22,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1851944685] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:37:22,761 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:37:22,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2025-03-09 01:37:22,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524850729] [2025-03-09 01:37:22,761 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:37:22,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 01:37:22,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:37:22,762 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 01:37:22,762 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-09 01:37:22,762 INFO L87 Difference]: Start difference. First operand 9779 states and 12528 transitions. Second operand has 6 states, 5 states have (on average 6.6) internal successors, (33), 6 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:37:22,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:37:22,911 INFO L93 Difference]: Finished difference Result 9779 states and 12528 transitions. [2025-03-09 01:37:22,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 01:37:22,911 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.6) internal successors, (33), 6 states have internal predecessors, (33), 0 states have call successors, (0), 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 429 [2025-03-09 01:37:22,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:37:22,927 INFO L225 Difference]: With dead ends: 9779 [2025-03-09 01:37:22,927 INFO L226 Difference]: Without dead ends: 9776 [2025-03-09 01:37:22,929 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 861 GetRequests, 855 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-03-09 01:37:22,930 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 216 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:37:22,930 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 37 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 01:37:22,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9776 states. [2025-03-09 01:37:23,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9776 to 9486. [2025-03-09 01:37:23,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9486 states, 9464 states have (on average 1.2922654268808116) internal successors, (12230), 9485 states have internal predecessors, (12230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:37:23,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9486 states to 9486 states and 12230 transitions. [2025-03-09 01:37:23,122 INFO L78 Accepts]: Start accepts. Automaton has 9486 states and 12230 transitions. Word has length 429 [2025-03-09 01:37:23,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:37:23,123 INFO L471 AbstractCegarLoop]: Abstraction has 9486 states and 12230 transitions. [2025-03-09 01:37:23,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.6) internal successors, (33), 6 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:37:23,123 INFO L276 IsEmpty]: Start isEmpty. Operand 9486 states and 12230 transitions. [2025-03-09 01:37:23,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 578 [2025-03-09 01:37:23,133 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:37:23,133 INFO L218 NwaCegarLoop]: trace histogram [184, 184, 184, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1] [2025-03-09 01:37:23,139 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-09 01:37:23,338 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-09 01:37:23,338 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-03-09 01:37:23,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:37:23,339 INFO L85 PathProgramCache]: Analyzing trace with hash 1388050329, now seen corresponding path program 1 times [2025-03-09 01:37:23,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:37:23,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23624267] [2025-03-09 01:37:23,339 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:37:23,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:37:23,426 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 577 statements into 1 equivalence classes. [2025-03-09 01:37:23,501 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 577 of 577 statements. [2025-03-09 01:37:23,502 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:37:23,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:37:24,003 INFO L134 CoverageAnalysis]: Checked inductivity of 51279 backedges. 0 proven. 25783 refuted. 0 times theorem prover too weak. 25496 trivial. 0 not checked. [2025-03-09 01:37:24,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:37:24,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23624267] [2025-03-09 01:37:24,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23624267] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:37:24,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [988296115] [2025-03-09 01:37:24,003 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:37:24,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:37:24,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:37:24,006 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:37:24,007 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-09 01:37:24,199 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 577 statements into 1 equivalence classes. [2025-03-09 01:37:24,377 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 577 of 577 statements. [2025-03-09 01:37:24,377 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:37:24,377 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:37:24,383 INFO L256 TraceCheckSpWp]: Trace formula consists of 2124 conjuncts, 49 conjuncts are in the unsatisfiable core [2025-03-09 01:37:24,389 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:37:25,468 INFO L134 CoverageAnalysis]: Checked inductivity of 51279 backedges. 19329 proven. 3151 refuted. 0 times theorem prover too weak. 28799 trivial. 0 not checked. [2025-03-09 01:37:25,468 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:37:27,065 INFO L134 CoverageAnalysis]: Checked inductivity of 51279 backedges. 19329 proven. 3151 refuted. 0 times theorem prover too weak. 28799 trivial. 0 not checked. [2025-03-09 01:37:27,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [988296115] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:37:27,065 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:37:27,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 50, 50] total 100 [2025-03-09 01:37:27,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369354727] [2025-03-09 01:37:27,065 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:37:27,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 100 states [2025-03-09 01:37:27,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:37:27,067 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2025-03-09 01:37:27,069 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=4663, Invalid=5237, Unknown=0, NotChecked=0, Total=9900 [2025-03-09 01:37:27,069 INFO L87 Difference]: Start difference. First operand 9486 states and 12230 transitions. Second operand has 100 states, 100 states have (on average 3.19) internal successors, (319), 100 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:37:53,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:37:53,097 INFO L93 Difference]: Finished difference Result 28630 states and 37756 transitions. [2025-03-09 01:37:53,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 195 states. [2025-03-09 01:37:53,099 INFO L78 Accepts]: Start accepts. Automaton has has 100 states, 100 states have (on average 3.19) internal successors, (319), 100 states have internal predecessors, (319), 0 states have call successors, (0), 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 577 [2025-03-09 01:37:53,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:37:53,129 INFO L225 Difference]: With dead ends: 28630 [2025-03-09 01:37:53,129 INFO L226 Difference]: Without dead ends: 19287 [2025-03-09 01:37:53,140 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1345 GetRequests, 1057 SyntacticMatches, 0 SemanticMatches, 288 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22278 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=23473, Invalid=60337, Unknown=0, NotChecked=0, Total=83810 [2025-03-09 01:37:53,141 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 36288 mSDsluCounter, 431 mSDsCounter, 0 mSdLazyCounter, 6670 mSolverCounterSat, 1817 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36288 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 8487 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1817 IncrementalHoareTripleChecker+Valid, 6670 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2025-03-09 01:37:53,141 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36288 Valid, 449 Invalid, 8487 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1817 Valid, 6670 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2025-03-09 01:37:53,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19287 states. [2025-03-09 01:37:53,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19287 to 19275. [2025-03-09 01:37:53,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19275 states, 19256 states have (on average 1.2930515164104694) internal successors, (24899), 19274 states have internal predecessors, (24899), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:37:53,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19275 states to 19275 states and 24899 transitions. [2025-03-09 01:37:53,452 INFO L78 Accepts]: Start accepts. Automaton has 19275 states and 24899 transitions. Word has length 577 [2025-03-09 01:37:53,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:37:53,453 INFO L471 AbstractCegarLoop]: Abstraction has 19275 states and 24899 transitions. [2025-03-09 01:37:53,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 100 states, 100 states have (on average 3.19) internal successors, (319), 100 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:37:53,454 INFO L276 IsEmpty]: Start isEmpty. Operand 19275 states and 24899 transitions. [2025-03-09 01:37:53,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1155 [2025-03-09 01:37:53,471 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:37:53,471 INFO L218 NwaCegarLoop]: trace histogram [376, 376, 376, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1] [2025-03-09 01:37:53,480 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-09 01:37:53,671 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-09 01:37:53,672 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-03-09 01:37:53,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:37:53,672 INFO L85 PathProgramCache]: Analyzing trace with hash -1812638777, now seen corresponding path program 1 times [2025-03-09 01:37:53,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:37:53,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883090942] [2025-03-09 01:37:53,672 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:37:53,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:37:53,784 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1154 statements into 1 equivalence classes. [2025-03-09 01:37:53,890 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1154 of 1154 statements. [2025-03-09 01:37:53,890 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:37:53,890 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:37:55,015 INFO L134 CoverageAnalysis]: Checked inductivity of 213040 backedges. 0 proven. 106808 refuted. 0 times theorem prover too weak. 106232 trivial. 0 not checked. [2025-03-09 01:37:55,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:37:55,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883090942] [2025-03-09 01:37:55,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883090942] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:37:55,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1813965551] [2025-03-09 01:37:55,016 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:37:55,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:37:55,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:37:55,018 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:37:55,019 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-09 01:37:55,369 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1154 statements into 1 equivalence classes. [2025-03-09 01:37:55,721 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1154 of 1154 statements. [2025-03-09 01:37:55,721 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:37:55,721 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:37:55,736 INFO L256 TraceCheckSpWp]: Trace formula consists of 4237 conjuncts, 97 conjuncts are in the unsatisfiable core [2025-03-09 01:37:55,747 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:37:59,205 INFO L134 CoverageAnalysis]: Checked inductivity of 213040 backedges. 80097 proven. 13207 refuted. 0 times theorem prover too weak. 119736 trivial. 0 not checked. [2025-03-09 01:37:59,206 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:38:05,022 INFO L134 CoverageAnalysis]: Checked inductivity of 213040 backedges. 80097 proven. 13207 refuted. 0 times theorem prover too weak. 119736 trivial. 0 not checked. [2025-03-09 01:38:05,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1813965551] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:38:05,023 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:38:05,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 98, 98] total 196 [2025-03-09 01:38:05,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6726930] [2025-03-09 01:38:05,023 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:38:05,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 196 states [2025-03-09 01:38:05,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:38:05,028 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 196 interpolants. [2025-03-09 01:38:05,030 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18536, Invalid=19684, Unknown=0, NotChecked=0, Total=38220 [2025-03-09 01:38:05,030 INFO L87 Difference]: Start difference. First operand 19275 states and 24899 transitions. Second operand has 196 states, 196 states have (on average 3.1020408163265305) internal successors, (608), 196 states have internal predecessors, (608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)