./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/busybox-1.22.0/logname-1.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/busybox-1.22.0/logname-1.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 c974ed4f1d4c3d5b838cbfadb19eec8f0977d5398d9ade006a615b896bd7b5af --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 05:52:50,713 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 05:52:50,772 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-03-09 05:52:50,777 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 05:52:50,779 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 05:52:50,797 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 05:52:50,797 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 05:52:50,797 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 05:52:50,798 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 05:52:50,798 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 05:52:50,798 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 05:52:50,798 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 05:52:50,798 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 05:52:50,798 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 05:52:50,798 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 05:52:50,799 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 05:52:50,799 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-09 05:52:50,799 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 05:52:50,799 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 05:52:50,799 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-09 05:52:50,799 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 05:52:50,799 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-09 05:52:50,799 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-09 05:52:50,799 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 05:52:50,800 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-09 05:52:50,800 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 05:52:50,800 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 05:52:50,800 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 05:52:50,800 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 05:52:50,800 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 05:52:50,800 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 05:52:50,800 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 05:52:50,801 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 05:52:50,801 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 05:52:50,801 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-09 05:52:50,801 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-09 05:52:50,801 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 05:52:50,801 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 05:52:50,801 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 05:52:50,801 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 05:52:50,801 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 05:52:50,801 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 05:52:50,801 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 -> c974ed4f1d4c3d5b838cbfadb19eec8f0977d5398d9ade006a615b896bd7b5af [2025-03-09 05:52:51,039 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 05:52:51,045 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 05:52:51,046 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 05:52:51,047 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 05:52:51,047 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 05:52:51,050 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/busybox-1.22.0/logname-1.i [2025-03-09 05:52:52,152 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/23bcec2a1/86c19bfec51b4fb8993458381d40cf3d/FLAG0ef867ade [2025-03-09 05:52:52,477 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 05:52:52,479 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/logname-1.i [2025-03-09 05:52:52,503 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/23bcec2a1/86c19bfec51b4fb8993458381d40cf3d/FLAG0ef867ade [2025-03-09 05:52:52,514 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/23bcec2a1/86c19bfec51b4fb8993458381d40cf3d [2025-03-09 05:52:52,516 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 05:52:52,517 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 05:52:52,517 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 05:52:52,518 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 05:52:52,521 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 05:52:52,521 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 05:52:52" (1/1) ... [2025-03-09 05:52:52,522 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b0784e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:52:52, skipping insertion in model container [2025-03-09 05:52:52,522 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 05:52:52" (1/1) ... [2025-03-09 05:52:52,568 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 05:52:53,132 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 05:52:53,156 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 05:52:53,239 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 05:52:53,328 WARN L1212 FunctionHandler]: The following functions are not defined or handled internally: vasprintf [2025-03-09 05:52:53,335 INFO L204 MainTranslator]: Completed translation [2025-03-09 05:52:53,336 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:52:53 WrapperNode [2025-03-09 05:52:53,336 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 05:52:53,337 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 05:52:53,337 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 05:52:53,337 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 05:52:53,341 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:52:53" (1/1) ... [2025-03-09 05:52:53,366 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:52:53" (1/1) ... [2025-03-09 05:52:53,398 INFO L138 Inliner]: procedures = 594, calls = 490, calls flagged for inlining = 16, calls inlined = 14, statements flattened = 807 [2025-03-09 05:52:53,398 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 05:52:53,399 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 05:52:53,399 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 05:52:53,399 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 05:52:53,405 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:52:53" (1/1) ... [2025-03-09 05:52:53,405 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:52:53" (1/1) ... [2025-03-09 05:52:53,415 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:52:53" (1/1) ... [2025-03-09 05:52:53,430 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-03-09 05:52:53,430 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:52:53" (1/1) ... [2025-03-09 05:52:53,430 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:52:53" (1/1) ... [2025-03-09 05:52:53,465 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:52:53" (1/1) ... [2025-03-09 05:52:53,467 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:52:53" (1/1) ... [2025-03-09 05:52:53,475 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:52:53" (1/1) ... [2025-03-09 05:52:53,479 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:52:53" (1/1) ... [2025-03-09 05:52:53,486 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 05:52:53,487 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 05:52:53,487 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 05:52:53,487 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 05:52:53,487 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:52:53" (1/1) ... [2025-03-09 05:52:53,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 05:52:53,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:52:53,510 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-09 05:52:53,511 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-09 05:52:53,527 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-09 05:52:53,527 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2025-03-09 05:52:53,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-03-09 05:52:53,528 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-09 05:52:53,528 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-09 05:52:53,528 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 05:52:53,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-03-09 05:52:53,528 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 05:52:53,528 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 05:52:53,528 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy [2025-03-09 05:52:53,528 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy [2025-03-09 05:52:53,528 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2025-03-09 05:52:53,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2025-03-09 05:52:53,528 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-09 05:52:53,528 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-09 05:52:53,528 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-09 05:52:53,528 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-03-09 05:52:53,528 INFO L130 BoogieDeclarations]: Found specification of procedure fflush_all [2025-03-09 05:52:53,528 INFO L138 BoogieDeclarations]: Found implementation of procedure fflush_all [2025-03-09 05:52:53,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-09 05:52:53,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-09 05:52:53,804 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 05:52:53,806 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 05:52:54,306 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2406: havoc getlogin_r_~ret~0#1; [2025-03-09 05:52:54,306 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2371: havoc __main_~return_value_fflush_all$1~0#1; [2025-03-09 05:52:54,366 INFO L? ?]: Removed 211 outVars from TransFormulas that were not future-live. [2025-03-09 05:52:54,366 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 05:52:54,384 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 05:52:54,384 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 05:52:54,385 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 05:52:54 BoogieIcfgContainer [2025-03-09 05:52:54,385 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 05:52:54,386 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 05:52:54,386 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 05:52:54,390 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 05:52:54,390 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 05:52:52" (1/3) ... [2025-03-09 05:52:54,390 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4855c5ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 05:52:54, skipping insertion in model container [2025-03-09 05:52:54,391 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:52:53" (2/3) ... [2025-03-09 05:52:54,391 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4855c5ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 05:52:54, skipping insertion in model container [2025-03-09 05:52:54,391 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 05:52:54" (3/3) ... [2025-03-09 05:52:54,392 INFO L128 eAbstractionObserver]: Analyzing ICFG logname-1.i [2025-03-09 05:52:54,402 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 05:52:54,404 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG logname-1.i that has 4 procedures, 159 locations, 1 initial locations, 12 loop locations, and 34 error locations. [2025-03-09 05:52:54,448 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 05:52:54,459 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;@192efa0e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 05:52:54,459 INFO L334 AbstractCegarLoop]: Starting to check reachability of 34 error locations. [2025-03-09 05:52:54,463 INFO L276 IsEmpty]: Start isEmpty. Operand has 159 states, 111 states have (on average 1.6216216216216217) internal successors, (180), 145 states have internal predecessors, (180), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-09 05:52:54,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-09 05:52:54,468 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:52:54,468 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-09 05:52:54,469 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 31 more)] === [2025-03-09 05:52:54,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:52:54,473 INFO L85 PathProgramCache]: Analyzing trace with hash 7356351, now seen corresponding path program 1 times [2025-03-09 05:52:54,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:52:54,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819490781] [2025-03-09 05:52:54,478 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:52:54,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:52:54,677 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-09 05:52:54,748 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-09 05:52:54,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:52:54,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:52:54,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 05:52:54,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:52:54,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819490781] [2025-03-09 05:52:54,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819490781] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:52:54,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:52:54,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 05:52:54,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843007414] [2025-03-09 05:52:54,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:52:54,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 05:52:54,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:52:54,972 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 05:52:54,973 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 05:52:54,975 INFO L87 Difference]: Start difference. First operand has 159 states, 111 states have (on average 1.6216216216216217) internal successors, (180), 145 states have internal predecessors, (180), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 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-09 05:52:55,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:52:55,022 INFO L93 Difference]: Finished difference Result 220 states and 283 transitions. [2025-03-09 05:52:55,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 05:52:55,024 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 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-09 05:52:55,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:52:55,028 INFO L225 Difference]: With dead ends: 220 [2025-03-09 05:52:55,028 INFO L226 Difference]: Without dead ends: 65 [2025-03-09 05:52:55,030 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 05:52:55,032 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 1 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 05:52:55,032 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 138 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 05:52:55,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2025-03-09 05:52:55,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2025-03-09 05:52:55,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 45 states have (on average 1.488888888888889) internal successors, (67), 58 states have internal predecessors, (67), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-09 05:52:55,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 76 transitions. [2025-03-09 05:52:55,061 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 76 transitions. Word has length 4 [2025-03-09 05:52:55,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:52:55,061 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 76 transitions. [2025-03-09 05:52:55,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 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-09 05:52:55,062 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 76 transitions. [2025-03-09 05:52:55,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-09 05:52:55,062 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:52:55,062 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2025-03-09 05:52:55,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 05:52:55,063 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 31 more)] === [2025-03-09 05:52:55,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:52:55,064 INFO L85 PathProgramCache]: Analyzing trace with hash 109892460, now seen corresponding path program 1 times [2025-03-09 05:52:55,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:52:55,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297523752] [2025-03-09 05:52:55,064 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:52:55,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:52:55,121 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 05:52:55,142 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 05:52:55,142 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:52:55,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:52:55,305 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 05:52:55,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:52:55,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297523752] [2025-03-09 05:52:55,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297523752] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 05:52:55,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1668596515] [2025-03-09 05:52:55,307 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:52:55,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:52:55,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:52:55,309 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 05:52:55,310 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-09 05:52:55,432 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 05:52:55,538 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 05:52:55,538 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:52:55,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:52:55,543 INFO L256 TraceCheckSpWp]: Trace formula consists of 907 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 05:52:55,546 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 05:52:55,565 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 05:52:55,566 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 05:52:55,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1668596515] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:52:55,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 05:52:55,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2025-03-09 05:52:55,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163835799] [2025-03-09 05:52:55,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:52:55,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 05:52:55,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:52:55,567 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 05:52:55,567 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-09 05:52:55,568 INFO L87 Difference]: Start difference. First operand 65 states and 76 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 05:52:55,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:52:55,590 INFO L93 Difference]: Finished difference Result 65 states and 76 transitions. [2025-03-09 05:52:55,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 05:52:55,592 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-03-09 05:52:55,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:52:55,592 INFO L225 Difference]: With dead ends: 65 [2025-03-09 05:52:55,592 INFO L226 Difference]: Without dead ends: 64 [2025-03-09 05:52:55,592 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-09 05:52:55,593 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 1 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 133 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-09 05:52:55,593 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 133 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 05:52:55,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2025-03-09 05:52:55,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2025-03-09 05:52:55,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 45 states have (on average 1.4666666666666666) internal successors, (66), 57 states have internal predecessors, (66), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-09 05:52:55,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 75 transitions. [2025-03-09 05:52:55,603 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 75 transitions. Word has length 7 [2025-03-09 05:52:55,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:52:55,603 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 75 transitions. [2025-03-09 05:52:55,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 05:52:55,603 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 75 transitions. [2025-03-09 05:52:55,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-09 05:52:55,603 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:52:55,604 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2025-03-09 05:52:55,613 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-09 05:52:55,805 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-09 05:52:55,805 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 31 more)] === [2025-03-09 05:52:55,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:52:55,806 INFO L85 PathProgramCache]: Analyzing trace with hash -888300863, now seen corresponding path program 1 times [2025-03-09 05:52:55,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:52:55,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746497131] [2025-03-09 05:52:55,806 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:52:55,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:52:55,843 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 05:52:55,854 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 05:52:55,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:52:55,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:52:55,943 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 05:52:55,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:52:55,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746497131] [2025-03-09 05:52:55,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1746497131] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:52:55,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:52:55,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 05:52:55,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014947299] [2025-03-09 05:52:55,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:52:55,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 05:52:55,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:52:55,945 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 05:52:55,945 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 05:52:55,946 INFO L87 Difference]: Start difference. First operand 64 states and 75 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 05:52:55,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:52:55,956 INFO L93 Difference]: Finished difference Result 64 states and 75 transitions. [2025-03-09 05:52:55,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 05:52:55,957 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-03-09 05:52:55,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:52:55,958 INFO L225 Difference]: With dead ends: 64 [2025-03-09 05:52:55,958 INFO L226 Difference]: Without dead ends: 63 [2025-03-09 05:52:55,958 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 05:52:55,958 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 0 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 134 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-09 05:52:55,959 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 134 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 05:52:55,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2025-03-09 05:52:55,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 61. [2025-03-09 05:52:55,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 43 states have (on average 1.4651162790697674) internal successors, (63), 54 states have internal predecessors, (63), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-09 05:52:55,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 72 transitions. [2025-03-09 05:52:55,962 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 72 transitions. Word has length 8 [2025-03-09 05:52:55,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:52:55,963 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 72 transitions. [2025-03-09 05:52:55,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 05:52:55,963 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 72 transitions. [2025-03-09 05:52:55,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-09 05:52:55,963 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:52:55,963 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:52:55,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-09 05:52:55,964 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 31 more)] === [2025-03-09 05:52:55,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:52:55,964 INFO L85 PathProgramCache]: Analyzing trace with hash 384849795, now seen corresponding path program 1 times [2025-03-09 05:52:55,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:52:55,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120659284] [2025-03-09 05:52:55,964 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:52:55,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:52:55,999 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-09 05:52:56,010 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-09 05:52:56,011 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:52:56,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:52:56,129 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 05:52:56,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:52:56,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120659284] [2025-03-09 05:52:56,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120659284] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 05:52:56,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [64707919] [2025-03-09 05:52:56,130 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:52:56,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:52:56,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:52:56,132 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 05:52:56,134 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-09 05:52:56,292 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-09 05:52:56,401 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-09 05:52:56,401 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:52:56,402 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:52:56,406 INFO L256 TraceCheckSpWp]: Trace formula consists of 924 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-09 05:52:56,407 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 05:52:56,420 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-09 05:52:56,421 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 05:52:56,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [64707919] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:52:56,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 05:52:56,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-03-09 05:52:56,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059206833] [2025-03-09 05:52:56,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:52:56,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 05:52:56,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:52:56,422 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 05:52:56,422 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 05:52:56,422 INFO L87 Difference]: Start difference. First operand 61 states and 72 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 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-09 05:52:56,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:52:56,451 INFO L93 Difference]: Finished difference Result 61 states and 72 transitions. [2025-03-09 05:52:56,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 05:52:56,453 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 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 12 [2025-03-09 05:52:56,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:52:56,454 INFO L225 Difference]: With dead ends: 61 [2025-03-09 05:52:56,454 INFO L226 Difference]: Without dead ends: 59 [2025-03-09 05:52:56,454 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 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-09 05:52:56,455 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 47 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 05:52:56,455 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 75 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 05:52:56,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2025-03-09 05:52:56,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2025-03-09 05:52:56,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 43 states have (on average 1.4186046511627908) internal successors, (61), 52 states have internal predecessors, (61), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-09 05:52:56,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 70 transitions. [2025-03-09 05:52:56,461 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 70 transitions. Word has length 12 [2025-03-09 05:52:56,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:52:56,462 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 70 transitions. [2025-03-09 05:52:56,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 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-09 05:52:56,463 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 70 transitions. [2025-03-09 05:52:56,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-09 05:52:56,464 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:52:56,464 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:52:56,472 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-09 05:52:56,664 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-09 05:52:56,665 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 31 more)] === [2025-03-09 05:52:56,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:52:56,665 INFO L85 PathProgramCache]: Analyzing trace with hash -954558076, now seen corresponding path program 1 times [2025-03-09 05:52:56,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:52:56,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830379376] [2025-03-09 05:52:56,665 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:52:56,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:52:56,703 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-09 05:52:56,716 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-09 05:52:56,716 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:52:56,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:52:56,807 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 05:52:56,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:52:56,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830379376] [2025-03-09 05:52:56,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830379376] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 05:52:56,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1939240411] [2025-03-09 05:52:56,808 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:52:56,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:52:56,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:52:56,810 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 05:52:56,812 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-09 05:52:56,927 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-09 05:52:57,021 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-09 05:52:57,022 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:52:57,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:52:57,025 INFO L256 TraceCheckSpWp]: Trace formula consists of 925 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 05:52:57,027 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 05:52:57,040 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 05:52:57,041 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 05:52:57,071 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 05:52:57,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1939240411] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 05:52:57,073 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 05:52:57,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-09 05:52:57,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903938412] [2025-03-09 05:52:57,073 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 05:52:57,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 05:52:57,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:52:57,074 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 05:52:57,074 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-09 05:52:57,074 INFO L87 Difference]: Start difference. First operand 59 states and 70 transitions. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 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-09 05:52:57,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:52:57,109 INFO L93 Difference]: Finished difference Result 121 states and 145 transitions. [2025-03-09 05:52:57,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 05:52:57,110 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 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 13 [2025-03-09 05:52:57,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:52:57,112 INFO L225 Difference]: With dead ends: 121 [2025-03-09 05:52:57,113 INFO L226 Difference]: Without dead ends: 68 [2025-03-09 05:52:57,113 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-09 05:52:57,113 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 4 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 05:52:57,114 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 322 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 05:52:57,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2025-03-09 05:52:57,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2025-03-09 05:52:57,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 52 states have (on average 1.3461538461538463) internal successors, (70), 61 states have internal predecessors, (70), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-09 05:52:57,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 79 transitions. [2025-03-09 05:52:57,122 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 79 transitions. Word has length 13 [2025-03-09 05:52:57,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:52:57,122 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 79 transitions. [2025-03-09 05:52:57,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 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-09 05:52:57,122 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 79 transitions. [2025-03-09 05:52:57,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-09 05:52:57,122 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:52:57,122 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:52:57,133 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-09 05:52:57,325 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-09 05:52:57,326 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 31 more)] === [2025-03-09 05:52:57,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:52:57,332 INFO L85 PathProgramCache]: Analyzing trace with hash -103396009, now seen corresponding path program 2 times [2025-03-09 05:52:57,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:52:57,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925907564] [2025-03-09 05:52:57,333 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 05:52:57,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:52:57,365 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-03-09 05:52:57,382 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 10 of 22 statements. [2025-03-09 05:52:57,383 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 05:52:57,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:52:57,534 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-09 05:52:57,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:52:57,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925907564] [2025-03-09 05:52:57,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925907564] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:52:57,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:52:57,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 05:52:57,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556244487] [2025-03-09 05:52:57,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:52:57,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 05:52:57,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:52:57,536 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 05:52:57,537 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 05:52:57,537 INFO L87 Difference]: Start difference. First operand 68 states and 79 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 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-09 05:52:57,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:52:57,586 INFO L93 Difference]: Finished difference Result 68 states and 79 transitions. [2025-03-09 05:52:57,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 05:52:57,587 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 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 22 [2025-03-09 05:52:57,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:52:57,588 INFO L225 Difference]: With dead ends: 68 [2025-03-09 05:52:57,588 INFO L226 Difference]: Without dead ends: 66 [2025-03-09 05:52:57,588 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-09 05:52:57,590 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 46 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 05:52:57,590 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 170 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 05:52:57,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2025-03-09 05:52:57,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2025-03-09 05:52:57,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 52 states have (on average 1.3076923076923077) internal successors, (68), 59 states have internal predecessors, (68), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-09 05:52:57,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 77 transitions. [2025-03-09 05:52:57,597 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 77 transitions. Word has length 22 [2025-03-09 05:52:57,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:52:57,599 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 77 transitions. [2025-03-09 05:52:57,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 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-09 05:52:57,599 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 77 transitions. [2025-03-09 05:52:57,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-09 05:52:57,599 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:52:57,599 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:52:57,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-09 05:52:57,600 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 31 more)] === [2025-03-09 05:52:57,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:52:57,601 INFO L85 PathProgramCache]: Analyzing trace with hash -1092017333, now seen corresponding path program 1 times [2025-03-09 05:52:57,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:52:57,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994722296] [2025-03-09 05:52:57,601 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:52:57,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:52:57,643 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-09 05:52:57,660 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-09 05:52:57,663 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:52:57,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:52:57,792 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-09 05:52:57,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:52:57,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994722296] [2025-03-09 05:52:57,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994722296] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:52:57,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:52:57,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 05:52:57,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823436563] [2025-03-09 05:52:57,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:52:57,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 05:52:57,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:52:57,794 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 05:52:57,794 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 05:52:57,794 INFO L87 Difference]: Start difference. First operand 66 states and 77 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) 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-09 05:52:57,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:52:57,815 INFO L93 Difference]: Finished difference Result 115 states and 138 transitions. [2025-03-09 05:52:57,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 05:52:57,816 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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-09 05:52:57,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:52:57,816 INFO L225 Difference]: With dead ends: 115 [2025-03-09 05:52:57,816 INFO L226 Difference]: Without dead ends: 69 [2025-03-09 05:52:57,817 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 05:52:57,817 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 2 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 123 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-09 05:52:57,817 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 123 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 05:52:57,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2025-03-09 05:52:57,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2025-03-09 05:52:57,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 55 states have (on average 1.290909090909091) internal successors, (71), 62 states have internal predecessors, (71), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-09 05:52:57,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 80 transitions. [2025-03-09 05:52:57,821 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 80 transitions. Word has length 27 [2025-03-09 05:52:57,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:52:57,821 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 80 transitions. [2025-03-09 05:52:57,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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-09 05:52:57,822 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 80 transitions. [2025-03-09 05:52:57,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-09 05:52:57,822 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:52:57,822 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:52:57,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-09 05:52:57,822 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 31 more)] === [2025-03-09 05:52:57,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:52:57,823 INFO L85 PathProgramCache]: Analyzing trace with hash 2093822224, now seen corresponding path program 1 times [2025-03-09 05:52:57,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:52:57,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842704115] [2025-03-09 05:52:57,823 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:52:57,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:52:57,858 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-09 05:52:57,873 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-09 05:52:57,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:52:57,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:52:57,973 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-09 05:52:57,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:52:57,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842704115] [2025-03-09 05:52:57,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842704115] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:52:57,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:52:57,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 05:52:57,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594544867] [2025-03-09 05:52:57,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:52:57,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 05:52:57,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:52:57,975 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 05:52:57,975 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 05:52:57,975 INFO L87 Difference]: Start difference. First operand 69 states and 80 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-09 05:52:57,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:52:57,998 INFO L93 Difference]: Finished difference Result 82 states and 95 transitions. [2025-03-09 05:52:57,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 05:52:57,998 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 30 [2025-03-09 05:52:57,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:52:57,999 INFO L225 Difference]: With dead ends: 82 [2025-03-09 05:52:57,999 INFO L226 Difference]: Without dead ends: 80 [2025-03-09 05:52:57,999 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 05:52:58,000 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 3 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 05:52:58,000 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 120 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 05:52:58,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2025-03-09 05:52:58,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 78. [2025-03-09 05:52:58,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 64 states have (on average 1.3125) internal successors, (84), 71 states have internal predecessors, (84), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-09 05:52:58,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 93 transitions. [2025-03-09 05:52:58,007 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 93 transitions. Word has length 30 [2025-03-09 05:52:58,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:52:58,007 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 93 transitions. [2025-03-09 05:52:58,008 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-09 05:52:58,008 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 93 transitions. [2025-03-09 05:52:58,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-09 05:52:58,008 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:52:58,008 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:52:58,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-09 05:52:58,008 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 31 more)] === [2025-03-09 05:52:58,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:52:58,009 INFO L85 PathProgramCache]: Analyzing trace with hash 2093822384, now seen corresponding path program 1 times [2025-03-09 05:52:58,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:52:58,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907900945] [2025-03-09 05:52:58,009 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:52:58,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:52:58,057 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-09 05:52:58,071 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-09 05:52:58,071 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:52:58,071 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:52:58,172 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-09 05:52:58,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:52:58,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907900945] [2025-03-09 05:52:58,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907900945] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 05:52:58,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1787066588] [2025-03-09 05:52:58,172 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:52:58,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:52:58,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:52:58,174 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 05:52:58,176 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-09 05:52:58,319 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-09 05:52:58,432 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-09 05:52:58,432 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:52:58,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:52:58,436 INFO L256 TraceCheckSpWp]: Trace formula consists of 1110 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-09 05:52:58,437 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 05:52:58,485 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-09 05:52:58,486 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 05:52:58,551 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-09 05:52:58,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1787066588] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 05:52:58,551 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 05:52:58,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 7, 7] total 14 [2025-03-09 05:52:58,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262052756] [2025-03-09 05:52:58,552 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 05:52:58,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-09 05:52:58,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:52:58,552 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-09 05:52:58,553 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2025-03-09 05:52:58,553 INFO L87 Difference]: Start difference. First operand 78 states and 93 transitions. Second operand has 14 states, 14 states have (on average 4.214285714285714) internal successors, (59), 14 states have internal predecessors, (59), 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-09 05:52:58,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:52:58,629 INFO L93 Difference]: Finished difference Result 158 states and 194 transitions. [2025-03-09 05:52:58,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-09 05:52:58,630 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.214285714285714) internal successors, (59), 14 states have internal predecessors, (59), 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 30 [2025-03-09 05:52:58,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:52:58,630 INFO L225 Difference]: With dead ends: 158 [2025-03-09 05:52:58,631 INFO L226 Difference]: Without dead ends: 95 [2025-03-09 05:52:58,631 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 49 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-09 05:52:58,631 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 5 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 05:52:58,631 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 338 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 05:52:58,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2025-03-09 05:52:58,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2025-03-09 05:52:58,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 82 states have (on average 1.2195121951219512) internal successors, (100), 88 states have internal predecessors, (100), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-09 05:52:58,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 109 transitions. [2025-03-09 05:52:58,639 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 109 transitions. Word has length 30 [2025-03-09 05:52:58,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:52:58,639 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 109 transitions. [2025-03-09 05:52:58,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.214285714285714) internal successors, (59), 14 states have internal predecessors, (59), 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-09 05:52:58,639 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 109 transitions. [2025-03-09 05:52:58,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-09 05:52:58,640 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:52:58,640 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:52:58,661 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-09 05:52:58,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:52:58,842 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 31 more)] === [2025-03-09 05:52:58,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:52:58,842 INFO L85 PathProgramCache]: Analyzing trace with hash 1903299149, now seen corresponding path program 1 times [2025-03-09 05:52:58,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:52:58,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595544844] [2025-03-09 05:52:58,843 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:52:58,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:52:58,888 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-09 05:52:58,911 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-09 05:52:58,911 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:52:58,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:52:59,001 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-09 05:52:59,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:52:59,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595544844] [2025-03-09 05:52:59,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595544844] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:52:59,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:52:59,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 05:52:59,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795150444] [2025-03-09 05:52:59,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:52:59,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 05:52:59,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:52:59,002 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 05:52:59,002 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 05:52:59,002 INFO L87 Difference]: Start difference. First operand 95 states and 109 transitions. Second operand has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 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-09 05:52:59,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:52:59,017 INFO L93 Difference]: Finished difference Result 95 states and 109 transitions. [2025-03-09 05:52:59,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 05:52:59,018 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 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 49 [2025-03-09 05:52:59,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:52:59,019 INFO L225 Difference]: With dead ends: 95 [2025-03-09 05:52:59,020 INFO L226 Difference]: Without dead ends: 94 [2025-03-09 05:52:59,020 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 05:52:59,020 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 0 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 121 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-09 05:52:59,021 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 121 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 05:52:59,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2025-03-09 05:52:59,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 90. [2025-03-09 05:52:59,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 78 states have (on average 1.205128205128205) internal successors, (94), 83 states have internal predecessors, (94), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-09 05:52:59,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 103 transitions. [2025-03-09 05:52:59,029 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 103 transitions. Word has length 49 [2025-03-09 05:52:59,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:52:59,029 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 103 transitions. [2025-03-09 05:52:59,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 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-09 05:52:59,029 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 103 transitions. [2025-03-09 05:52:59,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-09 05:52:59,030 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:52:59,030 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] [2025-03-09 05:52:59,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-09 05:52:59,031 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 31 more)] === [2025-03-09 05:52:59,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:52:59,031 INFO L85 PathProgramCache]: Analyzing trace with hash 191822533, now seen corresponding path program 1 times [2025-03-09 05:52:59,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:52:59,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201663107] [2025-03-09 05:52:59,031 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:52:59,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:52:59,069 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-09 05:52:59,085 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-09 05:52:59,085 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:52:59,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:52:59,220 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-09 05:52:59,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:52:59,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201663107] [2025-03-09 05:52:59,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201663107] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:52:59,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:52:59,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 05:52:59,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092764969] [2025-03-09 05:52:59,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:52:59,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 05:52:59,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:52:59,222 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 05:52:59,222 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 05:52:59,222 INFO L87 Difference]: Start difference. First operand 90 states and 103 transitions. Second operand has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 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-09 05:52:59,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:52:59,241 INFO L93 Difference]: Finished difference Result 95 states and 109 transitions. [2025-03-09 05:52:59,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 05:52:59,241 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 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 55 [2025-03-09 05:52:59,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:52:59,242 INFO L225 Difference]: With dead ends: 95 [2025-03-09 05:52:59,244 INFO L226 Difference]: Without dead ends: 93 [2025-03-09 05:52:59,244 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 05:52:59,245 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 1 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 117 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-09 05:52:59,245 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 117 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 05:52:59,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2025-03-09 05:52:59,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2025-03-09 05:52:59,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 81 states have (on average 1.2098765432098766) internal successors, (98), 86 states have internal predecessors, (98), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-09 05:52:59,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 107 transitions. [2025-03-09 05:52:59,254 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 107 transitions. Word has length 55 [2025-03-09 05:52:59,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:52:59,255 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 107 transitions. [2025-03-09 05:52:59,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 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-09 05:52:59,255 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 107 transitions. [2025-03-09 05:52:59,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-09 05:52:59,257 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:52:59,258 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:52:59,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-09 05:52:59,258 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 31 more)] === [2025-03-09 05:52:59,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:52:59,258 INFO L85 PathProgramCache]: Analyzing trace with hash 601861507, now seen corresponding path program 1 times [2025-03-09 05:52:59,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:52:59,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54594053] [2025-03-09 05:52:59,258 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:52:59,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:52:59,322 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-09 05:52:59,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-09 05:52:59,342 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:52:59,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:52:59,467 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-03-09 05:52:59,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:52:59,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54594053] [2025-03-09 05:52:59,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54594053] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 05:52:59,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [153315051] [2025-03-09 05:52:59,468 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:52:59,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:52:59,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:52:59,470 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 05:52:59,471 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-09 05:52:59,639 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-09 05:52:59,772 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-09 05:52:59,772 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:52:59,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:52:59,777 INFO L256 TraceCheckSpWp]: Trace formula consists of 1279 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 05:52:59,779 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 05:52:59,791 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-03-09 05:52:59,791 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 05:52:59,808 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-03-09 05:52:59,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [153315051] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 05:52:59,809 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 05:52:59,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-09 05:52:59,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480661090] [2025-03-09 05:52:59,809 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 05:52:59,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 05:52:59,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:52:59,810 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 05:52:59,810 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-09 05:52:59,810 INFO L87 Difference]: Start difference. First operand 93 states and 107 transitions. Second operand has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 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-09 05:52:59,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:52:59,835 INFO L93 Difference]: Finished difference Result 161 states and 191 transitions. [2025-03-09 05:52:59,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 05:52:59,835 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 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-09 05:52:59,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:52:59,836 INFO L225 Difference]: With dead ends: 161 [2025-03-09 05:52:59,836 INFO L226 Difference]: Without dead ends: 111 [2025-03-09 05:52:59,836 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-09 05:52:59,837 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 4 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 121 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-09 05:52:59,837 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 121 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 05:52:59,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2025-03-09 05:52:59,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2025-03-09 05:52:59,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 99 states have (on average 1.1717171717171717) internal successors, (116), 104 states have internal predecessors, (116), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-09 05:52:59,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 125 transitions. [2025-03-09 05:52:59,848 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 125 transitions. Word has length 55 [2025-03-09 05:52:59,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:52:59,848 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 125 transitions. [2025-03-09 05:52:59,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 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-09 05:52:59,848 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 125 transitions. [2025-03-09 05:52:59,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-03-09 05:52:59,848 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:52:59,849 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-09 05:52:59,859 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-09 05:53:00,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-09 05:53:00,049 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 31 more)] === [2025-03-09 05:53:00,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:53:00,050 INFO L85 PathProgramCache]: Analyzing trace with hash 1772580868, now seen corresponding path program 1 times [2025-03-09 05:53:00,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:53:00,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260143436] [2025-03-09 05:53:00,050 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:53:00,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:53:00,086 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-09 05:53:00,146 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-09 05:53:00,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:53:00,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:53:00,373 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2025-03-09 05:53:00,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:53:00,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260143436] [2025-03-09 05:53:00,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260143436] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 05:53:00,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1328831550] [2025-03-09 05:53:00,373 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:53:00,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:53:00,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:53:00,375 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 05:53:00,377 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-09 05:53:00,547 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-09 05:53:00,651 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-09 05:53:00,652 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:53:00,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:53:00,656 INFO L256 TraceCheckSpWp]: Trace formula consists of 1224 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-09 05:53:00,659 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 05:53:00,709 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2025-03-09 05:53:00,710 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 05:53:00,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1328831550] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:53:00,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 05:53:00,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 8 [2025-03-09 05:53:00,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829967308] [2025-03-09 05:53:00,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:53:00,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 05:53:00,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:53:00,710 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 05:53:00,710 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-09 05:53:00,711 INFO L87 Difference]: Start difference. First operand 111 states and 125 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 05:53:00,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:53:00,755 INFO L93 Difference]: Finished difference Result 127 states and 143 transitions. [2025-03-09 05:53:00,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 05:53:00,756 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 59 [2025-03-09 05:53:00,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:53:00,756 INFO L225 Difference]: With dead ends: 127 [2025-03-09 05:53:00,756 INFO L226 Difference]: Without dead ends: 111 [2025-03-09 05:53:00,757 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-09 05:53:00,757 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 8 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 05:53:00,757 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 257 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 05:53:00,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2025-03-09 05:53:00,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2025-03-09 05:53:00,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 99 states have (on average 1.1616161616161615) internal successors, (115), 104 states have internal predecessors, (115), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-09 05:53:00,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 124 transitions. [2025-03-09 05:53:00,762 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 124 transitions. Word has length 59 [2025-03-09 05:53:00,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:53:00,763 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 124 transitions. [2025-03-09 05:53:00,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 05:53:00,763 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 124 transitions. [2025-03-09 05:53:00,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-09 05:53:00,763 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:53:00,763 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, 1, 1, 1] [2025-03-09 05:53:00,772 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-09 05:53:00,964 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-09 05:53:00,964 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 31 more)] === [2025-03-09 05:53:00,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:53:00,965 INFO L85 PathProgramCache]: Analyzing trace with hash -2016260164, now seen corresponding path program 1 times [2025-03-09 05:53:00,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:53:00,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513567996] [2025-03-09 05:53:00,965 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:53:00,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:53:01,010 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-09 05:53:01,026 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-09 05:53:01,026 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:53:01,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:53:01,141 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-09 05:53:01,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:53:01,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513567996] [2025-03-09 05:53:01,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513567996] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 05:53:01,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [970321481] [2025-03-09 05:53:01,141 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:53:01,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:53:01,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:53:01,143 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 05:53:01,145 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-09 05:53:01,321 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-09 05:53:01,429 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-09 05:53:01,430 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:53:01,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:53:01,434 INFO L256 TraceCheckSpWp]: Trace formula consists of 1233 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 05:53:01,436 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 05:53:01,451 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2025-03-09 05:53:01,452 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 05:53:01,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [970321481] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:53:01,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 05:53:01,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2025-03-09 05:53:01,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589545444] [2025-03-09 05:53:01,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:53:01,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 05:53:01,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:53:01,453 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 05:53:01,453 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-09 05:53:01,453 INFO L87 Difference]: Start difference. First operand 111 states and 124 transitions. Second operand has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 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-09 05:53:01,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:53:01,471 INFO L93 Difference]: Finished difference Result 111 states and 124 transitions. [2025-03-09 05:53:01,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 05:53:01,471 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 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 58 [2025-03-09 05:53:01,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:53:01,473 INFO L225 Difference]: With dead ends: 111 [2025-03-09 05:53:01,473 INFO L226 Difference]: Without dead ends: 110 [2025-03-09 05:53:01,473 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-09 05:53:01,473 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 1 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 05:53:01,474 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 115 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 05:53:01,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2025-03-09 05:53:01,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2025-03-09 05:53:01,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 99 states have (on average 1.1515151515151516) internal successors, (114), 103 states have internal predecessors, (114), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-09 05:53:01,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 123 transitions. [2025-03-09 05:53:01,479 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 123 transitions. Word has length 58 [2025-03-09 05:53:01,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:53:01,480 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 123 transitions. [2025-03-09 05:53:01,480 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 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-09 05:53:01,480 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 123 transitions. [2025-03-09 05:53:01,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-03-09 05:53:01,481 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:53:01,481 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-09 05:53:01,490 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-09 05:53:01,682 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-09 05:53:01,683 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 31 more)] === [2025-03-09 05:53:01,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:53:01,683 INFO L85 PathProgramCache]: Analyzing trace with hash 1920444487, now seen corresponding path program 1 times [2025-03-09 05:53:01,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:53:01,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153591478] [2025-03-09 05:53:01,683 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:53:01,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:53:01,719 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-09 05:53:01,731 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-09 05:53:01,732 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:53:01,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:53:01,820 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2025-03-09 05:53:01,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:53:01,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153591478] [2025-03-09 05:53:01,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153591478] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 05:53:01,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [923698313] [2025-03-09 05:53:01,821 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:53:01,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:53:01,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:53:01,824 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 05:53:01,825 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-09 05:53:02,068 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-09 05:53:02,199 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-09 05:53:02,200 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:53:02,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:53:02,204 INFO L256 TraceCheckSpWp]: Trace formula consists of 1234 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 05:53:02,206 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 05:53:02,224 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2025-03-09 05:53:02,224 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 05:53:02,247 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2025-03-09 05:53:02,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [923698313] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 05:53:02,247 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 05:53:02,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-03-09 05:53:02,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757635519] [2025-03-09 05:53:02,247 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 05:53:02,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 05:53:02,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:53:02,248 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 05:53:02,248 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-09 05:53:02,248 INFO L87 Difference]: Start difference. First operand 110 states and 123 transitions. Second operand has 7 states, 6 states have (on average 6.0) internal successors, (36), 7 states have internal predecessors, (36), 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-09 05:53:02,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:53:02,275 INFO L93 Difference]: Finished difference Result 120 states and 138 transitions. [2025-03-09 05:53:02,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 05:53:02,276 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.0) internal successors, (36), 7 states have internal predecessors, (36), 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-09 05:53:02,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:53:02,277 INFO L225 Difference]: With dead ends: 120 [2025-03-09 05:53:02,277 INFO L226 Difference]: Without dead ends: 119 [2025-03-09 05:53:02,277 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-09 05:53:02,278 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 0 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 05:53:02,278 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 172 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 05:53:02,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2025-03-09 05:53:02,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2025-03-09 05:53:02,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 108 states have (on average 1.1666666666666667) internal successors, (126), 112 states have internal predecessors, (126), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-09 05:53:02,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 135 transitions. [2025-03-09 05:53:02,284 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 135 transitions. Word has length 59 [2025-03-09 05:53:02,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:53:02,284 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 135 transitions. [2025-03-09 05:53:02,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.0) internal successors, (36), 7 states have internal predecessors, (36), 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-09 05:53:02,284 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 135 transitions. [2025-03-09 05:53:02,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-09 05:53:02,285 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:53:02,285 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, 1, 1, 1] [2025-03-09 05:53:02,294 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-09 05:53:02,485 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,SelfDestructingSolverStorable14 [2025-03-09 05:53:02,486 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 31 more)] === [2025-03-09 05:53:02,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:53:02,486 INFO L85 PathProgramCache]: Analyzing trace with hash -1445367429, now seen corresponding path program 1 times [2025-03-09 05:53:02,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:53:02,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369451333] [2025-03-09 05:53:02,486 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:53:02,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:53:02,534 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-09 05:53:02,682 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-09 05:53:02,683 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:53:02,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:53:02,884 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-03-09 05:53:02,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:53:02,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369451333] [2025-03-09 05:53:02,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369451333] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 05:53:02,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1133301691] [2025-03-09 05:53:02,884 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:53:02,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:53:02,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:53:02,887 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 05:53:02,888 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-09 05:53:03,082 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-09 05:53:03,188 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-09 05:53:03,189 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:53:03,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:53:03,193 INFO L256 TraceCheckSpWp]: Trace formula consists of 1243 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-09 05:53:03,195 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 05:53:03,231 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2025-03-09 05:53:03,233 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 05:53:03,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1133301691] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:53:03,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 05:53:03,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 8 [2025-03-09 05:53:03,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262428368] [2025-03-09 05:53:03,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:53:03,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 05:53:03,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:53:03,234 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 05:53:03,235 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-09 05:53:03,235 INFO L87 Difference]: Start difference. First operand 119 states and 135 transitions. Second operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 05:53:03,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:53:03,314 INFO L93 Difference]: Finished difference Result 166 states and 192 transitions. [2025-03-09 05:53:03,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 05:53:03,315 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 62 [2025-03-09 05:53:03,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:53:03,316 INFO L225 Difference]: With dead ends: 166 [2025-03-09 05:53:03,316 INFO L226 Difference]: Without dead ends: 119 [2025-03-09 05:53:03,316 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-09 05:53:03,317 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 53 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 05:53:03,317 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 185 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 05:53:03,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2025-03-09 05:53:03,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2025-03-09 05:53:03,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 108 states have (on average 1.1574074074074074) internal successors, (125), 112 states have internal predecessors, (125), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-09 05:53:03,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 134 transitions. [2025-03-09 05:53:03,322 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 134 transitions. Word has length 62 [2025-03-09 05:53:03,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:53:03,322 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 134 transitions. [2025-03-09 05:53:03,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 05:53:03,322 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 134 transitions. [2025-03-09 05:53:03,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-09 05:53:03,323 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:53:03,323 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 8, 8, 8, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:53:03,332 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-09 05:53:03,527 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,SelfDestructingSolverStorable15 [2025-03-09 05:53:03,527 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 31 more)] === [2025-03-09 05:53:03,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:53:03,527 INFO L85 PathProgramCache]: Analyzing trace with hash -261369165, now seen corresponding path program 2 times [2025-03-09 05:53:03,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:53:03,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621875219] [2025-03-09 05:53:03,527 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 05:53:03,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:53:03,576 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 73 statements into 2 equivalence classes. [2025-03-09 05:53:03,617 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 73 of 73 statements. [2025-03-09 05:53:03,617 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 05:53:03,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:53:03,754 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 0 proven. 59 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2025-03-09 05:53:03,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:53:03,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621875219] [2025-03-09 05:53:03,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621875219] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 05:53:03,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2037071268] [2025-03-09 05:53:03,754 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 05:53:03,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:53:03,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:53:03,756 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 05:53:03,776 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-09 05:53:04,012 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 73 statements into 2 equivalence classes. [2025-03-09 05:53:04,247 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 73 of 73 statements. [2025-03-09 05:53:04,247 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 05:53:04,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:53:04,254 INFO L256 TraceCheckSpWp]: Trace formula consists of 1417 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-09 05:53:04,258 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 05:53:04,305 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 58 proven. 22 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2025-03-09 05:53:04,305 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 05:53:04,369 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 58 proven. 22 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2025-03-09 05:53:04,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2037071268] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 05:53:04,370 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 05:53:04,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 7, 7] total 14 [2025-03-09 05:53:04,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435209771] [2025-03-09 05:53:04,371 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 05:53:04,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-09 05:53:04,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:53:04,371 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-09 05:53:04,372 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2025-03-09 05:53:04,372 INFO L87 Difference]: Start difference. First operand 119 states and 134 transitions. Second operand has 14 states, 14 states have (on average 4.5) internal successors, (63), 14 states have internal predecessors, (63), 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-09 05:53:04,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:53:04,632 INFO L93 Difference]: Finished difference Result 221 states and 261 transitions. [2025-03-09 05:53:04,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-09 05:53:04,632 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.5) internal successors, (63), 14 states have internal predecessors, (63), 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 73 [2025-03-09 05:53:04,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:53:04,633 INFO L225 Difference]: With dead ends: 221 [2025-03-09 05:53:04,633 INFO L226 Difference]: Without dead ends: 154 [2025-03-09 05:53:04,634 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=330, Invalid=792, Unknown=0, NotChecked=0, Total=1122 [2025-03-09 05:53:04,635 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 9 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 05:53:04,635 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 321 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 05:53:04,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2025-03-09 05:53:04,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2025-03-09 05:53:04,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 144 states have (on average 1.1111111111111112) internal successors, (160), 147 states have internal predecessors, (160), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-09 05:53:04,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 169 transitions. [2025-03-09 05:53:04,641 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 169 transitions. Word has length 73 [2025-03-09 05:53:04,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:53:04,642 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 169 transitions. [2025-03-09 05:53:04,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.5) internal successors, (63), 14 states have internal predecessors, (63), 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-09 05:53:04,642 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 169 transitions. [2025-03-09 05:53:04,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-09 05:53:04,642 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:53:04,643 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:53:04,652 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-09 05:53:04,847 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,SelfDestructingSolverStorable16 [2025-03-09 05:53:04,847 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 31 more)] === [2025-03-09 05:53:04,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:53:04,848 INFO L85 PathProgramCache]: Analyzing trace with hash -2006007149, now seen corresponding path program 1 times [2025-03-09 05:53:04,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:53:04,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767692778] [2025-03-09 05:53:04,848 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:53:04,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:53:04,898 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-09 05:53:05,120 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-09 05:53:05,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:53:05,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 05:53:05,120 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 05:53:05,130 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-09 05:53:05,271 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-09 05:53:05,271 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:53:05,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 05:53:05,326 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 05:53:05,326 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-09 05:53:05,327 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE (33 of 34 remaining) [2025-03-09 05:53:05,329 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (32 of 34 remaining) [2025-03-09 05:53:05,329 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (31 of 34 remaining) [2025-03-09 05:53:05,329 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (30 of 34 remaining) [2025-03-09 05:53:05,329 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 34 remaining) [2025-03-09 05:53:05,329 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 34 remaining) [2025-03-09 05:53:05,329 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 34 remaining) [2025-03-09 05:53:05,329 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 34 remaining) [2025-03-09 05:53:05,330 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 34 remaining) [2025-03-09 05:53:05,330 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 34 remaining) [2025-03-09 05:53:05,330 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 34 remaining) [2025-03-09 05:53:05,330 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 34 remaining) [2025-03-09 05:53:05,330 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 34 remaining) [2025-03-09 05:53:05,330 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 34 remaining) [2025-03-09 05:53:05,330 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 34 remaining) [2025-03-09 05:53:05,331 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 34 remaining) [2025-03-09 05:53:05,331 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 34 remaining) [2025-03-09 05:53:05,331 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 34 remaining) [2025-03-09 05:53:05,331 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 34 remaining) [2025-03-09 05:53:05,331 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 34 remaining) [2025-03-09 05:53:05,331 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 34 remaining) [2025-03-09 05:53:05,331 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONUNSUPPORTED_FEATURE (12 of 34 remaining) [2025-03-09 05:53:05,331 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 34 remaining) [2025-03-09 05:53:05,331 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 34 remaining) [2025-03-09 05:53:05,331 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 34 remaining) [2025-03-09 05:53:05,331 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 34 remaining) [2025-03-09 05:53:05,332 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 34 remaining) [2025-03-09 05:53:05,332 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 34 remaining) [2025-03-09 05:53:05,332 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 34 remaining) [2025-03-09 05:53:05,332 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 34 remaining) [2025-03-09 05:53:05,332 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 34 remaining) [2025-03-09 05:53:05,332 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 34 remaining) [2025-03-09 05:53:05,332 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 34 remaining) [2025-03-09 05:53:05,332 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 34 remaining) [2025-03-09 05:53:05,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-09 05:53:05,335 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:53:05,411 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-09 05:53:05,413 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.03 05:53:05 BoogieIcfgContainer [2025-03-09 05:53:05,413 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-09 05:53:05,414 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-09 05:53:05,414 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-09 05:53:05,415 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-09 05:53:05,415 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 05:52:54" (3/4) ... [2025-03-09 05:53:05,416 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-09 05:53:05,417 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-09 05:53:05,418 INFO L158 Benchmark]: Toolchain (without parser) took 12901.02ms. Allocated memory was 201.3MB in the beginning and 385.9MB in the end (delta: 184.5MB). Free memory was 151.3MB in the beginning and 243.9MB in the end (delta: -92.6MB). Peak memory consumption was 94.3MB. Max. memory is 16.1GB. [2025-03-09 05:53:05,418 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 201.3MB. Free memory is still 119.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 05:53:05,418 INFO L158 Benchmark]: CACSL2BoogieTranslator took 818.96ms. Allocated memory is still 201.3MB. Free memory was 150.9MB in the beginning and 70.9MB in the end (delta: 80.0MB). Peak memory consumption was 83.9MB. Max. memory is 16.1GB. [2025-03-09 05:53:05,419 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.66ms. Allocated memory is still 201.3MB. Free memory was 70.5MB in the beginning and 62.9MB in the end (delta: 7.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 05:53:05,419 INFO L158 Benchmark]: Boogie Preprocessor took 87.32ms. Allocated memory is still 201.3MB. Free memory was 62.9MB in the beginning and 56.4MB in the end (delta: 6.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 05:53:05,419 INFO L158 Benchmark]: IcfgBuilder took 898.03ms. Allocated memory is still 201.3MB. Free memory was 56.4MB in the beginning and 73.8MB in the end (delta: -17.5MB). Peak memory consumption was 20.1MB. Max. memory is 16.1GB. [2025-03-09 05:53:05,420 INFO L158 Benchmark]: TraceAbstraction took 11027.02ms. Allocated memory was 201.3MB in the beginning and 385.9MB in the end (delta: 184.5MB). Free memory was 72.8MB in the beginning and 244.0MB in the end (delta: -171.1MB). Peak memory consumption was 15.5MB. Max. memory is 16.1GB. [2025-03-09 05:53:05,420 INFO L158 Benchmark]: Witness Printer took 2.67ms. Allocated memory is still 385.9MB. Free memory was 244.0MB in the beginning and 243.9MB in the end (delta: 75.0kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 05:53:05,422 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.25ms. Allocated memory is still 201.3MB. Free memory is still 119.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 818.96ms. Allocated memory is still 201.3MB. Free memory was 150.9MB in the beginning and 70.9MB in the end (delta: 80.0MB). Peak memory consumption was 83.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 61.66ms. Allocated memory is still 201.3MB. Free memory was 70.5MB in the beginning and 62.9MB in the end (delta: 7.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 87.32ms. Allocated memory is still 201.3MB. Free memory was 62.9MB in the beginning and 56.4MB in the end (delta: 6.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 898.03ms. Allocated memory is still 201.3MB. Free memory was 56.4MB in the beginning and 73.8MB in the end (delta: -17.5MB). Peak memory consumption was 20.1MB. Max. memory is 16.1GB. * TraceAbstraction took 11027.02ms. Allocated memory was 201.3MB in the beginning and 385.9MB in the end (delta: 184.5MB). Free memory was 72.8MB in the beginning and 244.0MB in the end (delta: -171.1MB). Peak memory consumption was 15.5MB. Max. memory is 16.1GB. * Witness Printer took 2.67ms. Allocated memory is still 385.9MB. Free memory was 244.0MB in the beginning and 243.9MB in the end (delta: 75.0kB). There was no memory consumed. 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: 2339]: 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 fflush at line 2339. Possible FailurePath: [L2229] static const char *applet_name; [L2230] static signed int bb_errno_location; [L2231] static signed int * const bb_errno = &bb_errno_location; [L2232] static struct __jmp_buf_tag die_jmp[1l]; [L2233] static signed int die_sleep; [L2234] static signed char logmode = (signed char)1; [L2235] static const char *msg_eol = "\n"; [L2236] static unsigned char xfunc_error_retval = (unsigned char)1; [L2426] static struct utmp dummy_utmp; VAL [applet_name={0:0}, bb_errno={7:0}, bb_errno_location={7:0}, die_sleep=0, dummy_utmp={8:0}, logmode=1, msg_eol={3:0}, xfunc_error_retval=1] [L2489] char *a = malloc(11); [L2490] a[10] = 0 [L2491] int i=0; VAL [a={-1:0}, applet_name={0:0}, bb_errno={7:0}, bb_errno_location={7:0}, die_sleep=0, dummy_utmp={8:0}, i=0, logmode=1, msg_eol={3:0}, xfunc_error_retval=1] [L2491] COND TRUE i<10 [L2492] a[i]=__VERIFIER_nondet_char() VAL [a={-1:0}, applet_name={0:0}, bb_errno={7:0}, bb_errno_location={7:0}, die_sleep=0, dummy_utmp={8:0}, i=0, logmode=1, msg_eol={3:0}, xfunc_error_retval=1] [L2491] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno={7:0}, bb_errno_location={7:0}, die_sleep=0, dummy_utmp={8:0}, i=1, logmode=1, msg_eol={3:0}, xfunc_error_retval=1] [L2491] COND TRUE i<10 [L2492] a[i]=__VERIFIER_nondet_char() VAL [a={-1:0}, applet_name={0:0}, bb_errno={7:0}, bb_errno_location={7:0}, die_sleep=0, dummy_utmp={8:0}, i=1, logmode=1, msg_eol={3:0}, xfunc_error_retval=1] [L2491] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno={7:0}, bb_errno_location={7:0}, die_sleep=0, dummy_utmp={8:0}, i=2, logmode=1, msg_eol={3:0}, xfunc_error_retval=1] [L2491] COND TRUE i<10 [L2492] a[i]=__VERIFIER_nondet_char() VAL [a={-1:0}, applet_name={0:0}, bb_errno={7:0}, bb_errno_location={7:0}, die_sleep=0, dummy_utmp={8:0}, i=2, logmode=1, msg_eol={3:0}, xfunc_error_retval=1] [L2491] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno={7:0}, bb_errno_location={7:0}, die_sleep=0, dummy_utmp={8:0}, i=3, logmode=1, msg_eol={3:0}, xfunc_error_retval=1] [L2491] COND TRUE i<10 [L2492] a[i]=__VERIFIER_nondet_char() VAL [a={-1:0}, applet_name={0:0}, bb_errno={7:0}, bb_errno_location={7:0}, die_sleep=0, dummy_utmp={8:0}, i=3, logmode=1, msg_eol={3:0}, xfunc_error_retval=1] [L2491] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno={7:0}, bb_errno_location={7:0}, die_sleep=0, dummy_utmp={8:0}, i=4, logmode=1, msg_eol={3:0}, xfunc_error_retval=1] [L2491] COND TRUE i<10 [L2492] a[i]=__VERIFIER_nondet_char() VAL [a={-1:0}, applet_name={0:0}, bb_errno={7:0}, bb_errno_location={7:0}, die_sleep=0, dummy_utmp={8:0}, i=4, logmode=1, msg_eol={3:0}, xfunc_error_retval=1] [L2491] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno={7:0}, bb_errno_location={7:0}, die_sleep=0, dummy_utmp={8:0}, i=5, logmode=1, msg_eol={3:0}, xfunc_error_retval=1] [L2491] COND TRUE i<10 [L2492] a[i]=__VERIFIER_nondet_char() VAL [a={-1:0}, applet_name={0:0}, bb_errno={7:0}, bb_errno_location={7:0}, die_sleep=0, dummy_utmp={8:0}, i=5, logmode=1, msg_eol={3:0}, xfunc_error_retval=1] [L2491] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno={7:0}, bb_errno_location={7:0}, die_sleep=0, dummy_utmp={8:0}, i=6, logmode=1, msg_eol={3:0}, xfunc_error_retval=1] [L2491] COND TRUE i<10 [L2492] a[i]=__VERIFIER_nondet_char() VAL [a={-1:0}, applet_name={0:0}, bb_errno={7:0}, bb_errno_location={7:0}, die_sleep=0, dummy_utmp={8:0}, i=6, logmode=1, msg_eol={3:0}, xfunc_error_retval=1] [L2491] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno={7:0}, bb_errno_location={7:0}, die_sleep=0, dummy_utmp={8:0}, i=7, logmode=1, msg_eol={3:0}, xfunc_error_retval=1] [L2491] COND TRUE i<10 [L2492] a[i]=__VERIFIER_nondet_char() VAL [a={-1:0}, applet_name={0:0}, bb_errno={7:0}, bb_errno_location={7:0}, die_sleep=0, dummy_utmp={8:0}, i=7, logmode=1, msg_eol={3:0}, xfunc_error_retval=1] [L2491] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno={7:0}, bb_errno_location={7:0}, die_sleep=0, dummy_utmp={8:0}, i=8, logmode=1, msg_eol={3:0}, xfunc_error_retval=1] [L2491] COND TRUE i<10 [L2492] a[i]=__VERIFIER_nondet_char() VAL [a={-1:0}, applet_name={0:0}, bb_errno={7:0}, bb_errno_location={7:0}, die_sleep=0, dummy_utmp={8:0}, i=8, logmode=1, msg_eol={3:0}, xfunc_error_retval=1] [L2491] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno={7:0}, bb_errno_location={7:0}, die_sleep=0, dummy_utmp={8:0}, i=9, logmode=1, msg_eol={3:0}, xfunc_error_retval=1] [L2491] COND TRUE i<10 [L2492] a[i]=__VERIFIER_nondet_char() VAL [a={-1:0}, applet_name={0:0}, bb_errno={7:0}, bb_errno_location={7:0}, die_sleep=0, dummy_utmp={8:0}, i=9, logmode=1, msg_eol={3:0}, xfunc_error_retval=1] [L2491] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno={7:0}, bb_errno_location={7:0}, die_sleep=0, dummy_utmp={8:0}, i=10, logmode=1, msg_eol={3:0}, xfunc_error_retval=1] [L2491] COND FALSE !(i<10) [L2493] applet_name = a [L2494] bb_errno_location = __VERIFIER_nondet_int() [L2495] optind = 1 [L2496] int argc = __VERIFIER_nondet_int(); [L2497] 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}, die_sleep=0, dummy_utmp={8:0}, logmode=1, msg_eol={3:0}, optind=1, xfunc_error_retval=1] [L9] COND FALSE !(!cond) VAL [\old(cond)=1, applet_name={-1:0}, bb_errno={7:0}, bb_errno_location={7:0}, die_sleep=0, dummy_utmp={8:0}, logmode=1, msg_eol={3:0}, optind=1, xfunc_error_retval=1] [L2497] RET assume_abort_if_not(argc >= 1 && argc <= 10000) VAL [applet_name={-1:0}, argc=1, bb_errno={7:0}, bb_errno_location={7:0}, die_sleep=0, dummy_utmp={8:0}, logmode=1, msg_eol={3:0}, optind=1, xfunc_error_retval=1] [L2498] EXPR argc+1 [L2498] char **argv=malloc((argc+1)*sizeof(char*)); [L2499] EXPR argc+1 [L2499] char **mem_track=malloc((argc+1)*sizeof(char*)); [L2500] argv[argc]=0 [L2501] int i=0; VAL [applet_name={-1:0}, argc=1, argv={-13:0}, bb_errno={7:0}, bb_errno_location={7:0}, die_sleep=0, dummy_utmp={8:0}, i=0, logmode=1, mem_track={-14:0}, msg_eol={3:0}, optind=1, xfunc_error_retval=1] [L2501] COND TRUE i 0 && size < bufsize) VAL [\old(cond)=1, applet_name={-1:0}, bb_errno={7:0}, bb_errno_location={7:0}, die_sleep=0, dummy_utmp={8:0}, logmode=1, msg_eol={3:0}, optind=1, xfunc_error_retval=1] [L9] COND FALSE !(!cond) VAL [\old(cond)=1, applet_name={-1:0}, bb_errno={7:0}, bb_errno_location={7:0}, die_sleep=0, dummy_utmp={8:0}, logmode=1, msg_eol={3:0}, optind=1, xfunc_error_retval=1] [L2414] RET assume_abort_if_not(size > 0 && size < bufsize) VAL [applet_name={-1:0}, bb_errno={7:0}, bb_errno_location={7:0}, buf={331:0}, bufsize=64, die_sleep=0, dummy_utmp={8:0}, logmode=1, msg_eol={3:0}, optind=1, size=1, xfunc_error_retval=1] [L2415] int i = 0; VAL [applet_name={-1:0}, bb_errno={7:0}, bb_errno_location={7:0}, buf={331:0}, bufsize=64, die_sleep=0, dummy_utmp={8:0}, i=0, logmode=1, msg_eol={3:0}, optind=1, size=1, xfunc_error_retval=1] [L2415] COND TRUE i < size [L2416] buf[i] = __VERIFIER_nondet_char() [L2415] ++i VAL [applet_name={-1:0}, bb_errno={7:0}, bb_errno_location={7:0}, buf={331:0}, bufsize=64, die_sleep=0, dummy_utmp={8:0}, i=1, logmode=1, msg_eol={3:0}, optind=1, size=1, xfunc_error_retval=1] [L2415] COND FALSE !(i < size) [L2418] buf[size] = '\0' [L2419] return 0; VAL [\result=0, applet_name={-1:0}, bb_errno={7:0}, bb_errno_location={7:0}, bufsize=64, die_sleep=0, dummy_utmp={8:0}, logmode=1, msg_eol={3:0}, optind=1, xfunc_error_retval=1] [L2369] RET, EXPR getlogin_r(buf, sizeof(char [64l]) ) [L2369] return_value_getlogin_r$2=getlogin_r(buf, sizeof(char [64l]) ) [L2370] COND TRUE return_value_getlogin_r$2 == 0 [L2373] signed int return_value_fflush_all$1; VAL [applet_name={-1:0}, bb_errno={7:0}, bb_errno_location={7:0}, die_sleep=0, dummy_utmp={8:0}, logmode=1, msg_eol={3:0}, optind=1, xfunc_error_retval=1] [L2374] CALL fflush_all() VAL [applet_name={-1:0}, bb_errno={7:0}, bb_errno_location={7:0}, die_sleep=0, dummy_utmp={8:0}, logmode=1, msg_eol={3:0}, optind=1, xfunc_error_retval=1] [L2338] signed int return_value_fflush$1; VAL [applet_name={-1:0}, bb_errno={7:0}, bb_errno_location={7:0}, die_sleep=0, dummy_utmp={8:0}, logmode=1, msg_eol={3:0}, optind=1, xfunc_error_retval=1] [L2339] fflush((struct _IO_FILE *)((void *)0)) VAL [applet_name={-1:0}, bb_errno={7:0}, bb_errno_location={7:0}, die_sleep=0, dummy_utmp={8:0}, logmode=1, msg_eol={3:0}, optind=1, xfunc_error_retval=1] - UnprovableResult [Line: 2510]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 2510]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 2355]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 2355]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 2298]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 2298]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 2325]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 2325]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 2318]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 2318]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 2315]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 2315]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 2309]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 2309]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 2308]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 2308]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 2306]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 2306]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 2290]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 2290]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 932]: 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: 2415]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 2415]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 2501]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 2501]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 2506]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 2506]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 2499]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 2499]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 2498]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 2498]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 2491]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 2491]: 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 4 procedures, 159 locations, 210 edges, 34 error locations. Started 1 CEGAR loops. OverallTime: 10.9s, OverallIterations: 18, TraceHistogramMax: 10, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 194 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 185 mSDsluCounter, 2962 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1923 mSDsCounter, 23 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 525 IncrementalHoareTripleChecker+Invalid, 548 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 23 mSolverCounterUnsat, 1039 mSDtfsCounter, 525 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 719 GetRequests, 630 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=159occurred in iteration=0, InterpolantAutomatonStates: 102, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 17 MinimizatonAttempts, 8 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 2.0s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 1147 NumberOfCodeBlocks, 1135 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 1249 ConstructedInterpolants, 0 QuantifiedInterpolants, 1719 SizeOfPredicates, 1 NumberOfNonLiveVariables, 11496 ConjunctsInSsa, 43 ConjunctsInUnsatCore, 32 InterpolantComputations, 12 PerfectInterpolantSequences, 2838/3013 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-09 05:53:05,442 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with 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/logname-1.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 c974ed4f1d4c3d5b838cbfadb19eec8f0977d5398d9ade006a615b896bd7b5af --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 05:53:07,387 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 05:53:07,493 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Bitvector.epf [2025-03-09 05:53:07,500 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 05:53:07,500 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 05:53:07,500 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2025-03-09 05:53:07,525 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 05:53:07,525 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 05:53:07,525 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 05:53:07,526 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 05:53:07,526 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 05:53:07,526 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 05:53:07,526 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 05:53:07,526 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 05:53:07,526 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 05:53:07,526 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 05:53:07,526 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 05:53:07,528 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-09 05:53:07,529 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 05:53:07,529 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-09 05:53:07,529 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 05:53:07,529 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-09 05:53:07,529 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-09 05:53:07,529 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-09 05:53:07,529 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-09 05:53:07,529 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-09 05:53:07,529 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 05:53:07,530 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-09 05:53:07,530 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 05:53:07,530 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 05:53:07,530 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 05:53:07,530 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 05:53:07,530 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 05:53:07,530 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 05:53:07,530 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 05:53:07,530 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 05:53:07,530 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 05:53:07,531 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-09 05:53:07,531 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-09 05:53:07,531 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-09 05:53:07,531 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-09 05:53:07,531 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 05:53:07,531 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 05:53:07,531 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 05:53:07,531 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 05:53:07,531 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 -> c974ed4f1d4c3d5b838cbfadb19eec8f0977d5398d9ade006a615b896bd7b5af [2025-03-09 05:53:07,801 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 05:53:07,806 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 05:53:07,807 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 05:53:07,808 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 05:53:07,808 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 05:53:07,809 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/busybox-1.22.0/logname-1.i [2025-03-09 05:53:08,963 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a17d0477/a4c7b91fd1a64ab9ae9c1bcec21bab73/FLAG035178603 [2025-03-09 05:53:09,315 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 05:53:09,316 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/logname-1.i [2025-03-09 05:53:09,334 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a17d0477/a4c7b91fd1a64ab9ae9c1bcec21bab73/FLAG035178603 [2025-03-09 05:53:09,347 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a17d0477/a4c7b91fd1a64ab9ae9c1bcec21bab73 [2025-03-09 05:53:09,349 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 05:53:09,352 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 05:53:09,353 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 05:53:09,353 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 05:53:09,356 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 05:53:09,356 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 05:53:09" (1/1) ... [2025-03-09 05:53:09,357 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29972f91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:53:09, skipping insertion in model container [2025-03-09 05:53:09,357 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 05:53:09" (1/1) ... [2025-03-09 05:53:09,396 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 05:53:09,983 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-09 05:53:09,985 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-09 05:53:09,987 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-09 05:53:09,987 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-09 05:53:09,989 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-09 05:53:09,990 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-09 05:53:09,991 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-09 05:53:09,991 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-09 05:53:09,993 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-09 05:53:09,996 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-09 05:53:09,997 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-09 05:53:10,001 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-09 05:53:10,002 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-09 05:53:10,005 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-09 05:53:10,017 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-09 05:53:10,027 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-09 05:53:10,036 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 05:53:10,060 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 05:53:10,157 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 05:53:10,293 WARN L1212 FunctionHandler]: The following functions are not defined or handled internally: vasprintf [2025-03-09 05:53:10,301 INFO L204 MainTranslator]: Completed translation [2025-03-09 05:53:10,302 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:53:10 WrapperNode [2025-03-09 05:53:10,302 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 05:53:10,303 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 05:53:10,303 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 05:53:10,303 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 05:53:10,307 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:53:10" (1/1) ... [2025-03-09 05:53:10,333 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:53:10" (1/1) ... [2025-03-09 05:53:10,397 INFO L138 Inliner]: procedures = 605, calls = 490, calls flagged for inlining = 16, calls inlined = 14, statements flattened = 781 [2025-03-09 05:53:10,398 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 05:53:10,398 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 05:53:10,398 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 05:53:10,398 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 05:53:10,404 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:53:10" (1/1) ... [2025-03-09 05:53:10,404 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:53:10" (1/1) ... [2025-03-09 05:53:10,412 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:53:10" (1/1) ... [2025-03-09 05:53:10,423 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-03-09 05:53:10,424 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:53:10" (1/1) ... [2025-03-09 05:53:10,424 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:53:10" (1/1) ... [2025-03-09 05:53:10,456 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:53:10" (1/1) ... [2025-03-09 05:53:10,458 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:53:10" (1/1) ... [2025-03-09 05:53:10,472 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:53:10" (1/1) ... [2025-03-09 05:53:10,479 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:53:10" (1/1) ... [2025-03-09 05:53:10,492 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 05:53:10,493 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 05:53:10,493 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 05:53:10,493 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 05:53:10,495 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:53:10" (1/1) ... [2025-03-09 05:53:10,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 05:53:10,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:53:10,526 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-09 05:53:10,529 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-09 05:53:10,547 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-09 05:53:10,547 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2 [2025-03-09 05:53:10,547 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2025-03-09 05:53:10,547 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2025-03-09 05:53:10,547 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-09 05:53:10,547 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 05:53:10,547 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-03-09 05:53:10,547 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE2 [2025-03-09 05:53:10,547 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE4 [2025-03-09 05:53:10,547 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE1 [2025-03-09 05:53:10,550 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 05:53:10,550 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 05:53:10,550 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2025-03-09 05:53:10,550 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy [2025-03-09 05:53:10,550 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy [2025-03-09 05:53:10,551 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2025-03-09 05:53:10,551 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2025-03-09 05:53:10,551 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2025-03-09 05:53:10,551 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-09 05:53:10,551 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-09 05:53:10,551 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-09 05:53:10,551 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-03-09 05:53:10,551 INFO L130 BoogieDeclarations]: Found specification of procedure fflush_all [2025-03-09 05:53:10,551 INFO L138 BoogieDeclarations]: Found implementation of procedure fflush_all [2025-03-09 05:53:10,551 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2025-03-09 05:53:10,551 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2025-03-09 05:53:10,551 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2025-03-09 05:53:10,551 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2 [2025-03-09 05:53:10,551 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1 [2025-03-09 05:53:10,864 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 05:53:10,865 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 05:53:11,813 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2406: havoc getlogin_r_~ret~0#1; [2025-03-09 05:53:11,814 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2371: havoc __main_~return_value_fflush_all$1~0#1; [2025-03-09 05:53:11,866 INFO L? ?]: Removed 202 outVars from TransFormulas that were not future-live. [2025-03-09 05:53:11,867 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 05:53:11,875 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 05:53:11,875 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 05:53:11,875 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 05:53:11 BoogieIcfgContainer [2025-03-09 05:53:11,875 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 05:53:11,877 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 05:53:11,877 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 05:53:11,880 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 05:53:11,881 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 05:53:09" (1/3) ... [2025-03-09 05:53:11,881 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a511919 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 05:53:11, skipping insertion in model container [2025-03-09 05:53:11,881 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:53:10" (2/3) ... [2025-03-09 05:53:11,881 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a511919 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 05:53:11, skipping insertion in model container [2025-03-09 05:53:11,881 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 05:53:11" (3/3) ... [2025-03-09 05:53:11,882 INFO L128 eAbstractionObserver]: Analyzing ICFG logname-1.i [2025-03-09 05:53:11,893 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 05:53:11,894 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG logname-1.i that has 4 procedures, 156 locations, 1 initial locations, 12 loop locations, and 34 error locations. [2025-03-09 05:53:11,935 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 05:53:11,945 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;@28892ca9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 05:53:11,945 INFO L334 AbstractCegarLoop]: Starting to check reachability of 34 error locations. [2025-03-09 05:53:11,952 INFO L276 IsEmpty]: Start isEmpty. Operand has 156 states, 108 states have (on average 1.6203703703703705) internal successors, (175), 142 states have internal predecessors, (175), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-09 05:53:11,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-09 05:53:11,956 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:53:11,956 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-09 05:53:11,957 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 31 more)] === [2025-03-09 05:53:11,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:53:11,960 INFO L85 PathProgramCache]: Analyzing trace with hash 7171647, now seen corresponding path program 1 times [2025-03-09 05:53:11,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 05:53:11,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1561320573] [2025-03-09 05:53:11,972 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:53:11,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:53:11,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:53:11,975 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 05:53:11,977 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-09 05:53:12,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-09 05:53:12,571 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-09 05:53:12,572 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:53:12,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:53:12,635 INFO L256 TraceCheckSpWp]: Trace formula consists of 457 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-09 05:53:12,637 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 05:53:12,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 05:53:12,643 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 05:53:12,643 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 05:53:12,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1561320573] [2025-03-09 05:53:12,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1561320573] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:53:12,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:53:12,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-09 05:53:12,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462354941] [2025-03-09 05:53:12,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:53:12,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-09 05:53:12,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 05:53:12,660 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-09 05:53:12,661 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-09 05:53:12,662 INFO L87 Difference]: Start difference. First operand has 156 states, 108 states have (on average 1.6203703703703705) internal successors, (175), 142 states have internal predecessors, (175), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 1 states have (on average 4.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-09 05:53:12,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:53:12,677 INFO L93 Difference]: Finished difference Result 206 states and 270 transitions. [2025-03-09 05:53:12,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-09 05:53:12,679 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 4.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-09 05:53:12,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:53:12,683 INFO L225 Difference]: With dead ends: 206 [2025-03-09 05:53:12,683 INFO L226 Difference]: Without dead ends: 56 [2025-03-09 05:53:12,685 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 3 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-09 05:53:12,687 INFO L435 NwaCegarLoop]: 68 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, 68 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-09 05:53:12,687 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 05:53:12,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-03-09 05:53:12,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2025-03-09 05:53:12,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 42 states have (on average 1.380952380952381) internal successors, (58), 49 states have internal predecessors, (58), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-09 05:53:12,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 67 transitions. [2025-03-09 05:53:12,713 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 67 transitions. Word has length 4 [2025-03-09 05:53:12,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:53:12,713 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 67 transitions. [2025-03-09 05:53:12,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 4.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-09 05:53:12,713 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 67 transitions. [2025-03-09 05:53:12,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-09 05:53:12,714 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:53:12,714 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-09 05:53:12,740 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-09 05:53:12,916 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-09 05:53:12,916 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 31 more)] === [2025-03-09 05:53:12,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:53:12,917 INFO L85 PathProgramCache]: Analyzing trace with hash 222321224, now seen corresponding path program 1 times [2025-03-09 05:53:12,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 05:53:12,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [51439104] [2025-03-09 05:53:12,918 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:53:12,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:53:12,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:53:12,920 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 05:53:12,922 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-09 05:53:13,072 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 05:53:13,464 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 05:53:13,464 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:53:13,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:53:13,527 INFO L256 TraceCheckSpWp]: Trace formula consists of 458 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-09 05:53:13,528 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 05:53:13,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 05:53:13,543 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 05:53:13,544 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 05:53:13,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [51439104] [2025-03-09 05:53:13,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [51439104] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:53:13,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:53:13,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 05:53:13,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943652060] [2025-03-09 05:53:13,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:53:13,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 05:53:13,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 05:53:13,545 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 05:53:13,545 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 05:53:13,545 INFO L87 Difference]: Start difference. First operand 56 states and 67 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 05:53:13,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:53:13,576 INFO L93 Difference]: Finished difference Result 110 states and 132 transitions. [2025-03-09 05:53:13,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 05:53:13,577 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-03-09 05:53:13,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:53:13,578 INFO L225 Difference]: With dead ends: 110 [2025-03-09 05:53:13,578 INFO L226 Difference]: Without dead ends: 59 [2025-03-09 05:53:13,578 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 05:53:13,579 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 0 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 125 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-09 05:53:13,579 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 125 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 05:53:13,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2025-03-09 05:53:13,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2025-03-09 05:53:13,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 45 states have (on average 1.3555555555555556) internal successors, (61), 52 states have internal predecessors, (61), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-09 05:53:13,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 70 transitions. [2025-03-09 05:53:13,588 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 70 transitions. Word has length 5 [2025-03-09 05:53:13,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:53:13,588 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 70 transitions. [2025-03-09 05:53:13,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 05:53:13,588 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 70 transitions. [2025-03-09 05:53:13,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-09 05:53:13,588 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:53:13,588 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2025-03-09 05:53:13,614 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-09 05:53:13,788 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-09 05:53:13,789 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 31 more)] === [2025-03-09 05:53:13,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:53:13,789 INFO L85 PathProgramCache]: Analyzing trace with hash 332183489, now seen corresponding path program 1 times [2025-03-09 05:53:13,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 05:53:13,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [173398166] [2025-03-09 05:53:13,790 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:53:13,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:53:13,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:53:13,793 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 05:53:13,794 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-09 05:53:13,938 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 05:53:14,410 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 05:53:14,411 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:53:14,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:53:14,477 INFO L256 TraceCheckSpWp]: Trace formula consists of 471 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 05:53:14,478 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 05:53:14,504 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 05:53:14,504 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 05:53:14,538 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 05:53:14,539 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 05:53:14,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [173398166] [2025-03-09 05:53:14,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [173398166] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 05:53:14,539 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-09 05:53:14,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2025-03-09 05:53:14,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664922790] [2025-03-09 05:53:14,539 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-09 05:53:14,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 05:53:14,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 05:53:14,540 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 05:53:14,540 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-09 05:53:14,540 INFO L87 Difference]: Start difference. First operand 59 states and 70 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 05:53:14,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:53:14,623 INFO L93 Difference]: Finished difference Result 113 states and 137 transitions. [2025-03-09 05:53:14,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 05:53:14,626 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-03-09 05:53:14,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:53:14,626 INFO L225 Difference]: With dead ends: 113 [2025-03-09 05:53:14,626 INFO L226 Difference]: Without dead ends: 62 [2025-03-09 05:53:14,627 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 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-09 05:53:14,627 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 0 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 05:53:14,628 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 245 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 05:53:14,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2025-03-09 05:53:14,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 59. [2025-03-09 05:53:14,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 46 states have (on average 1.326086956521739) internal successors, (61), 52 states have internal predecessors, (61), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-09 05:53:14,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 70 transitions. [2025-03-09 05:53:14,635 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 70 transitions. Word has length 8 [2025-03-09 05:53:14,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:53:14,635 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 70 transitions. [2025-03-09 05:53:14,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 05:53:14,635 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 70 transitions. [2025-03-09 05:53:14,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-09 05:53:14,635 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:53:14,635 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:53:14,663 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-09 05:53:14,836 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-09 05:53:14,836 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 31 more)] === [2025-03-09 05:53:14,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:53:14,836 INFO L85 PathProgramCache]: Analyzing trace with hash 1574277481, now seen corresponding path program 1 times [2025-03-09 05:53:14,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 05:53:14,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [860690753] [2025-03-09 05:53:14,837 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:53:14,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:53:14,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:53:14,839 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 05:53:14,840 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-09 05:53:14,965 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-09 05:53:15,360 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-09 05:53:15,360 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:53:15,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:53:15,421 INFO L256 TraceCheckSpWp]: Trace formula consists of 494 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 05:53:15,422 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 05:53:15,463 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-09 05:53:15,463 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 05:53:15,463 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 05:53:15,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [860690753] [2025-03-09 05:53:15,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [860690753] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:53:15,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:53:15,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 05:53:15,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839159340] [2025-03-09 05:53:15,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:53:15,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 05:53:15,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 05:53:15,465 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 05:53:15,465 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 05:53:15,465 INFO L87 Difference]: Start difference. First operand 59 states and 70 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 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-09 05:53:15,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:53:15,660 INFO L93 Difference]: Finished difference Result 59 states and 70 transitions. [2025-03-09 05:53:15,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 05:53:15,661 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 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 16 [2025-03-09 05:53:15,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:53:15,661 INFO L225 Difference]: With dead ends: 59 [2025-03-09 05:53:15,661 INFO L226 Difference]: Without dead ends: 57 [2025-03-09 05:53:15,662 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 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-09 05:53:15,662 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 43 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 05:53:15,662 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 161 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 05:53:15,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-03-09 05:53:15,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2025-03-09 05:53:15,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 46 states have (on average 1.2826086956521738) internal successors, (59), 50 states have internal predecessors, (59), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-09 05:53:15,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 68 transitions. [2025-03-09 05:53:15,668 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 68 transitions. Word has length 16 [2025-03-09 05:53:15,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:53:15,669 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 68 transitions. [2025-03-09 05:53:15,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 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-09 05:53:15,669 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 68 transitions. [2025-03-09 05:53:15,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-09 05:53:15,669 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:53:15,669 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:53:15,696 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-09 05:53:15,869 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-09 05:53:15,870 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 31 more)] === [2025-03-09 05:53:15,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:53:15,870 INFO L85 PathProgramCache]: Analyzing trace with hash 475218687, now seen corresponding path program 1 times [2025-03-09 05:53:15,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 05:53:15,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1243643169] [2025-03-09 05:53:15,871 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:53:15,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:53:15,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:53:15,872 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 05:53:15,873 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-09 05:53:16,008 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-09 05:53:16,429 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-09 05:53:16,430 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:53:16,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:53:16,497 INFO L256 TraceCheckSpWp]: Trace formula consists of 557 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-09 05:53:16,498 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 05:53:16,508 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-09 05:53:16,508 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 05:53:16,508 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 05:53:16,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1243643169] [2025-03-09 05:53:16,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1243643169] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:53:16,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:53:16,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 05:53:16,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801277719] [2025-03-09 05:53:16,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:53:16,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 05:53:16,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 05:53:16,509 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 05:53:16,509 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 05:53:16,509 INFO L87 Difference]: Start difference. First operand 57 states and 68 transitions. Second operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 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-09 05:53:16,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:53:16,621 INFO L93 Difference]: Finished difference Result 65 states and 78 transitions. [2025-03-09 05:53:16,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 05:53:16,622 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 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 22 [2025-03-09 05:53:16,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:53:16,623 INFO L225 Difference]: With dead ends: 65 [2025-03-09 05:53:16,623 INFO L226 Difference]: Without dead ends: 64 [2025-03-09 05:53:16,623 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 05:53:16,624 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 4 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 115 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-09 05:53:16,624 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 115 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 05:53:16,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2025-03-09 05:53:16,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 63. [2025-03-09 05:53:16,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 52 states have (on average 1.3076923076923077) internal successors, (68), 56 states have internal predecessors, (68), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-09 05:53:16,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 77 transitions. [2025-03-09 05:53:16,627 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 77 transitions. Word has length 22 [2025-03-09 05:53:16,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:53:16,627 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 77 transitions. [2025-03-09 05:53:16,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 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-09 05:53:16,628 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 77 transitions. [2025-03-09 05:53:16,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-09 05:53:16,628 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:53:16,628 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:53:16,655 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-09 05:53:16,828 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-09 05:53:16,829 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 31 more)] === [2025-03-09 05:53:16,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:53:16,829 INFO L85 PathProgramCache]: Analyzing trace with hash 475223652, now seen corresponding path program 1 times [2025-03-09 05:53:16,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 05:53:16,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1543366009] [2025-03-09 05:53:16,830 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:53:16,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:53:16,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:53:16,831 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 05:53:16,832 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-09 05:53:16,976 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-09 05:53:17,416 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-09 05:53:17,416 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:53:17,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:53:17,487 INFO L256 TraceCheckSpWp]: Trace formula consists of 568 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-09 05:53:17,488 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 05:53:17,501 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-09 05:53:17,501 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 05:53:17,501 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 05:53:17,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1543366009] [2025-03-09 05:53:17,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1543366009] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:53:17,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:53:17,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 05:53:17,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25616476] [2025-03-09 05:53:17,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:53:17,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 05:53:17,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 05:53:17,502 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 05:53:17,502 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 05:53:17,502 INFO L87 Difference]: Start difference. First operand 63 states and 77 transitions. Second operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 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-09 05:53:17,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:53:17,532 INFO L93 Difference]: Finished difference Result 114 states and 141 transitions. [2025-03-09 05:53:17,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 05:53:17,532 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 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 22 [2025-03-09 05:53:17,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:53:17,532 INFO L225 Difference]: With dead ends: 114 [2025-03-09 05:53:17,533 INFO L226 Difference]: Without dead ends: 69 [2025-03-09 05:53:17,533 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 05:53:17,533 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 0 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 118 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-09 05:53:17,533 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 118 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 05:53:17,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2025-03-09 05:53:17,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2025-03-09 05:53:17,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 58 states have (on average 1.2758620689655173) internal successors, (74), 62 states have internal predecessors, (74), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-09 05:53:17,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 83 transitions. [2025-03-09 05:53:17,539 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 83 transitions. Word has length 22 [2025-03-09 05:53:17,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:53:17,539 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 83 transitions. [2025-03-09 05:53:17,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 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-09 05:53:17,539 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 83 transitions. [2025-03-09 05:53:17,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-09 05:53:17,542 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:53:17,542 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:53:17,570 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-09 05:53:17,742 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-09 05:53:17,743 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 31 more)] === [2025-03-09 05:53:17,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:53:17,743 INFO L85 PathProgramCache]: Analyzing trace with hash 1175762965, now seen corresponding path program 1 times [2025-03-09 05:53:17,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 05:53:17,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [220118533] [2025-03-09 05:53:17,744 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:53:17,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:53:17,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:53:17,746 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 05:53:17,747 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-09 05:53:17,884 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-09 05:53:18,366 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-09 05:53:18,367 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:53:18,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:53:18,431 INFO L256 TraceCheckSpWp]: Trace formula consists of 583 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 05:53:18,433 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 05:53:18,451 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-09 05:53:18,451 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 05:53:18,485 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-09 05:53:18,488 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 05:53:18,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [220118533] [2025-03-09 05:53:18,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [220118533] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 05:53:18,489 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-09 05:53:18,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2025-03-09 05:53:18,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183304129] [2025-03-09 05:53:18,489 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-09 05:53:18,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 05:53:18,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 05:53:18,489 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 05:53:18,489 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-09 05:53:18,489 INFO L87 Difference]: Start difference. First operand 69 states and 83 transitions. Second operand has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 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-09 05:53:18,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:53:18,589 INFO L93 Difference]: Finished difference Result 124 states and 154 transitions. [2025-03-09 05:53:18,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 05:53:18,590 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 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 25 [2025-03-09 05:53:18,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:53:18,591 INFO L225 Difference]: With dead ends: 124 [2025-03-09 05:53:18,591 INFO L226 Difference]: Without dead ends: 76 [2025-03-09 05:53:18,591 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 44 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-09 05:53:18,592 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 0 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 05:53:18,592 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 230 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 05:53:18,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2025-03-09 05:53:18,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 70. [2025-03-09 05:53:18,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 60 states have (on average 1.2333333333333334) internal successors, (74), 63 states have internal predecessors, (74), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-09 05:53:18,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 83 transitions. [2025-03-09 05:53:18,598 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 83 transitions. Word has length 25 [2025-03-09 05:53:18,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:53:18,598 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 83 transitions. [2025-03-09 05:53:18,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 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-09 05:53:18,599 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 83 transitions. [2025-03-09 05:53:18,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-03-09 05:53:18,599 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:53:18,599 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] [2025-03-09 05:53:18,629 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-09 05:53:18,799 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-09 05:53:18,800 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 31 more)] === [2025-03-09 05:53:18,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:53:18,800 INFO L85 PathProgramCache]: Analyzing trace with hash 698209346, now seen corresponding path program 1 times [2025-03-09 05:53:18,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 05:53:18,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1925529321] [2025-03-09 05:53:18,801 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:53:18,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:53:18,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:53:18,803 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 05:53:18,803 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-09 05:53:18,932 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-09 05:53:19,364 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-09 05:53:19,364 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:53:19,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:53:19,434 INFO L256 TraceCheckSpWp]: Trace formula consists of 569 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-09 05:53:19,436 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 05:53:19,447 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-09 05:53:19,447 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 05:53:19,447 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 05:53:19,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1925529321] [2025-03-09 05:53:19,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1925529321] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:53:19,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:53:19,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 05:53:19,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854034005] [2025-03-09 05:53:19,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:53:19,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 05:53:19,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 05:53:19,448 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 05:53:19,448 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 05:53:19,448 INFO L87 Difference]: Start difference. First operand 70 states and 83 transitions. Second operand has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 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-09 05:53:19,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:53:19,475 INFO L93 Difference]: Finished difference Result 74 states and 88 transitions. [2025-03-09 05:53:19,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 05:53:19,476 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 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-09 05:53:19,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:53:19,476 INFO L225 Difference]: With dead ends: 74 [2025-03-09 05:53:19,476 INFO L226 Difference]: Without dead ends: 73 [2025-03-09 05:53:19,477 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 05:53:19,477 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 0 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 05:53:19,477 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 114 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 05:53:19,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2025-03-09 05:53:19,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2025-03-09 05:53:19,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 63 states have (on average 1.2380952380952381) internal successors, (78), 66 states have internal predecessors, (78), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-09 05:53:19,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 87 transitions. [2025-03-09 05:53:19,492 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 87 transitions. Word has length 32 [2025-03-09 05:53:19,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:53:19,492 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 87 transitions. [2025-03-09 05:53:19,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 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-09 05:53:19,492 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 87 transitions. [2025-03-09 05:53:19,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-09 05:53:19,493 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:53:19,493 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-09 05:53:19,520 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-09 05:53:19,693 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-09 05:53:19,694 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 31 more)] === [2025-03-09 05:53:19,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:53:19,694 INFO L85 PathProgramCache]: Analyzing trace with hash -319722982, now seen corresponding path program 1 times [2025-03-09 05:53:19,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 05:53:19,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1795206312] [2025-03-09 05:53:19,695 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:53:19,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:53:19,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:53:19,697 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 05:53:19,698 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-09 05:53:19,825 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-09 05:53:20,245 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-09 05:53:20,245 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:53:20,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:53:20,312 INFO L256 TraceCheckSpWp]: Trace formula consists of 575 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 05:53:20,313 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 05:53:20,367 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-09 05:53:20,367 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 05:53:20,367 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 05:53:20,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1795206312] [2025-03-09 05:53:20,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1795206312] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:53:20,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:53:20,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 05:53:20,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498972414] [2025-03-09 05:53:20,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:53:20,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 05:53:20,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 05:53:20,368 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 05:53:20,368 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-09 05:53:20,368 INFO L87 Difference]: Start difference. First operand 73 states and 87 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 05:53:20,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:53:20,727 INFO L93 Difference]: Finished difference Result 111 states and 133 transitions. [2025-03-09 05:53:20,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 05:53:20,728 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 35 [2025-03-09 05:53:20,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:53:20,729 INFO L225 Difference]: With dead ends: 111 [2025-03-09 05:53:20,729 INFO L226 Difference]: Without dead ends: 73 [2025-03-09 05:53:20,729 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 30 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-09 05:53:20,730 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 52 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-09 05:53:20,730 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 182 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-09 05:53:20,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2025-03-09 05:53:20,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2025-03-09 05:53:20,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 63 states have (on average 1.2222222222222223) internal successors, (77), 66 states have internal predecessors, (77), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-09 05:53:20,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 86 transitions. [2025-03-09 05:53:20,736 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 86 transitions. Word has length 35 [2025-03-09 05:53:20,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:53:20,737 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 86 transitions. [2025-03-09 05:53:20,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 05:53:20,737 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 86 transitions. [2025-03-09 05:53:20,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-09 05:53:20,737 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:53:20,737 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, 1] [2025-03-09 05:53:20,765 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-09 05:53:20,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:53:20,938 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 31 more)] === [2025-03-09 05:53:20,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:53:20,938 INFO L85 PathProgramCache]: Analyzing trace with hash 1160918455, now seen corresponding path program 1 times [2025-03-09 05:53:20,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 05:53:20,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1031065129] [2025-03-09 05:53:20,939 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:53:20,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:53:20,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:53:20,941 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 05:53:20,942 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-09 05:53:21,079 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-09 05:53:21,537 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-09 05:53:21,537 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:53:21,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:53:21,616 INFO L256 TraceCheckSpWp]: Trace formula consists of 653 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 05:53:21,618 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 05:53:21,652 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-09 05:53:21,652 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 05:53:21,708 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-09 05:53:21,708 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 05:53:21,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1031065129] [2025-03-09 05:53:21,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1031065129] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 05:53:21,708 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-09 05:53:21,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2025-03-09 05:53:21,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555421995] [2025-03-09 05:53:21,708 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-09 05:53:21,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 05:53:21,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 05:53:21,709 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 05:53:21,709 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-09 05:53:21,709 INFO L87 Difference]: Start difference. First operand 73 states and 86 transitions. Second operand has 6 states, 5 states have (on average 8.4) internal successors, (42), 6 states have internal predecessors, (42), 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-09 05:53:21,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:53:21,900 INFO L93 Difference]: Finished difference Result 94 states and 114 transitions. [2025-03-09 05:53:21,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 05:53:21,901 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.4) internal successors, (42), 6 states have internal predecessors, (42), 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 38 [2025-03-09 05:53:21,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:53:21,902 INFO L225 Difference]: With dead ends: 94 [2025-03-09 05:53:21,903 INFO L226 Difference]: Without dead ends: 93 [2025-03-09 05:53:21,903 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 70 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-09 05:53:21,903 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 0 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 05:53:21,903 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 225 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 05:53:21,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2025-03-09 05:53:21,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 63. [2025-03-09 05:53:21,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 54 states have (on average 1.2222222222222223) internal successors, (66), 56 states have internal predecessors, (66), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-09 05:53:21,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 75 transitions. [2025-03-09 05:53:21,909 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 75 transitions. Word has length 38 [2025-03-09 05:53:21,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:53:21,909 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 75 transitions. [2025-03-09 05:53:21,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.4) internal successors, (42), 6 states have internal predecessors, (42), 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-09 05:53:21,909 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 75 transitions. [2025-03-09 05:53:21,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-09 05:53:21,912 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:53:21,912 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 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] [2025-03-09 05:53:21,945 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-09 05:53:22,112 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-09 05:53:22,113 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 31 more)] === [2025-03-09 05:53:22,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:53:22,113 INFO L85 PathProgramCache]: Analyzing trace with hash 1047214786, now seen corresponding path program 1 times [2025-03-09 05:53:22,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 05:53:22,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1844930235] [2025-03-09 05:53:22,114 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:53:22,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:53:22,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:53:22,116 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 05:53:22,117 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-09 05:53:22,280 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-09 05:53:22,798 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-09 05:53:22,798 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:53:22,798 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:53:22,874 INFO L256 TraceCheckSpWp]: Trace formula consists of 641 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 05:53:22,876 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 05:53:22,910 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-09 05:53:22,910 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 05:53:22,911 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 05:53:22,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1844930235] [2025-03-09 05:53:22,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1844930235] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:53:22,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:53:22,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 05:53:22,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007906320] [2025-03-09 05:53:22,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:53:22,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 05:53:22,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 05:53:22,912 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 05:53:22,913 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-09 05:53:22,913 INFO L87 Difference]: Start difference. First operand 63 states and 75 transitions. Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 5 states have internal predecessors, (34), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 05:53:22,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:53:22,982 INFO L93 Difference]: Finished difference Result 79 states and 93 transitions. [2025-03-09 05:53:22,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 05:53:22,982 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 5 states have internal predecessors, (34), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 45 [2025-03-09 05:53:22,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:53:22,983 INFO L225 Difference]: With dead ends: 79 [2025-03-09 05:53:22,983 INFO L226 Difference]: Without dead ends: 63 [2025-03-09 05:53:22,983 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 40 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-09 05:53:22,983 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 7 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 05:53:22,984 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 244 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 05:53:22,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2025-03-09 05:53:22,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2025-03-09 05:53:22,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 54 states have (on average 1.2037037037037037) internal successors, (65), 56 states have internal predecessors, (65), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-09 05:53:22,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 74 transitions. [2025-03-09 05:53:22,987 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 74 transitions. Word has length 45 [2025-03-09 05:53:22,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:53:22,987 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 74 transitions. [2025-03-09 05:53:22,988 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 5 states have internal predecessors, (34), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 05:53:22,988 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 74 transitions. [2025-03-09 05:53:22,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-09 05:53:22,988 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:53:22,988 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:53:23,017 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-09 05:53:23,189 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-09 05:53:23,189 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 31 more)] === [2025-03-09 05:53:23,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:53:23,189 INFO L85 PathProgramCache]: Analyzing trace with hash 1195077957, now seen corresponding path program 1 times [2025-03-09 05:53:23,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 05:53:23,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1567340062] [2025-03-09 05:53:23,190 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:53:23,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:53:23,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:53:23,192 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 05:53:23,193 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-09 05:53:23,339 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-09 05:53:23,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-09 05:53:23,814 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:53:23,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:53:23,887 INFO L256 TraceCheckSpWp]: Trace formula consists of 648 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 05:53:23,888 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 05:53:23,906 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-09 05:53:23,906 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 05:53:23,939 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-09 05:53:23,940 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 05:53:23,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1567340062] [2025-03-09 05:53:23,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1567340062] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 05:53:23,940 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-09 05:53:23,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2025-03-09 05:53:23,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297043776] [2025-03-09 05:53:23,940 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-09 05:53:23,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 05:53:23,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 05:53:23,941 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 05:53:23,941 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-09 05:53:23,941 INFO L87 Difference]: Start difference. First operand 63 states and 74 transitions. Second operand has 6 states, 5 states have (on average 7.8) internal successors, (39), 6 states have internal predecessors, (39), 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-09 05:53:24,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:53:24,007 INFO L93 Difference]: Finished difference Result 70 states and 86 transitions. [2025-03-09 05:53:24,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 05:53:24,008 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.8) internal successors, (39), 6 states have internal predecessors, (39), 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 45 [2025-03-09 05:53:24,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:53:24,009 INFO L225 Difference]: With dead ends: 70 [2025-03-09 05:53:24,009 INFO L226 Difference]: Without dead ends: 69 [2025-03-09 05:53:24,009 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 84 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-09 05:53:24,009 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 0 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 05:53:24,009 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 219 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 05:53:24,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2025-03-09 05:53:24,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 60. [2025-03-09 05:53:24,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 52 states have (on average 1.1923076923076923) internal successors, (62), 53 states have internal predecessors, (62), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-09 05:53:24,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 71 transitions. [2025-03-09 05:53:24,013 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 71 transitions. Word has length 45 [2025-03-09 05:53:24,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:53:24,014 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 71 transitions. [2025-03-09 05:53:24,014 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.8) internal successors, (39), 6 states have internal predecessors, (39), 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-09 05:53:24,014 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 71 transitions. [2025-03-09 05:53:24,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-09 05:53:24,014 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:53:24,014 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] [2025-03-09 05:53:24,049 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-09 05:53:24,215 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-09 05:53:24,215 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 31 more)] === [2025-03-09 05:53:24,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:53:24,216 INFO L85 PathProgramCache]: Analyzing trace with hash 1757937601, now seen corresponding path program 1 times [2025-03-09 05:53:24,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 05:53:24,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1798840444] [2025-03-09 05:53:24,217 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:53:24,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:53:24,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:53:24,219 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 05:53:24,220 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-09 05:53:24,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-09 05:53:24,831 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-09 05:53:24,832 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:53:24,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:53:24,901 INFO L256 TraceCheckSpWp]: Trace formula consists of 647 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-09 05:53:24,902 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 05:53:24,946 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-09 05:53:24,946 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 05:53:24,946 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 05:53:24,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1798840444] [2025-03-09 05:53:24,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1798840444] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:53:24,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:53:24,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-09 05:53:24,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162348003] [2025-03-09 05:53:24,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:53:24,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 05:53:24,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 05:53:24,947 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 05:53:24,947 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-09 05:53:24,947 INFO L87 Difference]: Start difference. First operand 60 states and 71 transitions. Second operand has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 6 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-09 05:53:25,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:53:25,008 INFO L93 Difference]: Finished difference Result 66 states and 77 transitions. [2025-03-09 05:53:25,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 05:53:25,008 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 6 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 49 [2025-03-09 05:53:25,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:53:25,009 INFO L225 Difference]: With dead ends: 66 [2025-03-09 05:53:25,009 INFO L226 Difference]: Without dead ends: 62 [2025-03-09 05:53:25,009 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-09 05:53:25,010 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 0 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 05:53:25,010 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 308 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 05:53:25,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2025-03-09 05:53:25,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2025-03-09 05:53:25,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 54 states have (on average 1.1851851851851851) internal successors, (64), 55 states have internal predecessors, (64), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-09 05:53:25,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 73 transitions. [2025-03-09 05:53:25,015 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 73 transitions. Word has length 49 [2025-03-09 05:53:25,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:53:25,015 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 73 transitions. [2025-03-09 05:53:25,015 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 6 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-09 05:53:25,015 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 73 transitions. [2025-03-09 05:53:25,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-09 05:53:25,016 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:53:25,016 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 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-09 05:53:25,043 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-09 05:53:25,216 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-09 05:53:25,216 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 31 more)] === [2025-03-09 05:53:25,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:53:25,217 INFO L85 PathProgramCache]: Analyzing trace with hash 1435765303, now seen corresponding path program 1 times [2025-03-09 05:53:25,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 05:53:25,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [185189482] [2025-03-09 05:53:25,218 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:53:25,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:53:25,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:53:25,220 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 05:53:25,220 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-09 05:53:25,390 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-09 05:53:25,937 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-09 05:53:25,937 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:53:25,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:53:26,012 INFO L256 TraceCheckSpWp]: Trace formula consists of 654 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 05:53:26,014 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 05:53:26,034 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-09 05:53:26,034 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 05:53:26,070 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-09 05:53:26,070 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 05:53:26,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [185189482] [2025-03-09 05:53:26,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [185189482] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 05:53:26,070 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-09 05:53:26,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2025-03-09 05:53:26,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545494709] [2025-03-09 05:53:26,071 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-09 05:53:26,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-09 05:53:26,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 05:53:26,071 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-09 05:53:26,071 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-09 05:53:26,071 INFO L87 Difference]: Start difference. First operand 62 states and 73 transitions. Second operand has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 1 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-09 05:53:26,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:53:26,159 INFO L93 Difference]: Finished difference Result 127 states and 152 transitions. [2025-03-09 05:53:26,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 05:53:26,160 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 1 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 48 [2025-03-09 05:53:26,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:53:26,160 INFO L225 Difference]: With dead ends: 127 [2025-03-09 05:53:26,160 INFO L226 Difference]: Without dead ends: 74 [2025-03-09 05:53:26,161 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 88 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-09 05:53:26,161 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 8 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 05:53:26,161 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 226 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 05:53:26,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2025-03-09 05:53:26,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2025-03-09 05:53:26,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 66 states have (on average 1.1515151515151516) internal successors, (76), 67 states have internal predecessors, (76), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-09 05:53:26,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 85 transitions. [2025-03-09 05:53:26,167 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 85 transitions. Word has length 48 [2025-03-09 05:53:26,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:53:26,167 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 85 transitions. [2025-03-09 05:53:26,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 1 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-09 05:53:26,167 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 85 transitions. [2025-03-09 05:53:26,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-09 05:53:26,169 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:53:26,169 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 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-09 05:53:26,203 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-03-09 05:53:26,370 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-09 05:53:26,370 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 31 more)] === [2025-03-09 05:53:26,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:53:26,371 INFO L85 PathProgramCache]: Analyzing trace with hash 620599159, now seen corresponding path program 2 times [2025-03-09 05:53:26,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 05:53:26,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1889792421] [2025-03-09 05:53:26,371 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 05:53:26,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:53:26,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:53:26,373 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 05:53:26,374 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-09 05:53:26,532 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 60 statements into 2 equivalence classes. [2025-03-09 05:53:28,882 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 60 of 60 statements. [2025-03-09 05:53:28,882 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 05:53:28,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:53:28,972 INFO L256 TraceCheckSpWp]: Trace formula consists of 706 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 05:53:28,973 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 05:53:28,998 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2025-03-09 05:53:28,998 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 05:53:29,032 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2025-03-09 05:53:29,032 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 05:53:29,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1889792421] [2025-03-09 05:53:29,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1889792421] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 05:53:29,032 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-09 05:53:29,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2025-03-09 05:53:29,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229032277] [2025-03-09 05:53:29,033 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-09 05:53:29,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-09 05:53:29,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 05:53:29,033 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-09 05:53:29,033 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-09 05:53:29,033 INFO L87 Difference]: Start difference. First operand 74 states and 85 transitions. Second operand has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-09 05:53:29,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:53:29,189 INFO L93 Difference]: Finished difference Result 133 states and 157 transitions. [2025-03-09 05:53:29,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 05:53:29,190 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 60 [2025-03-09 05:53:29,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:53:29,191 INFO L225 Difference]: With dead ends: 133 [2025-03-09 05:53:29,191 INFO L226 Difference]: Without dead ends: 86 [2025-03-09 05:53:29,191 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 112 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-09 05:53:29,191 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 8 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 05:53:29,192 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 333 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 05:53:29,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2025-03-09 05:53:29,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2025-03-09 05:53:29,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 78 states have (on average 1.1282051282051282) internal successors, (88), 79 states have internal predecessors, (88), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-09 05:53:29,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 97 transitions. [2025-03-09 05:53:29,196 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 97 transitions. Word has length 60 [2025-03-09 05:53:29,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:53:29,196 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 97 transitions. [2025-03-09 05:53:29,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-09 05:53:29,196 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 97 transitions. [2025-03-09 05:53:29,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-09 05:53:29,197 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:53:29,197 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 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-09 05:53:29,232 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-03-09 05:53:29,397 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-09 05:53:29,398 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 31 more)] === [2025-03-09 05:53:29,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:53:29,398 INFO L85 PathProgramCache]: Analyzing trace with hash 1826270263, now seen corresponding path program 3 times [2025-03-09 05:53:29,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 05:53:29,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [874099167] [2025-03-09 05:53:29,399 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 05:53:29,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:53:29,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:53:29,401 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 05:53:29,401 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-03-09 05:53:29,568 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 72 statements into 9 equivalence classes.