./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/busybox-1.22.0/mkfifo-incomplete-2.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/busybox-1.22.0/mkfifo-incomplete-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 87580337320826adb4ecd48067cecb4358be7d27e3644fa74cf18e815c89b60b --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 18:55:59,596 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 18:55:59,649 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-03-17 18:55:59,652 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 18:55:59,653 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 18:55:59,669 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 18:55:59,669 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 18:55:59,670 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 18:55:59,670 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 18:55:59,670 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 18:55:59,670 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 18:55:59,670 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 18:55:59,671 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 18:55:59,671 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 18:55:59,671 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 18:55:59,671 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 18:55:59,671 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 18:55:59,671 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 18:55:59,671 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 18:55:59,671 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 18:55:59,672 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 18:55:59,672 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 18:55:59,672 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-17 18:55:59,672 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 18:55:59,672 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 18:55:59,672 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 18:55:59,672 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 18:55:59,672 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 18:55:59,672 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 18:55:59,672 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 18:55:59,673 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 18:55:59,673 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 18:55:59,673 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 18:55:59,673 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 18:55:59,673 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 18:55:59,673 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 18:55:59,673 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 18:55:59,673 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 18:55:59,673 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 18:55:59,673 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 18:55:59,673 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 18:55:59,673 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 18:55:59,673 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 87580337320826adb4ecd48067cecb4358be7d27e3644fa74cf18e815c89b60b [2025-03-17 18:55:59,935 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 18:55:59,943 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 18:55:59,944 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 18:55:59,945 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 18:55:59,945 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 18:55:59,946 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/busybox-1.22.0/mkfifo-incomplete-2.i [2025-03-17 18:56:01,089 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38cc877a1/94f55ad403ba41978e633abab8d6a44f/FLAG77ff7a3c1 [2025-03-17 18:56:01,460 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 18:56:01,461 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/mkfifo-incomplete-2.i [2025-03-17 18:56:01,486 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38cc877a1/94f55ad403ba41978e633abab8d6a44f/FLAG77ff7a3c1 [2025-03-17 18:56:01,666 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38cc877a1/94f55ad403ba41978e633abab8d6a44f [2025-03-17 18:56:01,668 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 18:56:01,669 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 18:56:01,671 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 18:56:01,671 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 18:56:01,674 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 18:56:01,675 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 06:56:01" (1/1) ... [2025-03-17 18:56:01,676 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3eb12a8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:56:01, skipping insertion in model container [2025-03-17 18:56:01,676 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 06:56:01" (1/1) ... [2025-03-17 18:56:01,718 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 18:56:02,456 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 18:56:02,480 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 18:56:02,554 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 18:56:02,647 WARN L1212 FunctionHandler]: The following functions are not defined or handled internally: vasprintf [2025-03-17 18:56:02,652 INFO L204 MainTranslator]: Completed translation [2025-03-17 18:56:02,653 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:56:02 WrapperNode [2025-03-17 18:56:02,653 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 18:56:02,654 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 18:56:02,654 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 18:56:02,654 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 18:56:02,658 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:56:02" (1/1) ... [2025-03-17 18:56:02,693 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:56:02" (1/1) ... [2025-03-17 18:56:02,743 INFO L138 Inliner]: procedures = 574, calls = 489, calls flagged for inlining = 16, calls inlined = 15, statements flattened = 790 [2025-03-17 18:56:02,744 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 18:56:02,744 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 18:56:02,744 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 18:56:02,744 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 18:56:02,752 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:56:02" (1/1) ... [2025-03-17 18:56:02,752 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:56:02" (1/1) ... [2025-03-17 18:56:02,764 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:56:02" (1/1) ... [2025-03-17 18:56:02,777 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-03-17 18:56:02,778 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:56:02" (1/1) ... [2025-03-17 18:56:02,778 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:56:02" (1/1) ... [2025-03-17 18:56:02,801 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:56:02" (1/1) ... [2025-03-17 18:56:02,806 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:56:02" (1/1) ... [2025-03-17 18:56:02,811 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:56:02" (1/1) ... [2025-03-17 18:56:02,815 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:56:02" (1/1) ... [2025-03-17 18:56:02,822 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 18:56:02,823 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 18:56:02,823 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 18:56:02,823 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 18:56:02,824 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:56:02" (1/1) ... [2025-03-17 18:56:02,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 18:56:02,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 18:56:02,860 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 18:56:02,862 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 18:56:02,880 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-17 18:56:02,880 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2025-03-17 18:56:02,881 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-03-17 18:56:02,881 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-17 18:56:02,881 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-17 18:56:02,881 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 18:56:02,881 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-03-17 18:56:02,881 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 18:56:02,881 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 18:56:02,881 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy [2025-03-17 18:56:02,881 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy [2025-03-17 18:56:02,881 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2025-03-17 18:56:02,882 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2025-03-17 18:56:02,882 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 18:56:02,882 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 18:56:02,882 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-17 18:56:02,882 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-03-17 18:56:02,882 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-17 18:56:02,882 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-17 18:56:03,116 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 18:56:03,117 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 18:56:03,622 INFO L? ?]: Removed 216 outVars from TransFormulas that were not future-live. [2025-03-17 18:56:03,623 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 18:56:03,639 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 18:56:03,640 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 18:56:03,640 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 06:56:03 BoogieIcfgContainer [2025-03-17 18:56:03,641 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 18:56:03,643 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 18:56:03,643 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 18:56:03,648 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 18:56:03,648 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 06:56:01" (1/3) ... [2025-03-17 18:56:03,648 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a6b3933 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 06:56:03, skipping insertion in model container [2025-03-17 18:56:03,649 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:56:02" (2/3) ... [2025-03-17 18:56:03,649 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a6b3933 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 06:56:03, skipping insertion in model container [2025-03-17 18:56:03,649 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 06:56:03" (3/3) ... [2025-03-17 18:56:03,650 INFO L128 eAbstractionObserver]: Analyzing ICFG mkfifo-incomplete-2.i [2025-03-17 18:56:03,659 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 18:56:03,661 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG mkfifo-incomplete-2.i that has 3 procedures, 153 locations, 1 initial locations, 12 loop locations, and 40 error locations. [2025-03-17 18:56:03,707 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 18:56:03,714 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;@c99763, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 18:56:03,715 INFO L334 AbstractCegarLoop]: Starting to check reachability of 40 error locations. [2025-03-17 18:56:03,717 INFO L276 IsEmpty]: Start isEmpty. Operand has 153 states, 103 states have (on average 1.7378640776699028) internal successors, (179), 143 states have internal predecessors, (179), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-17 18:56:03,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-03-17 18:56:03,721 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 18:56:03,721 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-03-17 18:56:03,721 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 37 more)] === [2025-03-17 18:56:03,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 18:56:03,725 INFO L85 PathProgramCache]: Analyzing trace with hash 231337, now seen corresponding path program 1 times [2025-03-17 18:56:03,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 18:56:03,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841375848] [2025-03-17 18:56:03,730 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 18:56:03,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 18:56:03,868 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 18:56:03,947 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 18:56:03,948 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 18:56:03,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 18:56:04,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 18:56:04,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 18:56:04,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841375848] [2025-03-17 18:56:04,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841375848] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 18:56:04,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 18:56:04,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 18:56:04,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553497434] [2025-03-17 18:56:04,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 18:56:04,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 18:56:04,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 18:56:04,215 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 18:56:04,216 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 18:56:04,218 INFO L87 Difference]: Start difference. First operand has 153 states, 103 states have (on average 1.7378640776699028) internal successors, (179), 143 states have internal predecessors, (179), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 18:56:04,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 18:56:04,261 INFO L93 Difference]: Finished difference Result 211 states and 270 transitions. [2025-03-17 18:56:04,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 18:56:04,263 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2025-03-17 18:56:04,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 18:56:04,268 INFO L225 Difference]: With dead ends: 211 [2025-03-17 18:56:04,268 INFO L226 Difference]: Without dead ends: 60 [2025-03-17 18:56:04,270 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 18:56:04,272 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 1 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 18:56:04,272 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 131 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 18:56:04,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2025-03-17 18:56:04,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2025-03-17 18:56:04,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 43 states have (on average 1.5348837209302326) internal successors, (66), 55 states have internal predecessors, (66), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 18:56:04,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 72 transitions. [2025-03-17 18:56:04,295 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 72 transitions. Word has length 3 [2025-03-17 18:56:04,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 18:56:04,296 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 72 transitions. [2025-03-17 18:56:04,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 18:56:04,296 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 72 transitions. [2025-03-17 18:56:04,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-17 18:56:04,296 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 18:56:04,296 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2025-03-17 18:56:04,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 18:56:04,297 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 37 more)] === [2025-03-17 18:56:04,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 18:56:04,297 INFO L85 PathProgramCache]: Analyzing trace with hash -1698007075, now seen corresponding path program 1 times [2025-03-17 18:56:04,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 18:56:04,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679684254] [2025-03-17 18:56:04,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 18:56:04,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 18:56:04,332 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 18:56:04,348 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 18:56:04,348 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 18:56:04,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 18:56:04,472 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 18:56:04,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 18:56:04,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679684254] [2025-03-17 18:56:04,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679684254] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 18:56:04,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2001565181] [2025-03-17 18:56:04,473 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 18:56:04,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 18:56:04,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 18:56:04,476 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 18:56:04,478 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 18:56:04,589 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 18:56:04,683 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 18:56:04,683 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 18:56:04,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 18:56:04,687 INFO L256 TraceCheckSpWp]: Trace formula consists of 854 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 18:56:04,689 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 18:56:04,707 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-17 18:56:04,707 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 18:56:04,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2001565181] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 18:56:04,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 18:56:04,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 3 [2025-03-17 18:56:04,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924228934] [2025-03-17 18:56:04,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 18:56:04,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 18:56:04,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 18:56:04,709 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 18:56:04,709 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 18:56:04,709 INFO L87 Difference]: Start difference. First operand 60 states and 72 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 18:56:04,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 18:56:04,741 INFO L93 Difference]: Finished difference Result 60 states and 72 transitions. [2025-03-17 18:56:04,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 18:56:04,742 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-03-17 18:56:04,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 18:56:04,743 INFO L225 Difference]: With dead ends: 60 [2025-03-17 18:56:04,744 INFO L226 Difference]: Without dead ends: 59 [2025-03-17 18:56:04,744 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 18:56:04,745 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 1 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 18:56:04,745 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 125 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 18:56:04,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2025-03-17 18:56:04,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2025-03-17 18:56:04,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 43 states have (on average 1.5116279069767442) internal successors, (65), 54 states have internal predecessors, (65), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 18:56:04,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 71 transitions. [2025-03-17 18:56:04,751 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 71 transitions. Word has length 6 [2025-03-17 18:56:04,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 18:56:04,752 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 71 transitions. [2025-03-17 18:56:04,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 18:56:04,752 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 71 transitions. [2025-03-17 18:56:04,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-17 18:56:04,752 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 18:56:04,752 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1] [2025-03-17 18:56:04,761 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 18:56:04,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 18:56:04,957 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 37 more)] === [2025-03-17 18:56:04,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 18:56:04,957 INFO L85 PathProgramCache]: Analyzing trace with hash -1098611605, now seen corresponding path program 1 times [2025-03-17 18:56:04,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 18:56:04,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907106033] [2025-03-17 18:56:04,958 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 18:56:04,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 18:56:04,981 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 18:56:04,993 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 18:56:04,993 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 18:56:04,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 18:56:05,068 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-17 18:56:05,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 18:56:05,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907106033] [2025-03-17 18:56:05,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907106033] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 18:56:05,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 18:56:05,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 18:56:05,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006013929] [2025-03-17 18:56:05,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 18:56:05,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 18:56:05,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 18:56:05,070 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 18:56:05,070 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 18:56:05,070 INFO L87 Difference]: Start difference. First operand 59 states and 71 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 18:56:05,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 18:56:05,090 INFO L93 Difference]: Finished difference Result 59 states and 71 transitions. [2025-03-17 18:56:05,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 18:56:05,091 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-03-17 18:56:05,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 18:56:05,093 INFO L225 Difference]: With dead ends: 59 [2025-03-17 18:56:05,093 INFO L226 Difference]: Without dead ends: 58 [2025-03-17 18:56:05,094 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 18:56:05,094 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 0 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 18:56:05,095 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 126 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 18:56:05,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2025-03-17 18:56:05,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 56. [2025-03-17 18:56:05,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 41 states have (on average 1.5121951219512195) internal successors, (62), 51 states have internal predecessors, (62), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 18:56:05,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 68 transitions. [2025-03-17 18:56:05,098 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 68 transitions. Word has length 7 [2025-03-17 18:56:05,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 18:56:05,098 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 68 transitions. [2025-03-17 18:56:05,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 18:56:05,099 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 68 transitions. [2025-03-17 18:56:05,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-17 18:56:05,099 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 18:56:05,099 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 18:56:05,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 18:56:05,099 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 37 more)] === [2025-03-17 18:56:05,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 18:56:05,100 INFO L85 PathProgramCache]: Analyzing trace with hash 808588731, now seen corresponding path program 1 times [2025-03-17 18:56:05,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 18:56:05,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915445706] [2025-03-17 18:56:05,100 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 18:56:05,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 18:56:05,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-17 18:56:05,133 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 18:56:05,134 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 18:56:05,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 18:56:05,263 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 18:56:05,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 18:56:05,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915445706] [2025-03-17 18:56:05,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915445706] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 18:56:05,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [432327908] [2025-03-17 18:56:05,264 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 18:56:05,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 18:56:05,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 18:56:05,266 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 18:56:05,267 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 18:56:05,366 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-17 18:56:05,464 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 18:56:05,465 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 18:56:05,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 18:56:05,468 INFO L256 TraceCheckSpWp]: Trace formula consists of 871 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 18:56:05,470 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 18:56:05,480 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 18:56:05,480 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 18:56:05,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [432327908] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 18:56:05,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 18:56:05,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-03-17 18:56:05,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911336974] [2025-03-17 18:56:05,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 18:56:05,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 18:56:05,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 18:56:05,482 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 18:56:05,482 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 18:56:05,482 INFO L87 Difference]: Start difference. First operand 56 states and 68 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 18:56:05,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 18:56:05,523 INFO L93 Difference]: Finished difference Result 56 states and 68 transitions. [2025-03-17 18:56:05,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 18:56:05,524 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2025-03-17 18:56:05,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 18:56:05,525 INFO L225 Difference]: With dead ends: 56 [2025-03-17 18:56:05,525 INFO L226 Difference]: Without dead ends: 54 [2025-03-17 18:56:05,525 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 18:56:05,526 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 49 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 18:56:05,526 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 65 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 18:56:05,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2025-03-17 18:56:05,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2025-03-17 18:56:05,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 41 states have (on average 1.4634146341463414) internal successors, (60), 49 states have internal predecessors, (60), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 18:56:05,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 66 transitions. [2025-03-17 18:56:05,530 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 66 transitions. Word has length 11 [2025-03-17 18:56:05,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 18:56:05,531 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 66 transitions. [2025-03-17 18:56:05,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 18:56:05,531 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 66 transitions. [2025-03-17 18:56:05,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-17 18:56:05,531 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 18:56:05,531 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 18:56:05,540 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-17 18:56:05,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2025-03-17 18:56:05,732 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 37 more)] === [2025-03-17 18:56:05,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 18:56:05,733 INFO L85 PathProgramCache]: Analyzing trace with hash -703552953, now seen corresponding path program 1 times [2025-03-17 18:56:05,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 18:56:05,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850542478] [2025-03-17 18:56:05,733 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 18:56:05,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 18:56:05,760 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-17 18:56:05,771 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-17 18:56:05,772 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 18:56:05,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 18:56:05,880 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 18:56:05,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 18:56:05,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850542478] [2025-03-17 18:56:05,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850542478] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 18:56:05,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1097714792] [2025-03-17 18:56:05,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 18:56:05,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 18:56:05,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 18:56:05,885 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 18:56:05,888 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 18:56:06,015 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-17 18:56:06,129 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-17 18:56:06,130 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 18:56:06,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 18:56:06,133 INFO L256 TraceCheckSpWp]: Trace formula consists of 872 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 18:56:06,134 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 18:56:06,148 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 18:56:06,149 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 18:56:06,175 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 18:56:06,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1097714792] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 18:56:06,175 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 18:56:06,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 4] total 7 [2025-03-17 18:56:06,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951608741] [2025-03-17 18:56:06,175 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 18:56:06,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 18:56:06,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 18:56:06,176 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 18:56:06,178 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-17 18:56:06,178 INFO L87 Difference]: Start difference. First operand 54 states and 66 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 18:56:06,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 18:56:06,212 INFO L93 Difference]: Finished difference Result 112 states and 138 transitions. [2025-03-17 18:56:06,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 18:56:06,213 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 12 [2025-03-17 18:56:06,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 18:56:06,214 INFO L225 Difference]: With dead ends: 112 [2025-03-17 18:56:06,214 INFO L226 Difference]: Without dead ends: 63 [2025-03-17 18:56:06,214 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 21 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-17 18:56:06,215 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 4 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 18:56:06,215 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 182 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 18:56:06,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2025-03-17 18:56:06,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2025-03-17 18:56:06,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 50 states have (on average 1.38) internal successors, (69), 58 states have internal predecessors, (69), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 18:56:06,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 75 transitions. [2025-03-17 18:56:06,225 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 75 transitions. Word has length 12 [2025-03-17 18:56:06,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 18:56:06,225 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 75 transitions. [2025-03-17 18:56:06,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 18:56:06,225 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 75 transitions. [2025-03-17 18:56:06,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-17 18:56:06,225 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 18:56:06,225 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 18:56:06,233 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-17 18:56:06,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 18:56:06,427 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 37 more)] === [2025-03-17 18:56:06,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 18:56:06,427 INFO L85 PathProgramCache]: Analyzing trace with hash -1348792301, now seen corresponding path program 2 times [2025-03-17 18:56:06,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 18:56:06,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37011799] [2025-03-17 18:56:06,427 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 18:56:06,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 18:56:06,453 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-03-17 18:56:06,477 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 9 of 21 statements. [2025-03-17 18:56:06,477 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 18:56:06,477 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 18:56:06,635 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-17 18:56:06,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 18:56:06,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37011799] [2025-03-17 18:56:06,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37011799] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 18:56:06,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 18:56:06,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 18:56:06,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735361939] [2025-03-17 18:56:06,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 18:56:06,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 18:56:06,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 18:56:06,636 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 18:56:06,636 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 18:56:06,636 INFO L87 Difference]: Start difference. First operand 63 states and 75 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 18:56:06,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 18:56:06,704 INFO L93 Difference]: Finished difference Result 63 states and 75 transitions. [2025-03-17 18:56:06,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 18:56:06,705 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2025-03-17 18:56:06,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 18:56:06,705 INFO L225 Difference]: With dead ends: 63 [2025-03-17 18:56:06,705 INFO L226 Difference]: Without dead ends: 61 [2025-03-17 18:56:06,705 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 18:56:06,706 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 48 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 18:56:06,706 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 155 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 18:56:06,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2025-03-17 18:56:06,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2025-03-17 18:56:06,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 50 states have (on average 1.34) internal successors, (67), 56 states have internal predecessors, (67), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 18:56:06,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 73 transitions. [2025-03-17 18:56:06,710 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 73 transitions. Word has length 21 [2025-03-17 18:56:06,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 18:56:06,710 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 73 transitions. [2025-03-17 18:56:06,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 18:56:06,711 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 73 transitions. [2025-03-17 18:56:06,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-17 18:56:06,715 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 18:56:06,715 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 18:56:06,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 18:56:06,715 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 37 more)] === [2025-03-17 18:56:06,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 18:56:06,715 INFO L85 PathProgramCache]: Analyzing trace with hash 1347675978, now seen corresponding path program 1 times [2025-03-17 18:56:06,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 18:56:06,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453425766] [2025-03-17 18:56:06,716 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 18:56:06,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 18:56:06,768 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-17 18:56:06,791 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-17 18:56:06,791 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 18:56:06,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 18:56:06,909 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-17 18:56:06,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 18:56:06,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453425766] [2025-03-17 18:56:06,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453425766] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 18:56:06,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 18:56:06,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 18:56:06,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053327873] [2025-03-17 18:56:06,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 18:56:06,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 18:56:06,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 18:56:06,910 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 18:56:06,910 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 18:56:06,910 INFO L87 Difference]: Start difference. First operand 61 states and 73 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 18:56:06,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 18:56:06,934 INFO L93 Difference]: Finished difference Result 106 states and 131 transitions. [2025-03-17 18:56:06,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 18:56:06,939 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2025-03-17 18:56:06,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 18:56:06,939 INFO L225 Difference]: With dead ends: 106 [2025-03-17 18:56:06,939 INFO L226 Difference]: Without dead ends: 64 [2025-03-17 18:56:06,939 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-17 18:56:06,940 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 2 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 18:56:06,940 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 115 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 18:56:06,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2025-03-17 18:56:06,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2025-03-17 18:56:06,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 53 states have (on average 1.320754716981132) internal successors, (70), 59 states have internal predecessors, (70), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 18:56:06,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 76 transitions. [2025-03-17 18:56:06,947 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 76 transitions. Word has length 26 [2025-03-17 18:56:06,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 18:56:06,947 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 76 transitions. [2025-03-17 18:56:06,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 18:56:06,947 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 76 transitions. [2025-03-17 18:56:06,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-17 18:56:06,949 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 18:56:06,949 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] [2025-03-17 18:56:06,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 18:56:06,949 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 37 more)] === [2025-03-17 18:56:06,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 18:56:06,949 INFO L85 PathProgramCache]: Analyzing trace with hash -734304948, now seen corresponding path program 1 times [2025-03-17 18:56:06,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 18:56:06,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435324419] [2025-03-17 18:56:06,950 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 18:56:06,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 18:56:06,978 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-17 18:56:06,991 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-17 18:56:06,991 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 18:56:06,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 18:56:07,106 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-17 18:56:07,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 18:56:07,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435324419] [2025-03-17 18:56:07,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435324419] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 18:56:07,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1315614269] [2025-03-17 18:56:07,107 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 18:56:07,107 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 18:56:07,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 18:56:07,109 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 18:56:07,110 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-17 18:56:07,218 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-17 18:56:07,328 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-17 18:56:07,328 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 18:56:07,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 18:56:07,331 INFO L256 TraceCheckSpWp]: Trace formula consists of 1039 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 18:56:07,333 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 18:56:07,349 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-17 18:56:07,349 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 18:56:07,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1315614269] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 18:56:07,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 18:56:07,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-03-17 18:56:07,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893070875] [2025-03-17 18:56:07,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 18:56:07,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 18:56:07,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 18:56:07,350 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 18:56:07,351 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 18:56:07,351 INFO L87 Difference]: Start difference. First operand 64 states and 76 transitions. Second operand has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 18:56:07,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 18:56:07,379 INFO L93 Difference]: Finished difference Result 64 states and 76 transitions. [2025-03-17 18:56:07,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 18:56:07,379 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2025-03-17 18:56:07,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 18:56:07,380 INFO L225 Difference]: With dead ends: 64 [2025-03-17 18:56:07,380 INFO L226 Difference]: Without dead ends: 63 [2025-03-17 18:56:07,381 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 18:56:07,381 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 3 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 18:56:07,381 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 105 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 18:56:07,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2025-03-17 18:56:07,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2025-03-17 18:56:07,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 53 states have (on average 1.3018867924528301) internal successors, (69), 58 states have internal predecessors, (69), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 18:56:07,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 75 transitions. [2025-03-17 18:56:07,388 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 75 transitions. Word has length 29 [2025-03-17 18:56:07,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 18:56:07,388 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 75 transitions. [2025-03-17 18:56:07,388 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 18:56:07,388 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 75 transitions. [2025-03-17 18:56:07,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-17 18:56:07,389 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 18:56:07,389 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 18:56:07,397 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-17 18:56:07,589 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-17 18:56:07,589 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 37 more)] === [2025-03-17 18:56:07,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 18:56:07,590 INFO L85 PathProgramCache]: Analyzing trace with hash -734304788, now seen corresponding path program 1 times [2025-03-17 18:56:07,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 18:56:07,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818859832] [2025-03-17 18:56:07,590 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 18:56:07,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 18:56:07,628 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-17 18:56:07,644 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-17 18:56:07,644 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 18:56:07,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 18:56:07,749 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-17 18:56:07,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 18:56:07,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818859832] [2025-03-17 18:56:07,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818859832] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 18:56:07,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1455765131] [2025-03-17 18:56:07,749 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 18:56:07,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 18:56:07,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 18:56:07,751 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 18:56:07,753 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-17 18:56:07,884 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-17 18:56:07,984 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-17 18:56:07,984 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 18:56:07,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 18:56:07,987 INFO L256 TraceCheckSpWp]: Trace formula consists of 1057 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 18:56:07,989 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 18:56:08,032 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 18:56:08,033 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 18:56:08,104 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 18:56:08,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1455765131] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 18:56:08,105 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 18:56:08,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 6, 7] total 14 [2025-03-17 18:56:08,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832080498] [2025-03-17 18:56:08,106 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 18:56:08,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-17 18:56:08,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 18:56:08,107 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-17 18:56:08,107 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2025-03-17 18:56:08,107 INFO L87 Difference]: Start difference. First operand 63 states and 75 transitions. Second operand has 14 states, 14 states have (on average 4.142857142857143) internal successors, (58), 14 states have internal predecessors, (58), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-17 18:56:08,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 18:56:08,205 INFO L93 Difference]: Finished difference Result 129 states and 159 transitions. [2025-03-17 18:56:08,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-17 18:56:08,205 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.142857142857143) internal successors, (58), 14 states have internal predecessors, (58), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 29 [2025-03-17 18:56:08,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 18:56:08,206 INFO L225 Difference]: With dead ends: 129 [2025-03-17 18:56:08,206 INFO L226 Difference]: Without dead ends: 80 [2025-03-17 18:56:08,206 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2025-03-17 18:56:08,207 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 5 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 18:56:08,207 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 410 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 18:56:08,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2025-03-17 18:56:08,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2025-03-17 18:56:08,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 71 states have (on average 1.2112676056338028) internal successors, (86), 75 states have internal predecessors, (86), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 18:56:08,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 92 transitions. [2025-03-17 18:56:08,215 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 92 transitions. Word has length 29 [2025-03-17 18:56:08,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 18:56:08,215 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 92 transitions. [2025-03-17 18:56:08,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.142857142857143) internal successors, (58), 14 states have internal predecessors, (58), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-17 18:56:08,215 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 92 transitions. [2025-03-17 18:56:08,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-17 18:56:08,216 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 18:56:08,216 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 18:56:08,224 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-17 18:56:08,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 18:56:08,417 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 37 more)] === [2025-03-17 18:56:08,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 18:56:08,417 INFO L85 PathProgramCache]: Analyzing trace with hash -729044409, now seen corresponding path program 1 times [2025-03-17 18:56:08,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 18:56:08,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255873982] [2025-03-17 18:56:08,420 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 18:56:08,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 18:56:08,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-17 18:56:08,473 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-17 18:56:08,474 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 18:56:08,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 18:56:08,565 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2025-03-17 18:56:08,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 18:56:08,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255873982] [2025-03-17 18:56:08,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255873982] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 18:56:08,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 18:56:08,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 18:56:08,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605839954] [2025-03-17 18:56:08,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 18:56:08,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 18:56:08,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 18:56:08,567 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 18:56:08,567 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 18:56:08,567 INFO L87 Difference]: Start difference. First operand 80 states and 92 transitions. Second operand has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 18:56:08,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 18:56:08,598 INFO L93 Difference]: Finished difference Result 91 states and 105 transitions. [2025-03-17 18:56:08,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 18:56:08,598 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 48 [2025-03-17 18:56:08,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 18:56:08,599 INFO L225 Difference]: With dead ends: 91 [2025-03-17 18:56:08,599 INFO L226 Difference]: Without dead ends: 90 [2025-03-17 18:56:08,599 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 18:56:08,599 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 1 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 18:56:08,599 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 109 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 18:56:08,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2025-03-17 18:56:08,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 89. [2025-03-17 18:56:08,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 80 states have (on average 1.225) internal successors, (98), 84 states have internal predecessors, (98), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 18:56:08,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 104 transitions. [2025-03-17 18:56:08,604 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 104 transitions. Word has length 48 [2025-03-17 18:56:08,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 18:56:08,604 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 104 transitions. [2025-03-17 18:56:08,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 18:56:08,605 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 104 transitions. [2025-03-17 18:56:08,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-17 18:56:08,605 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 18:56:08,605 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 18:56:08,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 18:56:08,606 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 37 more)] === [2025-03-17 18:56:08,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 18:56:08,606 INFO L85 PathProgramCache]: Analyzing trace with hash -729039444, now seen corresponding path program 1 times [2025-03-17 18:56:08,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 18:56:08,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124701039] [2025-03-17 18:56:08,606 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 18:56:08,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 18:56:08,661 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-17 18:56:08,673 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-17 18:56:08,674 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 18:56:08,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 18:56:08,741 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2025-03-17 18:56:08,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 18:56:08,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124701039] [2025-03-17 18:56:08,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124701039] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 18:56:08,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 18:56:08,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 18:56:08,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831677801] [2025-03-17 18:56:08,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 18:56:08,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 18:56:08,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 18:56:08,742 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 18:56:08,742 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 18:56:08,742 INFO L87 Difference]: Start difference. First operand 89 states and 104 transitions. Second operand has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 18:56:08,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 18:56:08,764 INFO L93 Difference]: Finished difference Result 89 states and 104 transitions. [2025-03-17 18:56:08,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 18:56:08,765 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 48 [2025-03-17 18:56:08,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 18:56:08,765 INFO L225 Difference]: With dead ends: 89 [2025-03-17 18:56:08,765 INFO L226 Difference]: Without dead ends: 88 [2025-03-17 18:56:08,766 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 18:56:08,766 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 0 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 18:56:08,766 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 111 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 18:56:08,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2025-03-17 18:56:08,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 84. [2025-03-17 18:56:08,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 76 states have (on average 1.2105263157894737) internal successors, (92), 79 states have internal predecessors, (92), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 18:56:08,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 98 transitions. [2025-03-17 18:56:08,771 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 98 transitions. Word has length 48 [2025-03-17 18:56:08,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 18:56:08,771 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 98 transitions. [2025-03-17 18:56:08,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 18:56:08,771 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 98 transitions. [2025-03-17 18:56:08,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-17 18:56:08,772 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 18:56:08,772 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 18:56:08,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 18:56:08,772 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 37 more)] === [2025-03-17 18:56:08,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 18:56:08,772 INFO L85 PathProgramCache]: Analyzing trace with hash -648683544, now seen corresponding path program 1 times [2025-03-17 18:56:08,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 18:56:08,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072680941] [2025-03-17 18:56:08,773 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 18:56:08,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 18:56:08,800 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-17 18:56:08,812 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-17 18:56:08,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 18:56:08,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 18:56:08,888 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2025-03-17 18:56:08,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 18:56:08,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072680941] [2025-03-17 18:56:08,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072680941] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 18:56:08,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 18:56:08,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 18:56:08,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091233797] [2025-03-17 18:56:08,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 18:56:08,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 18:56:08,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 18:56:08,889 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 18:56:08,889 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 18:56:08,889 INFO L87 Difference]: Start difference. First operand 84 states and 98 transitions. Second operand has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 18:56:08,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 18:56:08,914 INFO L93 Difference]: Finished difference Result 89 states and 103 transitions. [2025-03-17 18:56:08,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 18:56:08,914 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), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 52 [2025-03-17 18:56:08,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 18:56:08,915 INFO L225 Difference]: With dead ends: 89 [2025-03-17 18:56:08,915 INFO L226 Difference]: Without dead ends: 87 [2025-03-17 18:56:08,915 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 18:56:08,916 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 1 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 18:56:08,916 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 110 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 18:56:08,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2025-03-17 18:56:08,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2025-03-17 18:56:08,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 79 states have (on average 1.2025316455696202) internal successors, (95), 82 states have internal predecessors, (95), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 18:56:08,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 101 transitions. [2025-03-17 18:56:08,920 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 101 transitions. Word has length 52 [2025-03-17 18:56:08,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 18:56:08,921 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 101 transitions. [2025-03-17 18:56:08,921 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), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 18:56:08,921 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 101 transitions. [2025-03-17 18:56:08,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-17 18:56:08,922 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 18:56:08,922 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 18:56:08,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 18:56:08,922 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 37 more)] === [2025-03-17 18:56:08,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 18:56:08,923 INFO L85 PathProgramCache]: Analyzing trace with hash -1873611355, now seen corresponding path program 1 times [2025-03-17 18:56:08,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 18:56:08,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696448951] [2025-03-17 18:56:08,923 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 18:56:08,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 18:56:08,968 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-17 18:56:08,981 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-17 18:56:08,981 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 18:56:08,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 18:56:09,110 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2025-03-17 18:56:09,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 18:56:09,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696448951] [2025-03-17 18:56:09,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696448951] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 18:56:09,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1351567904] [2025-03-17 18:56:09,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 18:56:09,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 18:56:09,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 18:56:09,113 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 18:56:09,115 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-17 18:56:09,267 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-17 18:56:09,401 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-17 18:56:09,402 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 18:56:09,402 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 18:56:09,406 INFO L256 TraceCheckSpWp]: Trace formula consists of 1150 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 18:56:09,408 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 18:56:09,438 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2025-03-17 18:56:09,438 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 18:56:09,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1351567904] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 18:56:09,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 18:56:09,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [3] total 7 [2025-03-17 18:56:09,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031578981] [2025-03-17 18:56:09,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 18:56:09,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 18:56:09,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 18:56:09,441 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 18:56:09,441 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-17 18:56:09,441 INFO L87 Difference]: Start difference. First operand 87 states and 101 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 18:56:09,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 18:56:09,495 INFO L93 Difference]: Finished difference Result 118 states and 141 transitions. [2025-03-17 18:56:09,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 18:56:09,495 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 55 [2025-03-17 18:56:09,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 18:56:09,496 INFO L225 Difference]: With dead ends: 118 [2025-03-17 18:56:09,496 INFO L226 Difference]: Without dead ends: 108 [2025-03-17 18:56:09,496 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-17 18:56:09,497 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 31 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 18:56:09,497 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 186 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 18:56:09,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2025-03-17 18:56:09,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 104. [2025-03-17 18:56:09,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 94 states have (on average 1.2234042553191489) internal successors, (115), 97 states have internal predecessors, (115), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-17 18:56:09,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 125 transitions. [2025-03-17 18:56:09,507 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 125 transitions. Word has length 55 [2025-03-17 18:56:09,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 18:56:09,508 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 125 transitions. [2025-03-17 18:56:09,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 18:56:09,508 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 125 transitions. [2025-03-17 18:56:09,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-17 18:56:09,509 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 18:56:09,509 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 18:56:09,519 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-17 18:56:09,711 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 18:56:09,711 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 37 more)] === [2025-03-17 18:56:09,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 18:56:09,711 INFO L85 PathProgramCache]: Analyzing trace with hash -461609711, now seen corresponding path program 1 times [2025-03-17 18:56:09,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 18:56:09,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803846244] [2025-03-17 18:56:09,711 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 18:56:09,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 18:56:09,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-17 18:56:09,764 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-17 18:56:09,764 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 18:56:09,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 18:56:09,885 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2025-03-17 18:56:09,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 18:56:09,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803846244] [2025-03-17 18:56:09,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803846244] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 18:56:09,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1236278871] [2025-03-17 18:56:09,886 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 18:56:09,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 18:56:09,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 18:56:09,888 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 18:56:09,889 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-17 18:56:10,040 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-17 18:56:10,156 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-17 18:56:10,156 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 18:56:10,156 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 18:56:10,161 INFO L256 TraceCheckSpWp]: Trace formula consists of 1227 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 18:56:10,163 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 18:56:10,183 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2025-03-17 18:56:10,184 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 18:56:10,208 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2025-03-17 18:56:10,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1236278871] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 18:56:10,208 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 18:56:10,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-17 18:56:10,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383292180] [2025-03-17 18:56:10,208 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 18:56:10,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 18:56:10,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 18:56:10,209 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 18:56:10,209 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-17 18:56:10,209 INFO L87 Difference]: Start difference. First operand 104 states and 125 transitions. Second operand has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 18:56:10,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 18:56:10,259 INFO L93 Difference]: Finished difference Result 167 states and 204 transitions. [2025-03-17 18:56:10,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 18:56:10,260 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 55 [2025-03-17 18:56:10,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 18:56:10,261 INFO L225 Difference]: With dead ends: 167 [2025-03-17 18:56:10,261 INFO L226 Difference]: Without dead ends: 122 [2025-03-17 18:56:10,261 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 107 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-17 18:56:10,262 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 4 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 18:56:10,262 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 273 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 18:56:10,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2025-03-17 18:56:10,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2025-03-17 18:56:10,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 112 states have (on average 1.1875) internal successors, (133), 115 states have internal predecessors, (133), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-17 18:56:10,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 143 transitions. [2025-03-17 18:56:10,273 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 143 transitions. Word has length 55 [2025-03-17 18:56:10,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 18:56:10,274 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 143 transitions. [2025-03-17 18:56:10,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 18:56:10,274 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 143 transitions. [2025-03-17 18:56:10,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-03-17 18:56:10,274 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 18:56:10,274 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 18:56:10,290 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-17 18:56:10,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 18:56:10,475 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 37 more)] === [2025-03-17 18:56:10,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 18:56:10,475 INFO L85 PathProgramCache]: Analyzing trace with hash -2129310595, now seen corresponding path program 1 times [2025-03-17 18:56:10,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 18:56:10,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481222410] [2025-03-17 18:56:10,476 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 18:56:10,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 18:56:10,513 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-17 18:56:10,534 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-17 18:56:10,534 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 18:56:10,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 18:56:10,646 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2025-03-17 18:56:10,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 18:56:10,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481222410] [2025-03-17 18:56:10,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481222410] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 18:56:10,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 18:56:10,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 18:56:10,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13163231] [2025-03-17 18:56:10,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 18:56:10,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 18:56:10,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 18:56:10,647 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 18:56:10,647 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 18:56:10,648 INFO L87 Difference]: Start difference. First operand 122 states and 143 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 18:56:10,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 18:56:10,662 INFO L93 Difference]: Finished difference Result 172 states and 207 transitions. [2025-03-17 18:56:10,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 18:56:10,663 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 59 [2025-03-17 18:56:10,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 18:56:10,664 INFO L225 Difference]: With dead ends: 172 [2025-03-17 18:56:10,664 INFO L226 Difference]: Without dead ends: 126 [2025-03-17 18:56:10,664 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 18:56:10,664 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 0 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 18:56:10,664 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 166 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 18:56:10,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2025-03-17 18:56:10,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2025-03-17 18:56:10,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 116 states have (on average 1.1810344827586208) internal successors, (137), 119 states have internal predecessors, (137), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-17 18:56:10,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 147 transitions. [2025-03-17 18:56:10,669 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 147 transitions. Word has length 59 [2025-03-17 18:56:10,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 18:56:10,670 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 147 transitions. [2025-03-17 18:56:10,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 18:56:10,670 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 147 transitions. [2025-03-17 18:56:10,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-17 18:56:10,670 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 18:56:10,670 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 18:56:10,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 18:56:10,671 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 37 more)] === [2025-03-17 18:56:10,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 18:56:10,671 INFO L85 PathProgramCache]: Analyzing trace with hash -1836862024, now seen corresponding path program 1 times [2025-03-17 18:56:10,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 18:56:10,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141901538] [2025-03-17 18:56:10,671 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 18:56:10,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 18:56:10,700 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-17 18:56:10,712 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-17 18:56:10,713 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 18:56:10,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 18:56:10,837 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked. [2025-03-17 18:56:10,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 18:56:10,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141901538] [2025-03-17 18:56:10,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141901538] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 18:56:10,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 18:56:10,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 18:56:10,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515077223] [2025-03-17 18:56:10,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 18:56:10,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 18:56:10,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 18:56:10,838 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 18:56:10,838 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 18:56:10,838 INFO L87 Difference]: Start difference. First operand 126 states and 147 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-17 18:56:10,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 18:56:10,849 INFO L93 Difference]: Finished difference Result 129 states and 149 transitions. [2025-03-17 18:56:10,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 18:56:10,850 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 65 [2025-03-17 18:56:10,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 18:56:10,850 INFO L225 Difference]: With dead ends: 129 [2025-03-17 18:56:10,850 INFO L226 Difference]: Without dead ends: 126 [2025-03-17 18:56:10,851 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 18:56:10,851 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 8 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 18:56:10,851 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 157 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 18:56:10,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2025-03-17 18:56:10,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2025-03-17 18:56:10,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 116 states have (on average 1.1724137931034482) internal successors, (136), 119 states have internal predecessors, (136), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-17 18:56:10,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 146 transitions. [2025-03-17 18:56:10,858 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 146 transitions. Word has length 65 [2025-03-17 18:56:10,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 18:56:10,859 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 146 transitions. [2025-03-17 18:56:10,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-17 18:56:10,859 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 146 transitions. [2025-03-17 18:56:10,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-17 18:56:10,859 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 18:56:10,860 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 18:56:10,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-17 18:56:10,860 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 37 more)] === [2025-03-17 18:56:10,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 18:56:10,860 INFO L85 PathProgramCache]: Analyzing trace with hash -1836861063, now seen corresponding path program 1 times [2025-03-17 18:56:10,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 18:56:10,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650450386] [2025-03-17 18:56:10,860 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 18:56:10,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 18:56:10,892 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-17 18:56:10,999 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-17 18:56:10,999 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 18:56:10,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 18:56:11,191 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2025-03-17 18:56:11,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 18:56:11,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650450386] [2025-03-17 18:56:11,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650450386] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 18:56:11,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1446645450] [2025-03-17 18:56:11,192 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 18:56:11,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 18:56:11,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 18:56:11,195 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 18:56:11,196 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-17 18:56:11,371 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-17 18:56:11,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-17 18:56:11,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 18:56:11,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 18:56:11,517 INFO L256 TraceCheckSpWp]: Trace formula consists of 1280 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-17 18:56:11,522 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 18:56:11,550 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2025-03-17 18:56:11,552 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 18:56:11,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1446645450] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 18:56:11,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 18:56:11,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 8 [2025-03-17 18:56:11,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171122462] [2025-03-17 18:56:11,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 18:56:11,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 18:56:11,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 18:56:11,553 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 18:56:11,554 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-17 18:56:11,555 INFO L87 Difference]: Start difference. First operand 126 states and 146 transitions. Second operand has 6 states, 5 states have (on average 6.4) internal successors, (32), 6 states have internal predecessors, (32), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 18:56:11,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 18:56:11,624 INFO L93 Difference]: Finished difference Result 134 states and 152 transitions. [2025-03-17 18:56:11,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 18:56:11,624 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.4) internal successors, (32), 6 states have internal predecessors, (32), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 65 [2025-03-17 18:56:11,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 18:56:11,625 INFO L225 Difference]: With dead ends: 134 [2025-03-17 18:56:11,625 INFO L226 Difference]: Without dead ends: 107 [2025-03-17 18:56:11,625 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-17 18:56:11,626 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 6 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 18:56:11,626 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 237 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 18:56:11,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2025-03-17 18:56:11,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2025-03-17 18:56:11,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 99 states have (on average 1.1414141414141414) internal successors, (113), 102 states have internal predecessors, (113), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 18:56:11,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 119 transitions. [2025-03-17 18:56:11,632 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 119 transitions. Word has length 65 [2025-03-17 18:56:11,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 18:56:11,633 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 119 transitions. [2025-03-17 18:56:11,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.4) internal successors, (32), 6 states have internal predecessors, (32), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 18:56:11,633 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 119 transitions. [2025-03-17 18:56:11,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-17 18:56:11,633 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 18:56:11,633 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 18:56:11,644 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-17 18:56:11,839 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,SelfDestructingSolverStorable16 [2025-03-17 18:56:11,839 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 37 more)] === [2025-03-17 18:56:11,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 18:56:11,840 INFO L85 PathProgramCache]: Analyzing trace with hash 2145425757, now seen corresponding path program 1 times [2025-03-17 18:56:11,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 18:56:11,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082787396] [2025-03-17 18:56:11,840 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 18:56:11,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 18:56:11,880 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-17 18:56:11,898 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-17 18:56:11,899 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 18:56:11,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 18:56:12,007 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2025-03-17 18:56:12,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 18:56:12,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082787396] [2025-03-17 18:56:12,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1082787396] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 18:56:12,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [976600389] [2025-03-17 18:56:12,007 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 18:56:12,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 18:56:12,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 18:56:12,009 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 18:56:12,011 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-17 18:56:12,219 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-17 18:56:12,366 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-17 18:56:12,367 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 18:56:12,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 18:56:12,373 INFO L256 TraceCheckSpWp]: Trace formula consists of 1292 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 18:56:12,376 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 18:56:12,427 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 5 proven. 22 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-03-17 18:56:12,427 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 18:56:12,495 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2025-03-17 18:56:12,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [976600389] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 18:56:12,496 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 18:56:12,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 7, 7] total 14 [2025-03-17 18:56:12,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210626379] [2025-03-17 18:56:12,497 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 18:56:12,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-17 18:56:12,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 18:56:12,497 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-17 18:56:12,497 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2025-03-17 18:56:12,497 INFO L87 Difference]: Start difference. First operand 107 states and 119 transitions. Second operand has 14 states, 14 states have (on average 4.928571428571429) internal successors, (69), 14 states have internal predecessors, (69), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-17 18:56:12,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 18:56:12,587 INFO L93 Difference]: Finished difference Result 198 states and 232 transitions. [2025-03-17 18:56:12,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-17 18:56:12,588 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.928571428571429) internal successors, (69), 14 states have internal predecessors, (69), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 71 [2025-03-17 18:56:12,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 18:56:12,589 INFO L225 Difference]: With dead ends: 198 [2025-03-17 18:56:12,589 INFO L226 Difference]: Without dead ends: 142 [2025-03-17 18:56:12,589 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2025-03-17 18:56:12,590 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 5 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 18:56:12,590 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 293 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 18:56:12,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2025-03-17 18:56:12,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2025-03-17 18:56:12,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 135 states have (on average 1.0962962962962963) internal successors, (148), 137 states have internal predecessors, (148), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 18:56:12,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 154 transitions. [2025-03-17 18:56:12,597 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 154 transitions. Word has length 71 [2025-03-17 18:56:12,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 18:56:12,597 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 154 transitions. [2025-03-17 18:56:12,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.928571428571429) internal successors, (69), 14 states have internal predecessors, (69), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-17 18:56:12,598 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 154 transitions. [2025-03-17 18:56:12,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-17 18:56:12,598 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 18:56:12,598 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 2, 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-17 18:56:12,607 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-17 18:56:12,799 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,SelfDestructingSolverStorable17 [2025-03-17 18:56:12,800 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 37 more)] === [2025-03-17 18:56:12,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 18:56:12,800 INFO L85 PathProgramCache]: Analyzing trace with hash 21634162, now seen corresponding path program 1 times [2025-03-17 18:56:12,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 18:56:12,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471114153] [2025-03-17 18:56:12,800 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 18:56:12,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 18:56:12,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-17 18:56:12,894 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-17 18:56:12,894 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 18:56:12,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 18:56:13,007 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 295 trivial. 0 not checked. [2025-03-17 18:56:13,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 18:56:13,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471114153] [2025-03-17 18:56:13,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471114153] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 18:56:13,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1975268166] [2025-03-17 18:56:13,008 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 18:56:13,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 18:56:13,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 18:56:13,013 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 18:56:13,014 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-17 18:56:13,211 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-17 18:56:13,340 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-17 18:56:13,340 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 18:56:13,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 18:56:13,346 INFO L256 TraceCheckSpWp]: Trace formula consists of 1431 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 18:56:13,350 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 18:56:13,379 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 295 trivial. 0 not checked. [2025-03-17 18:56:13,382 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 18:56:13,404 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 295 trivial. 0 not checked. [2025-03-17 18:56:13,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1975268166] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 18:56:13,405 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 18:56:13,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-03-17 18:56:13,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520738588] [2025-03-17 18:56:13,405 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 18:56:13,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 18:56:13,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 18:56:13,406 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 18:56:13,406 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-17 18:56:13,406 INFO L87 Difference]: Start difference. First operand 142 states and 154 transitions. Second operand has 7 states, 6 states have (on average 6.666666666666667) internal successors, (40), 7 states have internal predecessors, (40), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 18:56:13,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 18:56:13,446 INFO L93 Difference]: Finished difference Result 152 states and 166 transitions. [2025-03-17 18:56:13,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 18:56:13,447 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.666666666666667) internal successors, (40), 7 states have internal predecessors, (40), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 90 [2025-03-17 18:56:13,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 18:56:13,447 INFO L225 Difference]: With dead ends: 152 [2025-03-17 18:56:13,447 INFO L226 Difference]: Without dead ends: 151 [2025-03-17 18:56:13,448 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 176 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-17 18:56:13,448 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 0 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 18:56:13,448 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 211 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 18:56:13,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2025-03-17 18:56:13,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2025-03-17 18:56:13,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 144 states have (on average 1.0902777777777777) internal successors, (157), 146 states have internal predecessors, (157), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 18:56:13,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 163 transitions. [2025-03-17 18:56:13,454 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 163 transitions. Word has length 90 [2025-03-17 18:56:13,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 18:56:13,454 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 163 transitions. [2025-03-17 18:56:13,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.666666666666667) internal successors, (40), 7 states have internal predecessors, (40), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 18:56:13,454 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 163 transitions. [2025-03-17 18:56:13,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-17 18:56:13,455 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 18:56:13,455 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 18:56:13,467 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-17 18:56:13,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 18:56:13,656 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 37 more)] === [2025-03-17 18:56:13,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 18:56:13,656 INFO L85 PathProgramCache]: Analyzing trace with hash -970844943, now seen corresponding path program 1 times [2025-03-17 18:56:13,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 18:56:13,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988428535] [2025-03-17 18:56:13,656 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 18:56:13,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 18:56:13,695 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-17 18:56:13,878 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-17 18:56:13,878 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 18:56:13,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 18:56:14,198 INFO L134 CoverageAnalysis]: Checked inductivity of 303 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 296 trivial. 0 not checked. [2025-03-17 18:56:14,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 18:56:14,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988428535] [2025-03-17 18:56:14,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988428535] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 18:56:14,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1715361765] [2025-03-17 18:56:14,199 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 18:56:14,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 18:56:14,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 18:56:14,201 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 18:56:14,203 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-17 18:56:14,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-17 18:56:14,572 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-17 18:56:14,572 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 18:56:14,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 18:56:14,579 INFO L256 TraceCheckSpWp]: Trace formula consists of 1560 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-17 18:56:14,583 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 18:56:14,644 INFO L134 CoverageAnalysis]: Checked inductivity of 303 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2025-03-17 18:56:14,644 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 18:56:14,782 INFO L134 CoverageAnalysis]: Checked inductivity of 303 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 296 trivial. 0 not checked. [2025-03-17 18:56:14,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1715361765] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 18:56:14,783 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 18:56:14,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 10 [2025-03-17 18:56:14,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476021127] [2025-03-17 18:56:14,783 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 18:56:14,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 18:56:14,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 18:56:14,784 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 18:56:14,784 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-03-17 18:56:14,784 INFO L87 Difference]: Start difference. First operand 151 states and 163 transitions. Second operand has 10 states, 8 states have (on average 6.25) internal successors, (50), 10 states have internal predecessors, (50), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 4 states have call successors, (5) [2025-03-17 18:56:14,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 18:56:14,874 INFO L93 Difference]: Finished difference Result 231 states and 252 transitions. [2025-03-17 18:56:14,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 18:56:14,875 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 6.25) internal successors, (50), 10 states have internal predecessors, (50), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 4 states have call successors, (5) Word has length 99 [2025-03-17 18:56:14,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 18:56:14,876 INFO L225 Difference]: With dead ends: 231 [2025-03-17 18:56:14,876 INFO L226 Difference]: Without dead ends: 185 [2025-03-17 18:56:14,876 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 192 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-03-17 18:56:14,876 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 6 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 18:56:14,876 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 326 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 18:56:14,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2025-03-17 18:56:14,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2025-03-17 18:56:14,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 178 states have (on average 1.0786516853932584) internal successors, (192), 180 states have internal predecessors, (192), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 18:56:14,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 198 transitions. [2025-03-17 18:56:14,884 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 198 transitions. Word has length 99 [2025-03-17 18:56:14,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 18:56:14,885 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 198 transitions. [2025-03-17 18:56:14,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 6.25) internal successors, (50), 10 states have internal predecessors, (50), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 4 states have call successors, (5) [2025-03-17 18:56:14,885 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 198 transitions. [2025-03-17 18:56:14,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-17 18:56:14,886 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 18:56:14,886 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 10, 10, 10, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 18:56:14,897 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-17 18:56:15,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 18:56:15,087 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 37 more)] === [2025-03-17 18:56:15,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 18:56:15,087 INFO L85 PathProgramCache]: Analyzing trace with hash -737963415, now seen corresponding path program 2 times [2025-03-17 18:56:15,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 18:56:15,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596013632] [2025-03-17 18:56:15,087 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 18:56:15,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 18:56:15,170 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 133 statements into 2 equivalence classes. [2025-03-17 18:56:16,147 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 133 of 133 statements. [2025-03-17 18:56:16,147 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 18:56:16,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 18:56:18,185 INFO L134 CoverageAnalysis]: Checked inductivity of 773 backedges. 6 proven. 325 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2025-03-17 18:56:18,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 18:56:18,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596013632] [2025-03-17 18:56:18,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596013632] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 18:56:18,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [99583224] [2025-03-17 18:56:18,186 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 18:56:18,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 18:56:18,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 18:56:18,187 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 18:56:18,189 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-17 18:56:18,451 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 133 statements into 2 equivalence classes. [2025-03-17 18:56:18,634 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 133 of 133 statements. [2025-03-17 18:56:18,634 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 18:56:18,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 18:56:18,643 INFO L256 TraceCheckSpWp]: Trace formula consists of 1840 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-03-17 18:56:18,648 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 18:56:18,687 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-17 18:56:18,688 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-03-17 18:56:18,894 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-17 18:56:18,894 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-03-17 18:56:18,918 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-03-17 18:56:18,918 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2025-03-17 18:56:18,979 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-17 18:56:18,979 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-03-17 18:56:19,148 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-17 18:56:19,148 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-03-17 18:56:19,350 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-17 18:56:19,464 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 18:56:19,467 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2025-03-17 18:56:19,485 INFO L134 CoverageAnalysis]: Checked inductivity of 773 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 767 trivial. 0 not checked. [2025-03-17 18:56:19,485 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 18:56:19,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [99583224] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 18:56:19,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 18:56:19,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [14] total 20 [2025-03-17 18:56:19,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501313350] [2025-03-17 18:56:19,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 18:56:19,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 18:56:19,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 18:56:19,486 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 18:56:19,486 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=303, Unknown=0, NotChecked=0, Total=380 [2025-03-17 18:56:19,486 INFO L87 Difference]: Start difference. First operand 185 states and 198 transitions. Second operand has 8 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-17 18:56:19,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 18:56:19,637 INFO L93 Difference]: Finished difference Result 235 states and 255 transitions. [2025-03-17 18:56:19,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 18:56:19,637 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 133 [2025-03-17 18:56:19,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 18:56:19,638 INFO L225 Difference]: With dead ends: 235 [2025-03-17 18:56:19,638 INFO L226 Difference]: Without dead ends: 193 [2025-03-17 18:56:19,639 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 129 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=367, Unknown=0, NotChecked=0, Total=462 [2025-03-17 18:56:19,640 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 25 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 18:56:19,640 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 248 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 18:56:19,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2025-03-17 18:56:19,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 184. [2025-03-17 18:56:19,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 177 states have (on average 1.0677966101694916) internal successors, (189), 179 states have internal predecessors, (189), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 18:56:19,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 195 transitions. [2025-03-17 18:56:19,654 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 195 transitions. Word has length 133 [2025-03-17 18:56:19,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 18:56:19,655 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 195 transitions. [2025-03-17 18:56:19,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-17 18:56:19,655 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 195 transitions. [2025-03-17 18:56:19,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-17 18:56:19,656 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 18:56:19,656 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 10, 10, 10, 5, 5, 4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 18:56:19,668 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-03-17 18:56:19,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2025-03-17 18:56:19,856 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 37 more)] === [2025-03-17 18:56:19,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 18:56:19,857 INFO L85 PathProgramCache]: Analyzing trace with hash 2028716087, now seen corresponding path program 2 times [2025-03-17 18:56:19,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 18:56:19,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719240767] [2025-03-17 18:56:19,857 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 18:56:19,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 18:56:19,911 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 133 statements into 2 equivalence classes. [2025-03-17 18:56:19,917 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 13 of 133 statements. [2025-03-17 18:56:19,917 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 18:56:19,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 18:56:19,990 INFO L134 CoverageAnalysis]: Checked inductivity of 795 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 787 trivial. 0 not checked. [2025-03-17 18:56:19,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 18:56:19,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719240767] [2025-03-17 18:56:19,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719240767] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 18:56:19,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2142970528] [2025-03-17 18:56:19,990 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 18:56:19,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 18:56:19,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 18:56:19,993 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 18:56:19,994 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-17 18:56:20,273 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 133 statements into 2 equivalence classes. [2025-03-17 18:56:20,354 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 13 of 133 statements. [2025-03-17 18:56:20,354 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 18:56:20,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 18:56:20,359 INFO L256 TraceCheckSpWp]: Trace formula consists of 881 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 18:56:20,362 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 18:56:20,455 INFO L134 CoverageAnalysis]: Checked inductivity of 795 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 787 trivial. 0 not checked. [2025-03-17 18:56:20,455 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 18:56:20,557 INFO L134 CoverageAnalysis]: Checked inductivity of 795 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 787 trivial. 0 not checked. [2025-03-17 18:56:20,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2142970528] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 18:56:20,557 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 18:56:20,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 3 [2025-03-17 18:56:20,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202997817] [2025-03-17 18:56:20,557 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 18:56:20,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 18:56:20,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 18:56:20,558 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 18:56:20,558 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 18:56:20,558 INFO L87 Difference]: Start difference. First operand 184 states and 195 transitions. Second operand has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 18:56:20,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 18:56:20,601 INFO L93 Difference]: Finished difference Result 184 states and 195 transitions. [2025-03-17 18:56:20,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 18:56:20,602 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 133 [2025-03-17 18:56:20,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 18:56:20,603 INFO L225 Difference]: With dead ends: 184 [2025-03-17 18:56:20,603 INFO L226 Difference]: Without dead ends: 166 [2025-03-17 18:56:20,603 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 264 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 18:56:20,604 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 22 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 18:56:20,604 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 97 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 18:56:20,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2025-03-17 18:56:20,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2025-03-17 18:56:20,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 160 states have (on average 1.05625) internal successors, (169), 161 states have internal predecessors, (169), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 18:56:20,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 175 transitions. [2025-03-17 18:56:20,614 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 175 transitions. Word has length 133 [2025-03-17 18:56:20,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 18:56:20,614 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 175 transitions. [2025-03-17 18:56:20,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 18:56:20,614 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 175 transitions. [2025-03-17 18:56:20,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-17 18:56:20,615 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 18:56:20,615 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 10, 10, 10, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 18:56:20,629 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-03-17 18:56:20,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-03-17 18:56:20,816 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 37 more)] === [2025-03-17 18:56:20,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 18:56:20,816 INFO L85 PathProgramCache]: Analyzing trace with hash -419932053, now seen corresponding path program 1 times [2025-03-17 18:56:20,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 18:56:20,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907271166] [2025-03-17 18:56:20,816 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 18:56:20,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 18:56:20,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-17 18:56:21,704 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-17 18:56:21,704 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 18:56:21,704 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 18:56:21,704 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 18:56:21,721 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-17 18:56:22,078 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-17 18:56:22,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 18:56:22,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 18:56:22,137 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 18:56:22,138 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 18:56:22,138 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr29ASSERT_VIOLATIONUNSUPPORTED_FEATURE (39 of 40 remaining) [2025-03-17 18:56:22,140 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (38 of 40 remaining) [2025-03-17 18:56:22,140 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (37 of 40 remaining) [2025-03-17 18:56:22,140 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (36 of 40 remaining) [2025-03-17 18:56:22,140 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (35 of 40 remaining) [2025-03-17 18:56:22,140 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONUNSUPPORTED_FEATURE (34 of 40 remaining) [2025-03-17 18:56:22,140 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (33 of 40 remaining) [2025-03-17 18:56:22,140 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (32 of 40 remaining) [2025-03-17 18:56:22,140 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (31 of 40 remaining) [2025-03-17 18:56:22,141 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (30 of 40 remaining) [2025-03-17 18:56:22,141 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 40 remaining) [2025-03-17 18:56:22,141 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 40 remaining) [2025-03-17 18:56:22,141 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 40 remaining) [2025-03-17 18:56:22,141 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 40 remaining) [2025-03-17 18:56:22,141 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 40 remaining) [2025-03-17 18:56:22,141 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 40 remaining) [2025-03-17 18:56:22,141 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 40 remaining) [2025-03-17 18:56:22,141 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 40 remaining) [2025-03-17 18:56:22,141 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 40 remaining) [2025-03-17 18:56:22,141 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 40 remaining) [2025-03-17 18:56:22,141 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 40 remaining) [2025-03-17 18:56:22,141 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 40 remaining) [2025-03-17 18:56:22,141 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 40 remaining) [2025-03-17 18:56:22,142 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 40 remaining) [2025-03-17 18:56:22,142 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 40 remaining) [2025-03-17 18:56:22,142 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 40 remaining) [2025-03-17 18:56:22,142 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 40 remaining) [2025-03-17 18:56:22,142 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 40 remaining) [2025-03-17 18:56:22,142 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 40 remaining) [2025-03-17 18:56:22,142 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 40 remaining) [2025-03-17 18:56:22,142 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 40 remaining) [2025-03-17 18:56:22,142 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 40 remaining) [2025-03-17 18:56:22,142 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 40 remaining) [2025-03-17 18:56:22,142 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 40 remaining) [2025-03-17 18:56:22,142 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 40 remaining) [2025-03-17 18:56:22,143 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 40 remaining) [2025-03-17 18:56:22,143 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 40 remaining) [2025-03-17 18:56:22,143 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 40 remaining) [2025-03-17 18:56:22,143 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 40 remaining) [2025-03-17 18:56:22,143 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 40 remaining) [2025-03-17 18:56:22,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-17 18:56:22,146 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 18:56:22,249 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 18:56:22,252 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 06:56:22 BoogieIcfgContainer [2025-03-17 18:56:22,253 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 18:56:22,254 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 18:56:22,254 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 18:56:22,254 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 18:56:22,255 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 06:56:03" (3/4) ... [2025-03-17 18:56:22,257 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-17 18:56:22,257 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 18:56:22,259 INFO L158 Benchmark]: Toolchain (without parser) took 20588.68ms. Allocated memory was 201.3MB in the beginning and 872.4MB in the end (delta: 671.1MB). Free memory was 151.2MB in the beginning and 480.8MB in the end (delta: -329.6MB). Peak memory consumption was 348.2MB. Max. memory is 16.1GB. [2025-03-17 18:56:22,259 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 120.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 18:56:22,259 INFO L158 Benchmark]: CACSL2BoogieTranslator took 982.49ms. Allocated memory is still 201.3MB. Free memory was 151.2MB in the beginning and 75.8MB in the end (delta: 75.3MB). Peak memory consumption was 75.5MB. Max. memory is 16.1GB. [2025-03-17 18:56:22,259 INFO L158 Benchmark]: Boogie Procedure Inliner took 90.03ms. Allocated memory is still 201.3MB. Free memory was 75.8MB in the beginning and 68.3MB in the end (delta: 7.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 18:56:22,259 INFO L158 Benchmark]: Boogie Preprocessor took 78.13ms. Allocated memory is still 201.3MB. Free memory was 68.3MB in the beginning and 62.0MB in the end (delta: 6.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 18:56:22,260 INFO L158 Benchmark]: IcfgBuilder took 817.97ms. Allocated memory is still 201.3MB. Free memory was 62.0MB in the beginning and 84.7MB in the end (delta: -22.7MB). Peak memory consumption was 28.2MB. Max. memory is 16.1GB. [2025-03-17 18:56:22,260 INFO L158 Benchmark]: TraceAbstraction took 18610.72ms. Allocated memory was 201.3MB in the beginning and 872.4MB in the end (delta: 671.1MB). Free memory was 83.7MB in the beginning and 480.9MB in the end (delta: -397.2MB). Peak memory consumption was 269.7MB. Max. memory is 16.1GB. [2025-03-17 18:56:22,260 INFO L158 Benchmark]: Witness Printer took 3.50ms. Allocated memory is still 872.4MB. Free memory was 480.9MB in the beginning and 480.8MB in the end (delta: 138.0kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 18:56:22,261 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 120.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 982.49ms. Allocated memory is still 201.3MB. Free memory was 151.2MB in the beginning and 75.8MB in the end (delta: 75.3MB). Peak memory consumption was 75.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 90.03ms. Allocated memory is still 201.3MB. Free memory was 75.8MB in the beginning and 68.3MB in the end (delta: 7.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 78.13ms. Allocated memory is still 201.3MB. Free memory was 68.3MB in the beginning and 62.0MB in the end (delta: 6.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 817.97ms. Allocated memory is still 201.3MB. Free memory was 62.0MB in the beginning and 84.7MB in the end (delta: -22.7MB). Peak memory consumption was 28.2MB. Max. memory is 16.1GB. * TraceAbstraction took 18610.72ms. Allocated memory was 201.3MB in the beginning and 872.4MB in the end (delta: 671.1MB). Free memory was 83.7MB in the beginning and 480.9MB in the end (delta: -397.2MB). Peak memory consumption was 269.7MB. Max. memory is 16.1GB. * Witness Printer took 3.50ms. Allocated memory is still 872.4MB. Free memory was 480.9MB in the beginning and 480.8MB in the end (delta: 138.0kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 382]: Unable to prove that there are no unsupported features in the program Unable to prove that there are no unsupported features in the program Reason: overapproximation of undefined function vasprintf at line 382. Possible FailurePath: [L1886] static const char *applet_name; [L1887] static signed int bb_errno_location; [L1888] static signed int * const bb_errno = &bb_errno_location; [L1889] static signed char logmode = (signed char)1; [L1890] static const char *msg_eol = "\n"; [L2069] static struct utmp dummy_utmp; [L2132] char *a = malloc(11); [L2133] a[10] = 0 [L2134] int i=0; VAL [a={-1:0}, applet_name={0:0}, bb_errno={7:0}, bb_errno_location={7:0}, dummy_utmp={8:0}, i=0, logmode=1, msg_eol={3:0}] [L2134] COND TRUE i<10 [L2135] a[i]=__VERIFIER_nondet_char() VAL [a={-1:0}, applet_name={0:0}, bb_errno={7:0}, bb_errno_location={7:0}, dummy_utmp={8:0}, i=0, logmode=1, msg_eol={3:0}] [L2134] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno={7:0}, bb_errno_location={7:0}, dummy_utmp={8:0}, i=1, logmode=1, msg_eol={3:0}] [L2134] COND TRUE i<10 [L2135] a[i]=__VERIFIER_nondet_char() VAL [a={-1:0}, applet_name={0:0}, bb_errno={7:0}, bb_errno_location={7:0}, dummy_utmp={8:0}, i=1, logmode=1, msg_eol={3:0}] [L2134] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno={7:0}, bb_errno_location={7:0}, dummy_utmp={8:0}, i=2, logmode=1, msg_eol={3:0}] [L2134] COND TRUE i<10 [L2135] a[i]=__VERIFIER_nondet_char() VAL [a={-1:0}, applet_name={0:0}, bb_errno={7:0}, bb_errno_location={7:0}, dummy_utmp={8:0}, i=2, logmode=1, msg_eol={3:0}] [L2134] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno={7:0}, bb_errno_location={7:0}, dummy_utmp={8:0}, i=3, logmode=1, msg_eol={3:0}] [L2134] COND TRUE i<10 [L2135] a[i]=__VERIFIER_nondet_char() VAL [a={-1:0}, applet_name={0:0}, bb_errno={7:0}, bb_errno_location={7:0}, dummy_utmp={8:0}, i=3, logmode=1, msg_eol={3:0}] [L2134] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno={7:0}, bb_errno_location={7:0}, dummy_utmp={8:0}, i=4, logmode=1, msg_eol={3:0}] [L2134] COND TRUE i<10 [L2135] a[i]=__VERIFIER_nondet_char() VAL [a={-1:0}, applet_name={0:0}, bb_errno={7:0}, bb_errno_location={7:0}, dummy_utmp={8:0}, i=4, logmode=1, msg_eol={3:0}] [L2134] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno={7:0}, bb_errno_location={7:0}, dummy_utmp={8:0}, i=5, logmode=1, msg_eol={3:0}] [L2134] COND TRUE i<10 [L2135] a[i]=__VERIFIER_nondet_char() VAL [a={-1:0}, applet_name={0:0}, bb_errno={7:0}, bb_errno_location={7:0}, dummy_utmp={8:0}, i=5, logmode=1, msg_eol={3:0}] [L2134] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno={7:0}, bb_errno_location={7:0}, dummy_utmp={8:0}, i=6, logmode=1, msg_eol={3:0}] [L2134] COND TRUE i<10 [L2135] a[i]=__VERIFIER_nondet_char() VAL [a={-1:0}, applet_name={0:0}, bb_errno={7:0}, bb_errno_location={7:0}, dummy_utmp={8:0}, i=6, logmode=1, msg_eol={3:0}] [L2134] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno={7:0}, bb_errno_location={7:0}, dummy_utmp={8:0}, i=7, logmode=1, msg_eol={3:0}] [L2134] COND TRUE i<10 [L2135] a[i]=__VERIFIER_nondet_char() VAL [a={-1:0}, applet_name={0:0}, bb_errno={7:0}, bb_errno_location={7:0}, dummy_utmp={8:0}, i=7, logmode=1, msg_eol={3:0}] [L2134] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno={7:0}, bb_errno_location={7:0}, dummy_utmp={8:0}, i=8, logmode=1, msg_eol={3:0}] [L2134] COND TRUE i<10 [L2135] a[i]=__VERIFIER_nondet_char() VAL [a={-1:0}, applet_name={0:0}, bb_errno={7:0}, bb_errno_location={7:0}, dummy_utmp={8:0}, i=8, logmode=1, msg_eol={3:0}] [L2134] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno={7:0}, bb_errno_location={7:0}, dummy_utmp={8:0}, i=9, logmode=1, msg_eol={3:0}] [L2134] COND TRUE i<10 [L2135] a[i]=__VERIFIER_nondet_char() VAL [a={-1:0}, applet_name={0:0}, bb_errno={7:0}, bb_errno_location={7:0}, dummy_utmp={8:0}, i=9, logmode=1, msg_eol={3:0}] [L2134] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno={7:0}, bb_errno_location={7:0}, dummy_utmp={8:0}, i=10, logmode=1, msg_eol={3:0}] [L2134] COND FALSE !(i<10) [L2136] applet_name = a [L2137] bb_errno_location = __VERIFIER_nondet_int() [L2138] optind = 1 [L2139] int argc = __VERIFIER_nondet_int(); [L2140] CALL assume_abort_if_not(argc >= 1 && argc <= 10000) VAL [\old(cond)=1, applet_name={-1:0}, bb_errno={7:0}, bb_errno_location={7:0}, dummy_utmp={8:0}, logmode=1, msg_eol={3:0}, optind=1] [L9] COND FALSE !(!cond) VAL [\old(cond)=1, applet_name={-1:0}, bb_errno={7:0}, bb_errno_location={7:0}, dummy_utmp={8:0}, logmode=1, msg_eol={3:0}, optind=1] [L2140] RET assume_abort_if_not(argc >= 1 && argc <= 10000) VAL [applet_name={-1:0}, argc=2, bb_errno={7:0}, bb_errno_location={7:0}, dummy_utmp={8:0}, logmode=1, msg_eol={3:0}, optind=1] [L2141] EXPR argc+1 [L2141] char **argv=malloc((argc+1)*sizeof(char*)); [L2142] EXPR argc+1 [L2142] char **mem_track=malloc((argc+1)*sizeof(char*)); [L2143] argv[argc]=0 [L2144] int i=0; VAL [applet_name={-1:0}, argc=2, argv={331:0}, bb_errno={7:0}, bb_errno_location={7:0}, dummy_utmp={8:0}, i=0, logmode=1, mem_track={-13:0}, msg_eol={3:0}, optind=1] [L2144] COND TRUE i 0 && optind < argc) VAL [\old(cond)=1, applet_name={-1:0}, bb_errno={7:0}, bb_errno_location={7:0}, dummy_utmp={8:0}, logmode=1, msg_eol={3:0}, optind=1] [L9] COND FALSE !(!cond) VAL [\old(cond)=1, applet_name={-1:0}, bb_errno={7:0}, bb_errno_location={7:0}, dummy_utmp={8:0}, logmode=1, msg_eol={3:0}, optind=1] [L2026] RET assume_abort_if_not(optind > 0 && optind < argc) VAL [applet_name={-1:0}, argc=2, argv={331:0}, bb_errno={7:0}, bb_errno_location={7:0}, dummy_utmp={8:0}, logmode=1, msg_eol={3:0}, optind=1, retval=0] [L2027] argv = argv + (signed long int)optind [L2028] EXPR \read(**argv) VAL [applet_name={-1:0}, argc=2, argv={331:8}, bb_errno={7:0}, bb_errno_location={7:0}, dummy_utmp={8:0}, logmode=1, msg_eol={3:0}, optind=1, retval=0] [L2028] COND FALSE !(*argv == ((char *)((void *)0))) [L2041] COND TRUE !(*argv == ((char *)((void *)0))) [L2032] signed int return_value_mkfifo$1; [L2033] EXPR \read(**argv) [L2033] CALL, EXPR mkfifo(*argv, mode) [L2061] \read(*file) [L2062] COND TRUE __VERIFIER_nondet_int() [L2063] *bb_errno = __VERIFIER_nondet_int() [L2064] EXPR \read(*bb_errno) VAL [applet_name={-1:0}, bb_errno={7:0}, bb_errno_location={7:0}, dummy_utmp={8:0}, logmode=1, msg_eol={3:0}, optind=1] [L2064] CALL assume_abort_if_not(*bb_errno != 0) VAL [\old(cond)=1, applet_name={-1:0}, bb_errno={7:0}, bb_errno_location={7:0}, dummy_utmp={8:0}, logmode=1, msg_eol={3:0}, optind=1] [L9] COND FALSE !(!cond) VAL [\old(cond)=1, applet_name={-1:0}, bb_errno={7:0}, bb_errno_location={7:0}, dummy_utmp={8:0}, logmode=1, msg_eol={3:0}, optind=1] [L2064] RET assume_abort_if_not(*bb_errno != 0) VAL [applet_name={-1:0}, bb_errno={7:0}, bb_errno_location={7:0}, dummy_utmp={8:0}, logmode=1, msg_eol={3:0}, optind=1] [L2065] return -1; VAL [\result=-1, applet_name={-1:0}, bb_errno={7:0}, bb_errno_location={7:0}, dummy_utmp={8:0}, logmode=1, msg_eol={3:0}, optind=1] [L2033] RET, EXPR mkfifo(*argv, mode) [L2033] return_value_mkfifo$1=mkfifo(*argv, mode) [L2034] COND TRUE return_value_mkfifo$1 < 0 [L2036] EXPR \read(**argv) [L2036] CALL bb_simple_perror_msg(*argv) [L1913] CALL bb_perror_msg("%s", s) [L1893] va_list p; [L1895] char *tmp_if_expr$2; [L1896] char *return_value_strerror$1; [L1897] EXPR \read(*bb_errno) VAL [applet_name={-1:0}, bb_errno={7:0}, bb_errno_location={7:0}, dummy_utmp={8:0}, logmode=1, msg_eol={3:0}, optind=1, p={-37:0}, s={4:0}] [L1897] COND TRUE !(*bb_errno == 0) [L1899] return_value_strerror$1=strerror(*bb_errno) [L1900] tmp_if_expr$2 = return_value_strerror$1 VAL [applet_name={-1:0}, bb_errno={7:0}, bb_errno_location={7:0}, dummy_utmp={8:0}, logmode=1, msg_eol={3:0}, optind=1, p={-37:0}, s={4:0}, tmp_if_expr$2={0:0}] [L1904] CALL bb_verror_msg(s, p, tmp_if_expr$2) [L1917] char *msg; [L1918] char *msg1; [L1919] signed int applet_len; [L1920] signed int strerr_len; [L1921] signed int msgeol_len; [L1922] signed int used; VAL [applet_name={-1:0}, bb_errno={7:0}, bb_errno_location={7:0}, dummy_utmp={8:0}, logmode=1, msg={333:0}, msg_eol={3:0}, optind=1, p={-37:0}, s={4:0}, strerr={0:0}] [L1923] COND FALSE !((signed int)logmode == 0) VAL [applet_name={-1:0}, bb_errno={7:0}, bb_errno_location={7:0}, dummy_utmp={8:0}, logmode=1, msg={333:0}, msg_eol={3:0}, optind=1, p={-37:0}, s={4:0}, strerr={0:0}] [L1925] COND FALSE !(s == ((const char *)((void *)0))) VAL [applet_name={-1:0}, bb_errno={7:0}, bb_errno_location={7:0}, dummy_utmp={8:0}, logmode=1, msg={333:0}, msg_eol={3:0}, optind=1, p={-37:0}, s={4:0}, strerr={0:0}] [L1927] CALL vasprintf(&msg, s, p) - UnprovableResult [Line: 2153]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 2153]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 2012]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 2012]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1996]: Unable to prove that there are no unsupported features in the program Unable to prove that there are no unsupported features in the program Reason: Not analyzed. - UnprovableResult [Line: 1955]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1955]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1982]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1982]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1979]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1979]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1975]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1975]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1972]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1972]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1966]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1966]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1965]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1965]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1963]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1963]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1947]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1947]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1947]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1947]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1947]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1947]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1947]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1947]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 2144]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 2144]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 2149]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 2149]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 2142]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 2142]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 2141]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 2141]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 2134]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 2134]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 153 locations, 200 edges, 40 error locations. Started 1 CEGAR loops. OverallTime: 18.5s, OverallIterations: 23, TraceHistogramMax: 20, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 229 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 222 mSDsluCounter, 3938 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2706 mSDsCounter, 27 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 696 IncrementalHoareTripleChecker+Invalid, 723 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 27 mSolverCounterUnsat, 1232 mSDtfsCounter, 696 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1346 GetRequests, 1238 SyntacticMatches, 5 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=185occurred in iteration=20, InterpolantAutomatonStates: 118, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 22 MinimizatonAttempts, 20 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 4.1s SatisfiabilityAnalysisTime, 6.5s InterpolantComputationTime, 2040 NumberOfCodeBlocks, 1788 NumberOfCodeBlocksAsserted, 38 NumberOfCheckSat, 2352 ConstructedInterpolants, 0 QuantifiedInterpolants, 7195 SizeOfPredicates, 20 NumberOfNonLiveVariables, 15354 ConjunctsInSsa, 94 ConjunctsInUnsatCore, 42 InterpolantComputations, 15 PerfectInterpolantSequences, 7786/8263 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-17 18:56:22,283 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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/busybox-1.22.0/mkfifo-incomplete-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 87580337320826adb4ecd48067cecb4358be7d27e3644fa74cf18e815c89b60b --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 18:56:24,384 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 18:56:24,471 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Bitvector.epf [2025-03-17 18:56:24,484 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 18:56:24,488 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 18:56:24,488 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2025-03-17 18:56:24,512 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 18:56:24,512 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 18:56:24,514 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 18:56:24,514 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 18:56:24,514 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 18:56:24,515 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 18:56:24,515 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 18:56:24,515 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 18:56:24,515 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 18:56:24,515 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 18:56:24,515 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 18:56:24,516 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 18:56:24,516 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 18:56:24,516 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 18:56:24,516 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 18:56:24,516 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 18:56:24,516 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 18:56:24,516 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-17 18:56:24,516 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-17 18:56:24,516 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-17 18:56:24,516 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 18:56:24,516 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 18:56:24,516 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 18:56:24,516 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 18:56:24,516 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 18:56:24,517 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 18:56:24,517 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 18:56:24,517 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 18:56:24,517 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 18:56:24,517 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 18:56:24,517 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 18:56:24,517 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 18:56:24,517 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 18:56:24,517 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-17 18:56:24,517 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-17 18:56:24,517 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 18:56:24,517 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 18:56:24,517 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 18:56:24,518 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 18:56:24,518 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 87580337320826adb4ecd48067cecb4358be7d27e3644fa74cf18e815c89b60b [2025-03-17 18:56:24,755 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 18:56:24,761 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 18:56:24,763 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 18:56:24,763 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 18:56:24,764 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 18:56:24,764 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/busybox-1.22.0/mkfifo-incomplete-2.i [2025-03-17 18:56:25,947 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1aa79d5a0/dede57a3486a4a1ea67d748224969113/FLAGcd22f1a1f [2025-03-17 18:56:26,311 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 18:56:26,311 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/mkfifo-incomplete-2.i [2025-03-17 18:56:26,351 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1aa79d5a0/dede57a3486a4a1ea67d748224969113/FLAGcd22f1a1f [2025-03-17 18:56:26,512 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1aa79d5a0/dede57a3486a4a1ea67d748224969113 [2025-03-17 18:56:26,515 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 18:56:26,516 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 18:56:26,517 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 18:56:26,517 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 18:56:26,520 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 18:56:26,521 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 06:56:26" (1/1) ... [2025-03-17 18:56:26,521 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f152af4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:56:26, skipping insertion in model container [2025-03-17 18:56:26,521 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 06:56:26" (1/1) ... [2025-03-17 18:56:26,561 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 18:56:27,091 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 18:56:27,096 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 18:56:27,099 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 18:56:27,100 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 18:56:27,103 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 18:56:27,106 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 18:56:27,108 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 18:56:27,108 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 18:56:27,109 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 18:56:27,111 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 18:56:27,112 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 18:56:27,115 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 18:56:27,116 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 18:56:27,122 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 18:56:27,124 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 18:56:27,130 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 18:56:27,140 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 18:56:27,157 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 18:56:27,198 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 18:56:27,316 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 18:56:27,528 WARN L1212 FunctionHandler]: The following functions are not defined or handled internally: vasprintf [2025-03-17 18:56:27,536 INFO L204 MainTranslator]: Completed translation [2025-03-17 18:56:27,536 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:56:27 WrapperNode [2025-03-17 18:56:27,537 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 18:56:27,538 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 18:56:27,538 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 18:56:27,538 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 18:56:27,543 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:56:27" (1/1) ... [2025-03-17 18:56:27,585 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:56:27" (1/1) ... [2025-03-17 18:56:27,635 INFO L138 Inliner]: procedures = 585, calls = 489, calls flagged for inlining = 16, calls inlined = 15, statements flattened = 767 [2025-03-17 18:56:27,636 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 18:56:27,636 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 18:56:27,636 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 18:56:27,636 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 18:56:27,643 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:56:27" (1/1) ... [2025-03-17 18:56:27,643 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:56:27" (1/1) ... [2025-03-17 18:56:27,661 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:56:27" (1/1) ... [2025-03-17 18:56:27,678 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-03-17 18:56:27,680 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:56:27" (1/1) ... [2025-03-17 18:56:27,680 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:56:27" (1/1) ... [2025-03-17 18:56:27,709 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:56:27" (1/1) ... [2025-03-17 18:56:27,715 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:56:27" (1/1) ... [2025-03-17 18:56:27,733 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:56:27" (1/1) ... [2025-03-17 18:56:27,736 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:56:27" (1/1) ... [2025-03-17 18:56:27,749 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 18:56:27,750 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 18:56:27,750 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 18:56:27,750 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 18:56:27,751 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:56:27" (1/1) ... [2025-03-17 18:56:27,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 18:56:27,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 18:56:27,780 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 18:56:27,783 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 18:56:27,805 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-17 18:56:27,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2 [2025-03-17 18:56:27,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2025-03-17 18:56:27,806 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2025-03-17 18:56:27,806 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-17 18:56:27,806 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 18:56:27,806 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-03-17 18:56:27,806 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE2 [2025-03-17 18:56:27,806 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE4 [2025-03-17 18:56:27,806 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE1 [2025-03-17 18:56:27,806 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 18:56:27,806 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 18:56:27,806 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2025-03-17 18:56:27,806 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy [2025-03-17 18:56:27,806 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy [2025-03-17 18:56:27,806 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2025-03-17 18:56:27,806 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2025-03-17 18:56:27,806 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2025-03-17 18:56:27,806 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 18:56:27,806 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 18:56:27,806 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-17 18:56:27,806 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-03-17 18:56:27,806 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2025-03-17 18:56:27,806 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2025-03-17 18:56:27,806 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2025-03-17 18:56:27,806 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2 [2025-03-17 18:56:27,806 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1 [2025-03-17 18:56:28,091 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 18:56:28,092 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 18:56:29,011 INFO L? ?]: Removed 203 outVars from TransFormulas that were not future-live. [2025-03-17 18:56:29,011 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 18:56:29,021 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 18:56:29,023 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 18:56:29,023 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 06:56:29 BoogieIcfgContainer [2025-03-17 18:56:29,023 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 18:56:29,026 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 18:56:29,026 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 18:56:29,029 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 18:56:29,030 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 06:56:26" (1/3) ... [2025-03-17 18:56:29,030 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38537dbe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 06:56:29, skipping insertion in model container [2025-03-17 18:56:29,030 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:56:27" (2/3) ... [2025-03-17 18:56:29,031 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38537dbe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 06:56:29, skipping insertion in model container [2025-03-17 18:56:29,031 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 06:56:29" (3/3) ... [2025-03-17 18:56:29,032 INFO L128 eAbstractionObserver]: Analyzing ICFG mkfifo-incomplete-2.i [2025-03-17 18:56:29,043 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 18:56:29,044 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG mkfifo-incomplete-2.i that has 3 procedures, 150 locations, 1 initial locations, 12 loop locations, and 40 error locations. [2025-03-17 18:56:29,084 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 18:56:29,098 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;@419865b1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 18:56:29,099 INFO L334 AbstractCegarLoop]: Starting to check reachability of 40 error locations. [2025-03-17 18:56:29,103 INFO L276 IsEmpty]: Start isEmpty. Operand has 150 states, 100 states have (on average 1.74) internal successors, (174), 140 states have internal predecessors, (174), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-17 18:56:29,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-03-17 18:56:29,107 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 18:56:29,107 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-03-17 18:56:29,107 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 37 more)] === [2025-03-17 18:56:29,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 18:56:29,111 INFO L85 PathProgramCache]: Analyzing trace with hash 225379, now seen corresponding path program 1 times [2025-03-17 18:56:29,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 18:56:29,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1682611465] [2025-03-17 18:56:29,125 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 18:56:29,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 18:56:29,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 18:56:29,128 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 18:56:29,133 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 18:56:29,329 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 18:56:29,721 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 18:56:29,721 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 18:56:29,721 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 18:56:29,779 INFO L256 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 18:56:29,782 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 18:56:29,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 18:56:29,787 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 18:56:29,787 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 18:56:29,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1682611465] [2025-03-17 18:56:29,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1682611465] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 18:56:29,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 18:56:29,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 18:56:29,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574934610] [2025-03-17 18:56:29,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 18:56:29,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 18:56:29,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 18:56:29,801 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 18:56:29,802 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 18:56:29,803 INFO L87 Difference]: Start difference. First operand has 150 states, 100 states have (on average 1.74) internal successors, (174), 140 states have internal predecessors, (174), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 2 states, 1 states have (on average 3.0) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 18:56:29,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 18:56:29,817 INFO L93 Difference]: Finished difference Result 197 states and 257 transitions. [2025-03-17 18:56:29,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 18:56:29,818 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 3.0) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2025-03-17 18:56:29,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 18:56:29,821 INFO L225 Difference]: With dead ends: 197 [2025-03-17 18:56:29,822 INFO L226 Difference]: Without dead ends: 51 [2025-03-17 18:56:29,824 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 18:56:29,825 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 18:56:29,826 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 18:56:29,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-03-17 18:56:29,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2025-03-17 18:56:29,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 40 states have (on average 1.425) internal successors, (57), 46 states have internal predecessors, (57), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 18:56:29,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 63 transitions. [2025-03-17 18:56:29,849 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 63 transitions. Word has length 3 [2025-03-17 18:56:29,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 18:56:29,849 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 63 transitions. [2025-03-17 18:56:29,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 3.0) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 18:56:29,849 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 63 transitions. [2025-03-17 18:56:29,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-17 18:56:29,849 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 18:56:29,850 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-17 18:56:29,872 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 18:56:30,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 18:56:30,051 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 37 more)] === [2025-03-17 18:56:30,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 18:56:30,051 INFO L85 PathProgramCache]: Analyzing trace with hash 6986911, now seen corresponding path program 1 times [2025-03-17 18:56:30,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 18:56:30,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [262190946] [2025-03-17 18:56:30,052 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 18:56:30,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 18:56:30,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 18:56:30,056 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 18:56:30,057 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 18:56:30,177 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 18:56:30,547 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 18:56:30,547 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 18:56:30,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 18:56:30,606 INFO L256 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 18:56:30,607 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 18:56:30,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 18:56:30,624 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 18:56:30,624 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 18:56:30,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [262190946] [2025-03-17 18:56:30,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [262190946] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 18:56:30,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 18:56:30,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 18:56:30,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330159609] [2025-03-17 18:56:30,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 18:56:30,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 18:56:30,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 18:56:30,625 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 18:56:30,625 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 18:56:30,625 INFO L87 Difference]: Start difference. First operand 51 states and 63 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 18:56:30,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 18:56:30,662 INFO L93 Difference]: Finished difference Result 101 states and 125 transitions. [2025-03-17 18:56:30,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 18:56:30,663 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2025-03-17 18:56:30,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 18:56:30,663 INFO L225 Difference]: With dead ends: 101 [2025-03-17 18:56:30,664 INFO L226 Difference]: Without dead ends: 54 [2025-03-17 18:56:30,664 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-17 18:56:30,665 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 0 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 18:56:30,665 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 117 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 18:56:30,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2025-03-17 18:56:30,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2025-03-17 18:56:30,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 43 states have (on average 1.3953488372093024) internal successors, (60), 49 states have internal predecessors, (60), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 18:56:30,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 66 transitions. [2025-03-17 18:56:30,673 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 66 transitions. Word has length 4 [2025-03-17 18:56:30,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 18:56:30,673 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 66 transitions. [2025-03-17 18:56:30,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 18:56:30,674 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 66 transitions. [2025-03-17 18:56:30,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-17 18:56:30,674 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 18:56:30,674 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1] [2025-03-17 18:56:30,719 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-17 18:56:30,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 18:56:30,875 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 37 more)] === [2025-03-17 18:56:30,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 18:56:30,875 INFO L85 PathProgramCache]: Analyzing trace with hash 1988800165, now seen corresponding path program 1 times [2025-03-17 18:56:30,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 18:56:30,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1765808853] [2025-03-17 18:56:30,876 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 18:56:30,876 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 18:56:30,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 18:56:30,879 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 18:56:30,880 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 18:56:30,994 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 18:56:31,377 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 18:56:31,377 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 18:56:31,377 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 18:56:31,453 INFO L256 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 18:56:31,454 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 18:56:31,476 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 18:56:31,477 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 18:56:31,510 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 18:56:31,510 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 18:56:31,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1765808853] [2025-03-17 18:56:31,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1765808853] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 18:56:31,510 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 18:56:31,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2] total 4 [2025-03-17 18:56:31,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920409596] [2025-03-17 18:56:31,511 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 18:56:31,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 18:56:31,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 18:56:31,512 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 18:56:31,512 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-17 18:56:31,512 INFO L87 Difference]: Start difference. First operand 54 states and 66 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 18:56:31,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 18:56:31,646 INFO L93 Difference]: Finished difference Result 104 states and 130 transitions. [2025-03-17 18:56:31,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 18:56:31,647 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-03-17 18:56:31,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 18:56:31,647 INFO L225 Difference]: With dead ends: 104 [2025-03-17 18:56:31,647 INFO L226 Difference]: Without dead ends: 57 [2025-03-17 18:56:31,648 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2025-03-17 18:56:31,648 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 0 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 18:56:31,648 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 172 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 18:56:31,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-03-17 18:56:31,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 54. [2025-03-17 18:56:31,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 44 states have (on average 1.3636363636363635) internal successors, (60), 49 states have internal predecessors, (60), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 18:56:31,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 66 transitions. [2025-03-17 18:56:31,653 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 66 transitions. Word has length 7 [2025-03-17 18:56:31,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 18:56:31,653 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 66 transitions. [2025-03-17 18:56:31,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 18:56:31,654 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 66 transitions. [2025-03-17 18:56:31,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-17 18:56:31,654 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 18:56:31,654 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 18:56:31,691 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-17 18:56:31,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 18:56:31,855 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 37 more)] === [2025-03-17 18:56:31,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 18:56:31,855 INFO L85 PathProgramCache]: Analyzing trace with hash -367823673, now seen corresponding path program 1 times [2025-03-17 18:56:31,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 18:56:31,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [52502939] [2025-03-17 18:56:31,856 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 18:56:31,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 18:56:31,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 18:56:31,858 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 18:56:31,858 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-17 18:56:31,962 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-17 18:56:32,363 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-17 18:56:32,363 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 18:56:32,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 18:56:32,435 INFO L256 TraceCheckSpWp]: Trace formula consists of 465 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 18:56:32,436 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 18:56:32,482 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-17 18:56:32,482 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 18:56:32,482 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 18:56:32,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [52502939] [2025-03-17 18:56:32,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [52502939] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 18:56:32,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 18:56:32,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 18:56:32,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810003519] [2025-03-17 18:56:32,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 18:56:32,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 18:56:32,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 18:56:32,483 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 18:56:32,483 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 18:56:32,484 INFO L87 Difference]: Start difference. First operand 54 states and 66 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 18:56:32,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 18:56:32,706 INFO L93 Difference]: Finished difference Result 54 states and 66 transitions. [2025-03-17 18:56:32,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 18:56:32,706 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2025-03-17 18:56:32,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 18:56:32,707 INFO L225 Difference]: With dead ends: 54 [2025-03-17 18:56:32,707 INFO L226 Difference]: Without dead ends: 52 [2025-03-17 18:56:32,707 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 18:56:32,707 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 45 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 18:56:32,708 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 146 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 18:56:32,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2025-03-17 18:56:32,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2025-03-17 18:56:32,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 44 states have (on average 1.3181818181818181) internal successors, (58), 47 states have internal predecessors, (58), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 18:56:32,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 64 transitions. [2025-03-17 18:56:32,711 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 64 transitions. Word has length 15 [2025-03-17 18:56:32,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 18:56:32,712 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 64 transitions. [2025-03-17 18:56:32,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 18:56:32,712 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 64 transitions. [2025-03-17 18:56:32,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-17 18:56:32,713 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 18:56:32,713 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 18:56:32,737 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-17 18:56:32,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 18:56:32,914 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 37 more)] === [2025-03-17 18:56:32,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 18:56:32,914 INFO L85 PathProgramCache]: Analyzing trace with hash 1360245090, now seen corresponding path program 1 times [2025-03-17 18:56:32,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 18:56:32,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1938734909] [2025-03-17 18:56:32,915 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 18:56:32,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 18:56:32,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 18:56:32,916 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 18:56:32,917 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-17 18:56:33,051 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-17 18:56:33,468 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-17 18:56:33,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 18:56:33,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 18:56:33,538 INFO L256 TraceCheckSpWp]: Trace formula consists of 539 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 18:56:33,539 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 18:56:33,548 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-17 18:56:33,548 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 18:56:33,548 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 18:56:33,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1938734909] [2025-03-17 18:56:33,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1938734909] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 18:56:33,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 18:56:33,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 18:56:33,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666978897] [2025-03-17 18:56:33,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 18:56:33,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 18:56:33,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 18:56:33,549 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 18:56:33,549 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 18:56:33,549 INFO L87 Difference]: Start difference. First operand 52 states and 64 transitions. Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 18:56:33,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 18:56:33,619 INFO L93 Difference]: Finished difference Result 94 states and 118 transitions. [2025-03-17 18:56:33,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 18:56:33,619 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2025-03-17 18:56:33,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 18:56:33,620 INFO L225 Difference]: With dead ends: 94 [2025-03-17 18:56:33,620 INFO L226 Difference]: Without dead ends: 55 [2025-03-17 18:56:33,620 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 18:56:33,621 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 0 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 18:56:33,621 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 110 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 18:56:33,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2025-03-17 18:56:33,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2025-03-17 18:56:33,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 47 states have (on average 1.297872340425532) internal successors, (61), 50 states have internal predecessors, (61), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 18:56:33,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 67 transitions. [2025-03-17 18:56:33,624 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 67 transitions. Word has length 21 [2025-03-17 18:56:33,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 18:56:33,625 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 67 transitions. [2025-03-17 18:56:33,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 18:56:33,625 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 67 transitions. [2025-03-17 18:56:33,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-17 18:56:33,625 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 18:56:33,625 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 18:56:33,649 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-17 18:56:33,826 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 [2025-03-17 18:56:33,826 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 37 more)] === [2025-03-17 18:56:33,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 18:56:33,826 INFO L85 PathProgramCache]: Analyzing trace with hash 45187314, now seen corresponding path program 1 times [2025-03-17 18:56:33,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 18:56:33,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1991913703] [2025-03-17 18:56:33,827 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 18:56:33,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 18:56:33,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 18:56:33,829 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 18:56:33,829 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-17 18:56:33,943 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-17 18:56:34,415 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-17 18:56:34,415 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 18:56:34,415 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 18:56:34,481 INFO L256 TraceCheckSpWp]: Trace formula consists of 554 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 18:56:34,482 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 18:56:34,498 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-17 18:56:34,498 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 18:56:34,529 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-17 18:56:34,529 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 18:56:34,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1991913703] [2025-03-17 18:56:34,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1991913703] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 18:56:34,529 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 18:56:34,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2025-03-17 18:56:34,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685635255] [2025-03-17 18:56:34,529 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 18:56:34,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 18:56:34,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 18:56:34,530 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 18:56:34,530 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-17 18:56:34,530 INFO L87 Difference]: Start difference. First operand 55 states and 67 transitions. Second operand has 6 states, 5 states have (on average 5.2) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 18:56:34,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 18:56:34,675 INFO L93 Difference]: Finished difference Result 100 states and 126 transitions. [2025-03-17 18:56:34,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 18:56:34,676 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2025-03-17 18:56:34,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 18:56:34,676 INFO L225 Difference]: With dead ends: 100 [2025-03-17 18:56:34,677 INFO L226 Difference]: Without dead ends: 58 [2025-03-17 18:56:34,677 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2025-03-17 18:56:34,677 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 0 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 18:56:34,677 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 161 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 18:56:34,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2025-03-17 18:56:34,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 55. [2025-03-17 18:56:34,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 48 states have (on average 1.2708333333333333) internal successors, (61), 50 states have internal predecessors, (61), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 18:56:34,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 67 transitions. [2025-03-17 18:56:34,681 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 67 transitions. Word has length 24 [2025-03-17 18:56:34,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 18:56:34,681 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 67 transitions. [2025-03-17 18:56:34,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 18:56:34,681 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 67 transitions. [2025-03-17 18:56:34,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-17 18:56:34,682 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 18:56:34,682 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 18:56:34,711 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-17 18:56:34,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 18:56:34,883 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 37 more)] === [2025-03-17 18:56:34,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 18:56:34,883 INFO L85 PathProgramCache]: Analyzing trace with hash 1850651645, now seen corresponding path program 1 times [2025-03-17 18:56:34,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 18:56:34,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1351685918] [2025-03-17 18:56:34,884 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 18:56:34,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 18:56:34,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 18:56:34,886 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 18:56:34,887 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-17 18:56:34,991 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-17 18:56:35,395 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-17 18:56:35,395 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 18:56:35,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 18:56:35,461 INFO L256 TraceCheckSpWp]: Trace formula consists of 558 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 18:56:35,472 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 18:56:35,491 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-17 18:56:35,491 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 18:56:35,491 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 18:56:35,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1351685918] [2025-03-17 18:56:35,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1351685918] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 18:56:35,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 18:56:35,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 18:56:35,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519421156] [2025-03-17 18:56:35,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 18:56:35,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 18:56:35,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 18:56:35,492 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 18:56:35,492 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 18:56:35,493 INFO L87 Difference]: Start difference. First operand 55 states and 67 transitions. Second operand has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 18:56:35,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 18:56:35,619 INFO L93 Difference]: Finished difference Result 66 states and 80 transitions. [2025-03-17 18:56:35,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 18:56:35,620 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2025-03-17 18:56:35,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 18:56:35,621 INFO L225 Difference]: With dead ends: 66 [2025-03-17 18:56:35,621 INFO L226 Difference]: Without dead ends: 65 [2025-03-17 18:56:35,621 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 18:56:35,621 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 0 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 18:56:35,622 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 105 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 18:56:35,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2025-03-17 18:56:35,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2025-03-17 18:56:35,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 58 states have (on average 1.2586206896551724) internal successors, (73), 60 states have internal predecessors, (73), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 18:56:35,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 79 transitions. [2025-03-17 18:56:35,626 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 79 transitions. Word has length 27 [2025-03-17 18:56:35,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 18:56:35,626 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 79 transitions. [2025-03-17 18:56:35,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 18:56:35,626 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 79 transitions. [2025-03-17 18:56:35,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-17 18:56:35,627 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 18:56:35,627 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 18:56:35,653 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-17 18:56:35,827 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 18:56:35,828 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 37 more)] === [2025-03-17 18:56:35,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 18:56:35,828 INFO L85 PathProgramCache]: Analyzing trace with hash 219887221, now seen corresponding path program 1 times [2025-03-17 18:56:35,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 18:56:35,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1219474882] [2025-03-17 18:56:35,829 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 18:56:35,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 18:56:35,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 18:56:35,831 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 18:56:35,832 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-17 18:56:35,940 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-17 18:56:36,353 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-17 18:56:36,353 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 18:56:36,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 18:56:36,416 INFO L256 TraceCheckSpWp]: Trace formula consists of 524 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 18:56:36,417 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 18:56:36,432 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-17 18:56:36,432 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 18:56:36,432 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 18:56:36,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1219474882] [2025-03-17 18:56:36,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1219474882] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 18:56:36,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 18:56:36,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 18:56:36,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75392866] [2025-03-17 18:56:36,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 18:56:36,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 18:56:36,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 18:56:36,433 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 18:56:36,433 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 18:56:36,433 INFO L87 Difference]: Start difference. First operand 65 states and 79 transitions. Second operand has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 18:56:36,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 18:56:36,491 INFO L93 Difference]: Finished difference Result 69 states and 83 transitions. [2025-03-17 18:56:36,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 18:56:36,492 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 29 [2025-03-17 18:56:36,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 18:56:36,492 INFO L225 Difference]: With dead ends: 69 [2025-03-17 18:56:36,492 INFO L226 Difference]: Without dead ends: 68 [2025-03-17 18:56:36,493 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 18:56:36,493 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 0 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 18:56:36,493 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 109 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 18:56:36,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2025-03-17 18:56:36,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2025-03-17 18:56:36,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 61 states have (on average 1.2459016393442623) internal successors, (76), 63 states have internal predecessors, (76), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 18:56:36,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 82 transitions. [2025-03-17 18:56:36,498 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 82 transitions. Word has length 29 [2025-03-17 18:56:36,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 18:56:36,498 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 82 transitions. [2025-03-17 18:56:36,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 18:56:36,498 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 82 transitions. [2025-03-17 18:56:36,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-03-17 18:56:36,498 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 18:56:36,498 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 18:56:36,525 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-17 18:56:36,699 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 [2025-03-17 18:56:36,699 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 37 more)] === [2025-03-17 18:56:36,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 18:56:36,700 INFO L85 PathProgramCache]: Analyzing trace with hash 835061436, now seen corresponding path program 1 times [2025-03-17 18:56:36,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 18:56:36,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1483095660] [2025-03-17 18:56:36,700 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 18:56:36,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 18:56:36,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 18:56:36,702 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 18:56:36,704 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-17 18:56:36,823 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-17 18:56:37,245 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-17 18:56:37,246 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 18:56:37,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 18:56:37,311 INFO L256 TraceCheckSpWp]: Trace formula consists of 532 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 18:56:37,312 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 18:56:37,330 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-17 18:56:37,330 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 18:56:37,357 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-17 18:56:37,358 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 18:56:37,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1483095660] [2025-03-17 18:56:37,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1483095660] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 18:56:37,358 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 18:56:37,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2025-03-17 18:56:37,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912335194] [2025-03-17 18:56:37,358 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 18:56:37,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 18:56:37,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 18:56:37,359 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 18:56:37,359 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-17 18:56:37,359 INFO L87 Difference]: Start difference. First operand 68 states and 82 transitions. Second operand has 6 states, 5 states have (on average 5.8) internal successors, (29), 6 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 18:56:37,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 18:56:37,478 INFO L93 Difference]: Finished difference Result 75 states and 91 transitions. [2025-03-17 18:56:37,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 18:56:37,479 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.8) internal successors, (29), 6 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 32 [2025-03-17 18:56:37,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 18:56:37,479 INFO L225 Difference]: With dead ends: 75 [2025-03-17 18:56:37,479 INFO L226 Difference]: Without dead ends: 59 [2025-03-17 18:56:37,480 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2025-03-17 18:56:37,480 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 0 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 18:56:37,480 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 267 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 18:56:37,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2025-03-17 18:56:37,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2025-03-17 18:56:37,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 53 states have (on average 1.2264150943396226) internal successors, (65), 54 states have internal predecessors, (65), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 18:56:37,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 71 transitions. [2025-03-17 18:56:37,484 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 71 transitions. Word has length 32 [2025-03-17 18:56:37,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 18:56:37,485 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 71 transitions. [2025-03-17 18:56:37,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.8) internal successors, (29), 6 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 18:56:37,485 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 71 transitions. [2025-03-17 18:56:37,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-17 18:56:37,485 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 18:56:37,485 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 18:56:37,513 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-17 18:56:37,686 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 [2025-03-17 18:56:37,686 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 37 more)] === [2025-03-17 18:56:37,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 18:56:37,686 INFO L85 PathProgramCache]: Analyzing trace with hash 757921707, now seen corresponding path program 1 times [2025-03-17 18:56:37,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 18:56:37,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1119082426] [2025-03-17 18:56:37,687 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 18:56:37,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 18:56:37,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 18:56:37,690 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 18:56:37,691 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-17 18:56:37,822 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-17 18:56:38,212 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-17 18:56:38,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 18:56:38,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 18:56:38,274 INFO L256 TraceCheckSpWp]: Trace formula consists of 592 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 18:56:38,275 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 18:56:38,288 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-17 18:56:38,288 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 18:56:38,288 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 18:56:38,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1119082426] [2025-03-17 18:56:38,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1119082426] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 18:56:38,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 18:56:38,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 18:56:38,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496599834] [2025-03-17 18:56:38,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 18:56:38,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 18:56:38,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 18:56:38,288 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 18:56:38,289 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 18:56:38,289 INFO L87 Difference]: Start difference. First operand 59 states and 71 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 18:56:38,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 18:56:38,301 INFO L93 Difference]: Finished difference Result 62 states and 73 transitions. [2025-03-17 18:56:38,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 18:56:38,301 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 35 [2025-03-17 18:56:38,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 18:56:38,302 INFO L225 Difference]: With dead ends: 62 [2025-03-17 18:56:38,302 INFO L226 Difference]: Without dead ends: 59 [2025-03-17 18:56:38,302 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 18:56:38,302 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 8 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 18:56:38,302 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 130 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 18:56:38,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2025-03-17 18:56:38,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2025-03-17 18:56:38,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 53 states have (on average 1.2075471698113207) internal successors, (64), 54 states have internal predecessors, (64), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 18:56:38,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 70 transitions. [2025-03-17 18:56:38,306 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 70 transitions. Word has length 35 [2025-03-17 18:56:38,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 18:56:38,306 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 70 transitions. [2025-03-17 18:56:38,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 18:56:38,306 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 70 transitions. [2025-03-17 18:56:38,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-17 18:56:38,307 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 18:56:38,307 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 18:56:38,329 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-17 18:56:38,507 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 18:56:38,507 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 37 more)] === [2025-03-17 18:56:38,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 18:56:38,508 INFO L85 PathProgramCache]: Analyzing trace with hash 757922668, now seen corresponding path program 1 times [2025-03-17 18:56:38,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 18:56:38,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1563333566] [2025-03-17 18:56:38,508 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 18:56:38,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 18:56:38,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 18:56:38,510 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 18:56:38,511 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-17 18:56:38,625 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-17 18:56:39,016 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-17 18:56:39,016 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 18:56:39,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 18:56:39,079 INFO L256 TraceCheckSpWp]: Trace formula consists of 589 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 18:56:39,080 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 18:56:39,091 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-17 18:56:39,091 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 18:56:39,092 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 18:56:39,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1563333566] [2025-03-17 18:56:39,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1563333566] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 18:56:39,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 18:56:39,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 18:56:39,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711403394] [2025-03-17 18:56:39,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 18:56:39,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 18:56:39,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 18:56:39,093 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 18:56:39,093 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 18:56:39,093 INFO L87 Difference]: Start difference. First operand 59 states and 70 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 18:56:39,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 18:56:39,112 INFO L93 Difference]: Finished difference Result 83 states and 99 transitions. [2025-03-17 18:56:39,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 18:56:39,113 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 35 [2025-03-17 18:56:39,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 18:56:39,114 INFO L225 Difference]: With dead ends: 83 [2025-03-17 18:56:39,114 INFO L226 Difference]: Without dead ends: 61 [2025-03-17 18:56:39,114 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 18:56:39,114 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 0 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 18:56:39,114 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 137 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 18:56:39,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2025-03-17 18:56:39,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2025-03-17 18:56:39,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 55 states have (on average 1.2) internal successors, (66), 56 states have internal predecessors, (66), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 18:56:39,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 72 transitions. [2025-03-17 18:56:39,118 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 72 transitions. Word has length 35 [2025-03-17 18:56:39,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 18:56:39,118 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 72 transitions. [2025-03-17 18:56:39,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 18:56:39,118 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 72 transitions. [2025-03-17 18:56:39,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-17 18:56:39,119 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 18:56:39,119 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 18:56:39,144 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-17 18:56:39,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 18:56:39,320 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 37 more)] === [2025-03-17 18:56:39,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 18:56:39,320 INFO L85 PathProgramCache]: Analyzing trace with hash -1390989387, now seen corresponding path program 1 times [2025-03-17 18:56:39,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 18:56:39,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [256402794] [2025-03-17 18:56:39,321 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 18:56:39,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 18:56:39,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 18:56:39,322 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 18:56:39,324 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-17 18:56:39,437 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-17 18:56:39,958 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-17 18:56:39,958 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 18:56:39,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 18:56:40,034 INFO L256 TraceCheckSpWp]: Trace formula consists of 624 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 18:56:40,036 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 18:56:40,084 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-17 18:56:40,084 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 18:56:40,140 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-17 18:56:40,140 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 18:56:40,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [256402794] [2025-03-17 18:56:40,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [256402794] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 18:56:40,141 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 18:56:40,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2025-03-17 18:56:40,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918221391] [2025-03-17 18:56:40,141 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 18:56:40,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 18:56:40,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 18:56:40,141 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 18:56:40,142 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-17 18:56:40,142 INFO L87 Difference]: Start difference. First operand 61 states and 72 transitions. Second operand has 6 states, 5 states have (on average 8.2) internal successors, (41), 6 states have internal predecessors, (41), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 18:56:40,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 18:56:40,411 INFO L93 Difference]: Finished difference Result 82 states and 100 transitions. [2025-03-17 18:56:40,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 18:56:40,412 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.2) internal successors, (41), 6 states have internal predecessors, (41), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 37 [2025-03-17 18:56:40,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 18:56:40,413 INFO L225 Difference]: With dead ends: 82 [2025-03-17 18:56:40,413 INFO L226 Difference]: Without dead ends: 81 [2025-03-17 18:56:40,414 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2025-03-17 18:56:40,414 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 0 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 18:56:40,414 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 173 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 18:56:40,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-03-17 18:56:40,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 50. [2025-03-17 18:56:40,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 45 states have (on average 1.1777777777777778) internal successors, (53), 45 states have internal predecessors, (53), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 18:56:40,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 59 transitions. [2025-03-17 18:56:40,421 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 59 transitions. Word has length 37 [2025-03-17 18:56:40,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 18:56:40,422 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 59 transitions. [2025-03-17 18:56:40,422 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.2) internal successors, (41), 6 states have internal predecessors, (41), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 18:56:40,422 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 59 transitions. [2025-03-17 18:56:40,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-17 18:56:40,423 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 18:56:40,423 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 18:56:40,453 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-03-17 18:56:40,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 18:56:40,624 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 37 more)] === [2025-03-17 18:56:40,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 18:56:40,624 INFO L85 PathProgramCache]: Analyzing trace with hash 340889517, now seen corresponding path program 1 times [2025-03-17 18:56:40,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 18:56:40,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1767586143] [2025-03-17 18:56:40,625 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 18:56:40,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 18:56:40,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 18:56:40,627 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 18:56:40,629 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-17 18:56:40,752 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-17 18:56:41,150 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-17 18:56:41,151 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 18:56:41,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 18:56:41,216 INFO L256 TraceCheckSpWp]: Trace formula consists of 606 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 18:56:41,217 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 18:56:41,266 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-17 18:56:41,266 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 18:56:41,266 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 18:56:41,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1767586143] [2025-03-17 18:56:41,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1767586143] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 18:56:41,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 18:56:41,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 18:56:41,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349282812] [2025-03-17 18:56:41,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 18:56:41,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 18:56:41,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 18:56:41,267 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 18:56:41,267 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 18:56:41,267 INFO L87 Difference]: Start difference. First operand 50 states and 59 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-17 18:56:41,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 18:56:41,522 INFO L93 Difference]: Finished difference Result 87 states and 103 transitions. [2025-03-17 18:56:41,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 18:56:41,523 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 41 [2025-03-17 18:56:41,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 18:56:41,523 INFO L225 Difference]: With dead ends: 87 [2025-03-17 18:56:41,523 INFO L226 Difference]: Without dead ends: 60 [2025-03-17 18:56:41,523 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 18:56:41,524 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 38 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 18:56:41,524 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 141 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 18:56:41,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2025-03-17 18:56:41,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 51. [2025-03-17 18:56:41,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 46 states have (on average 1.173913043478261) internal successors, (54), 46 states have internal predecessors, (54), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 18:56:41,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 60 transitions. [2025-03-17 18:56:41,530 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 60 transitions. Word has length 41 [2025-03-17 18:56:41,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 18:56:41,530 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 60 transitions. [2025-03-17 18:56:41,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-17 18:56:41,530 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 60 transitions. [2025-03-17 18:56:41,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-17 18:56:41,531 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 18:56:41,531 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 18:56:41,559 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-03-17 18:56:41,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 18:56:41,732 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 37 more)] === [2025-03-17 18:56:41,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 18:56:41,733 INFO L85 PathProgramCache]: Analyzing trace with hash -690280091, now seen corresponding path program 1 times [2025-03-17 18:56:41,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 18:56:41,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2122733447] [2025-03-17 18:56:41,734 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 18:56:41,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 18:56:41,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 18:56:41,736 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 18:56:41,737 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-17 18:56:41,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-17 18:56:42,362 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-17 18:56:42,362 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 18:56:42,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 18:56:42,432 INFO L256 TraceCheckSpWp]: Trace formula consists of 672 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 18:56:42,434 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 18:56:42,452 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-17 18:56:42,452 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 18:56:42,488 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-17 18:56:42,488 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 18:56:42,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2122733447] [2025-03-17 18:56:42,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2122733447] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 18:56:42,488 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 18:56:42,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 8 [2025-03-17 18:56:42,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051452733] [2025-03-17 18:56:42,488 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 18:56:42,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 18:56:42,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 18:56:42,489 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 18:56:42,489 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-17 18:56:42,489 INFO L87 Difference]: Start difference. First operand 51 states and 60 transitions. Second operand has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-17 18:56:42,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 18:56:42,621 INFO L93 Difference]: Finished difference Result 106 states and 127 transitions. [2025-03-17 18:56:42,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 18:56:42,622 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 51 [2025-03-17 18:56:42,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 18:56:42,623 INFO L225 Difference]: With dead ends: 106 [2025-03-17 18:56:42,623 INFO L226 Difference]: Without dead ends: 63 [2025-03-17 18:56:42,623 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2025-03-17 18:56:42,623 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 10 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 18:56:42,623 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 222 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 18:56:42,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2025-03-17 18:56:42,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2025-03-17 18:56:42,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 58 states have (on average 1.1379310344827587) internal successors, (66), 58 states have internal predecessors, (66), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 18:56:42,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 72 transitions. [2025-03-17 18:56:42,627 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 72 transitions. Word has length 51 [2025-03-17 18:56:42,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 18:56:42,627 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 72 transitions. [2025-03-17 18:56:42,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-17 18:56:42,627 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 72 transitions. [2025-03-17 18:56:42,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-17 18:56:42,627 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 18:56:42,627 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 18:56:42,660 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-03-17 18:56:42,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 18:56:42,828 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 37 more)] === [2025-03-17 18:56:42,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 18:56:42,828 INFO L85 PathProgramCache]: Analyzing trace with hash 201151717, now seen corresponding path program 2 times [2025-03-17 18:56:42,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 18:56:42,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1982829376] [2025-03-17 18:56:42,829 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 18:56:42,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 18:56:42,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 18:56:42,832 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 18:56:42,833 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-17 18:56:42,978 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 63 statements into 2 equivalence classes. [2025-03-17 18:56:43,739 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 63 of 63 statements. [2025-03-17 18:56:43,739 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 18:56:43,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 18:56:43,825 INFO L256 TraceCheckSpWp]: Trace formula consists of 724 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 18:56:43,827 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 18:56:43,859 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-17 18:56:43,860 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 18:56:43,902 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2025-03-17 18:56:43,902 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 18:56:43,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1982829376] [2025-03-17 18:56:43,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1982829376] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 18:56:43,902 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 18:56:43,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2025-03-17 18:56:43,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080889795] [2025-03-17 18:56:43,903 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 18:56:43,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 18:56:43,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 18:56:43,904 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 18:56:43,904 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-17 18:56:43,904 INFO L87 Difference]: Start difference. First operand 63 states and 72 transitions. Second operand has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-17 18:56:44,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 18:56:44,163 INFO L93 Difference]: Finished difference Result 112 states and 132 transitions. [2025-03-17 18:56:44,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 18:56:44,167 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 63 [2025-03-17 18:56:44,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 18:56:44,168 INFO L225 Difference]: With dead ends: 112 [2025-03-17 18:56:44,168 INFO L226 Difference]: Without dead ends: 75 [2025-03-17 18:56:44,169 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2025-03-17 18:56:44,169 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 8 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 18:56:44,169 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 218 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 18:56:44,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-03-17 18:56:44,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2025-03-17 18:56:44,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 70 states have (on average 1.1142857142857143) internal successors, (78), 70 states have internal predecessors, (78), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 18:56:44,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 84 transitions. [2025-03-17 18:56:44,174 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 84 transitions. Word has length 63 [2025-03-17 18:56:44,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 18:56:44,174 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 84 transitions. [2025-03-17 18:56:44,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-17 18:56:44,175 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 84 transitions. [2025-03-17 18:56:44,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-17 18:56:44,175 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 18:56:44,176 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 18:56:44,205 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-03-17 18:56:44,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 18:56:44,376 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 37 more)] === [2025-03-17 18:56:44,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 18:56:44,377 INFO L85 PathProgramCache]: Analyzing trace with hash -105856795, now seen corresponding path program 3 times [2025-03-17 18:56:44,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 18:56:44,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1927747517] [2025-03-17 18:56:44,377 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 18:56:44,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 18:56:44,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 18:56:44,379 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 18:56:44,380 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-03-17 18:56:44,530 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 75 statements into 10 equivalence classes. [2025-03-17 18:56:47,869 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 48 of 75 statements. [2025-03-17 18:56:47,869 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-17 18:56:47,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 18:56:47,943 INFO L256 TraceCheckSpWp]: Trace formula consists of 655 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-17 18:56:47,946 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 18:56:48,154 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2025-03-17 18:56:48,154 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 18:56:48,235 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 18:56:48,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1927747517] [2025-03-17 18:56:48,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1927747517] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 18:56:48,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1943066378] [2025-03-17 18:56:48,235 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 18:56:48,235 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-17 18:56:48,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-17 18:56:48,248 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-17 18:56:48,250 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (18)] Waiting until timeout for monitored process [2025-03-17 18:56:48,492 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 75 statements into 10 equivalence classes. [2025-03-17 18:57:19,819 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 48 of 75 statements. [2025-03-17 18:57:19,819 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-17 18:57:19,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 18:57:19,887 INFO L256 TraceCheckSpWp]: Trace formula consists of 655 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-17 18:57:19,890 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 18:57:20,029 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2025-03-17 18:57:20,029 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 18:57:20,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1943066378] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 18:57:20,048 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 18:57:20,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2025-03-17 18:57:20,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091432501] [2025-03-17 18:57:20,048 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 18:57:20,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 18:57:20,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 18:57:20,048 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 18:57:20,048 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-17 18:57:20,048 INFO L87 Difference]: Start difference. First operand 75 states and 84 transitions. Second operand has 8 states, 7 states have (on average 5.142857142857143) internal successors, (36), 8 states have internal predecessors, (36), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 18:57:20,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 18:57:20,543 INFO L93 Difference]: Finished difference Result 145 states and 162 transitions. [2025-03-17 18:57:20,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 18:57:20,544 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.142857142857143) internal successors, (36), 8 states have internal predecessors, (36), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 75 [2025-03-17 18:57:20,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 18:57:20,544 INFO L225 Difference]: With dead ends: 145 [2025-03-17 18:57:20,545 INFO L226 Difference]: Without dead ends: 118 [2025-03-17 18:57:20,545 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 178 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-03-17 18:57:20,545 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 45 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 18:57:20,545 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 215 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 18:57:20,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2025-03-17 18:57:20,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 97. [2025-03-17 18:57:20,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 92 states have (on average 1.0978260869565217) internal successors, (101), 92 states have internal predecessors, (101), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 18:57:20,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 107 transitions. [2025-03-17 18:57:20,555 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 107 transitions. Word has length 75 [2025-03-17 18:57:20,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 18:57:20,555 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 107 transitions. [2025-03-17 18:57:20,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.142857142857143) internal successors, (36), 8 states have internal predecessors, (36), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 18:57:20,555 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 107 transitions. [2025-03-17 18:57:20,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-17 18:57:20,556 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 18:57:20,556 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 6, 6, 6, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 18:57:20,591 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-03-17 18:57:20,795 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (18)] Ended with exit code 0 [2025-03-17 18:57:20,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2025-03-17 18:57:20,957 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 37 more)] === [2025-03-17 18:57:20,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 18:57:20,957 INFO L85 PathProgramCache]: Analyzing trace with hash -515781475, now seen corresponding path program 4 times [2025-03-17 18:57:20,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 18:57:20,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [896385672] [2025-03-17 18:57:20,958 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 18:57:20,958 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 18:57:20,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 18:57:20,960 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 18:57:20,962 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-03-17 18:57:21,136 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 97 statements into 2 equivalence classes.