./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-38.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-38.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c1b0a215876f37039c6c55ed6970931c1670c48c809fddaaf54aa4f3ef26ee12 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 00:10:27,688 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 00:10:27,750 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 00:10:27,755 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 00:10:27,756 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 00:10:27,778 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 00:10:27,778 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 00:10:27,779 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 00:10:27,779 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 00:10:27,779 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 00:10:27,780 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 00:10:27,780 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 00:10:27,780 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 00:10:27,780 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 00:10:27,780 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 00:10:27,780 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 00:10:27,780 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 00:10:27,781 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 00:10:27,781 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 00:10:27,781 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 00:10:27,781 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 00:10:27,781 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 00:10:27,781 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 00:10:27,781 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 00:10:27,781 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 00:10:27,782 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 00:10:27,782 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 00:10:27,782 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 00:10:27,782 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 00:10:27,782 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 00:10:27,782 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 00:10:27,782 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 00:10:27,782 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:10:27,782 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 00:10:27,783 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 00:10:27,783 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 00:10:27,783 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 00:10:27,783 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 00:10:27,783 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 00:10:27,783 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 00:10:27,783 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 00:10:27,783 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 00:10:27,783 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 00:10:27,783 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 ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c1b0a215876f37039c6c55ed6970931c1670c48c809fddaaf54aa4f3ef26ee12 [2025-03-04 00:10:28,017 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 00:10:28,025 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 00:10:28,027 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 00:10:28,028 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 00:10:28,028 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 00:10:28,030 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-38.i [2025-03-04 00:10:29,222 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/78b9e8010/6c96e10a8e194c6c81bf505ed48031d6/FLAG2a52c1f39 [2025-03-04 00:10:29,455 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 00:10:29,455 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-38.i [2025-03-04 00:10:29,462 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/78b9e8010/6c96e10a8e194c6c81bf505ed48031d6/FLAG2a52c1f39 [2025-03-04 00:10:29,784 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/78b9e8010/6c96e10a8e194c6c81bf505ed48031d6 [2025-03-04 00:10:29,786 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 00:10:29,787 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 00:10:29,788 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 00:10:29,788 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 00:10:29,791 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 00:10:29,792 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:10:29" (1/1) ... [2025-03-04 00:10:29,792 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@261c242d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:10:29, skipping insertion in model container [2025-03-04 00:10:29,793 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:10:29" (1/1) ... [2025-03-04 00:10:29,818 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 00:10:29,926 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-38.i[916,929] [2025-03-04 00:10:30,073 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:10:30,085 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 00:10:30,096 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-38.i[916,929] [2025-03-04 00:10:30,158 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:10:30,178 INFO L204 MainTranslator]: Completed translation [2025-03-04 00:10:30,178 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:10:30 WrapperNode [2025-03-04 00:10:30,179 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 00:10:30,180 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 00:10:30,180 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 00:10:30,180 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 00:10:30,185 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:10:30" (1/1) ... [2025-03-04 00:10:30,196 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:10:30" (1/1) ... [2025-03-04 00:10:30,240 INFO L138 Inliner]: procedures = 26, calls = 51, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 328 [2025-03-04 00:10:30,240 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 00:10:30,241 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 00:10:30,241 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 00:10:30,241 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 00:10:30,247 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:10:30" (1/1) ... [2025-03-04 00:10:30,247 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:10:30" (1/1) ... [2025-03-04 00:10:30,260 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:10:30" (1/1) ... [2025-03-04 00:10:30,296 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-04 00:10:30,297 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:10:30" (1/1) ... [2025-03-04 00:10:30,297 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:10:30" (1/1) ... [2025-03-04 00:10:30,320 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:10:30" (1/1) ... [2025-03-04 00:10:30,325 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:10:30" (1/1) ... [2025-03-04 00:10:30,330 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:10:30" (1/1) ... [2025-03-04 00:10:30,334 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:10:30" (1/1) ... [2025-03-04 00:10:30,348 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 00:10:30,349 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 00:10:30,349 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 00:10:30,349 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 00:10:30,350 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:10:30" (1/1) ... [2025-03-04 00:10:30,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:10:30,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:10:30,380 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 00:10:30,384 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 00:10:30,401 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 00:10:30,402 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 00:10:30,402 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 00:10:30,402 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 00:10:30,402 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 00:10:30,402 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 00:10:30,483 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 00:10:30,485 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 00:10:31,041 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L332: havoc property_#t~bitwise26#1;havoc property_#t~short27#1; [2025-03-04 00:10:31,070 INFO L? ?]: Removed 36 outVars from TransFormulas that were not future-live. [2025-03-04 00:10:31,071 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 00:10:31,081 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 00:10:31,082 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 00:10:31,082 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:10:31 BoogieIcfgContainer [2025-03-04 00:10:31,082 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 00:10:31,083 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 00:10:31,084 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 00:10:31,087 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 00:10:31,087 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 12:10:29" (1/3) ... [2025-03-04 00:10:31,087 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6752e9db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:10:31, skipping insertion in model container [2025-03-04 00:10:31,087 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:10:30" (2/3) ... [2025-03-04 00:10:31,088 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6752e9db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:10:31, skipping insertion in model container [2025-03-04 00:10:31,088 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:10:31" (3/3) ... [2025-03-04 00:10:31,089 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount250_file-38.i [2025-03-04 00:10:31,098 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 00:10:31,101 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount250_file-38.i that has 2 procedures, 138 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 00:10:31,145 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 00:10:31,153 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;@7a763070, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 00:10:31,154 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 00:10:31,159 INFO L276 IsEmpty]: Start isEmpty. Operand has 138 states, 97 states have (on average 1.5154639175257731) internal successors, (147), 98 states have internal predecessors, (147), 38 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-04 00:10:31,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2025-03-04 00:10:31,172 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:10:31,173 INFO L218 NwaCegarLoop]: trace histogram [38, 38, 38, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:10:31,174 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:10:31,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:10:31,179 INFO L85 PathProgramCache]: Analyzing trace with hash -1236566648, now seen corresponding path program 1 times [2025-03-04 00:10:31,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:10:31,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17803776] [2025-03-04 00:10:31,185 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:10:31,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:10:31,285 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 255 statements into 1 equivalence classes. [2025-03-04 00:10:31,315 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 255 of 255 statements. [2025-03-04 00:10:31,319 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:10:31,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:10:31,596 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 0 proven. 74 refuted. 0 times theorem prover too weak. 2738 trivial. 0 not checked. [2025-03-04 00:10:31,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:10:31,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17803776] [2025-03-04 00:10:31,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17803776] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:10:31,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2134962261] [2025-03-04 00:10:31,598 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:10:31,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:10:31,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:10:31,600 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 00:10:31,602 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 00:10:31,721 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 255 statements into 1 equivalence classes. [2025-03-04 00:10:31,820 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 255 of 255 statements. [2025-03-04 00:10:31,820 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:10:31,820 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:10:31,825 INFO L256 TraceCheckSpWp]: Trace formula consists of 629 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 00:10:31,835 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:10:31,860 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 2738 trivial. 0 not checked. [2025-03-04 00:10:31,861 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:10:31,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2134962261] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:10:31,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 00:10:31,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 00:10:31,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966822955] [2025-03-04 00:10:31,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:10:31,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 00:10:31,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:10:31,879 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 00:10:31,879 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 00:10:31,881 INFO L87 Difference]: Start difference. First operand has 138 states, 97 states have (on average 1.5154639175257731) internal successors, (147), 98 states have internal predecessors, (147), 38 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) Second operand has 2 states, 2 states have (on average 35.0) internal successors, (70), 2 states have internal predecessors, (70), 2 states have call successors, (38), 2 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 2 states have call successors, (38) [2025-03-04 00:10:31,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:10:31,920 INFO L93 Difference]: Finished difference Result 270 states and 479 transitions. [2025-03-04 00:10:31,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 00:10:31,923 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 35.0) internal successors, (70), 2 states have internal predecessors, (70), 2 states have call successors, (38), 2 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 2 states have call successors, (38) Word has length 255 [2025-03-04 00:10:31,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:10:31,929 INFO L225 Difference]: With dead ends: 270 [2025-03-04 00:10:31,930 INFO L226 Difference]: Without dead ends: 135 [2025-03-04 00:10:31,934 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 256 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-04 00:10:31,938 INFO L435 NwaCegarLoop]: 215 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 00:10:31,939 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 215 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:10:31,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2025-03-04 00:10:31,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2025-03-04 00:10:31,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 95 states have (on average 1.4842105263157894) internal successors, (141), 95 states have internal predecessors, (141), 38 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-04 00:10:31,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 217 transitions. [2025-03-04 00:10:31,984 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 217 transitions. Word has length 255 [2025-03-04 00:10:31,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:10:31,984 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 217 transitions. [2025-03-04 00:10:31,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 35.0) internal successors, (70), 2 states have internal predecessors, (70), 2 states have call successors, (38), 2 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 2 states have call successors, (38) [2025-03-04 00:10:31,985 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 217 transitions. [2025-03-04 00:10:31,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2025-03-04 00:10:31,988 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:10:31,988 INFO L218 NwaCegarLoop]: trace histogram [38, 38, 38, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:10:31,998 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 00:10:32,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-04 00:10:32,190 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:10:32,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:10:32,190 INFO L85 PathProgramCache]: Analyzing trace with hash 1299584390, now seen corresponding path program 1 times [2025-03-04 00:10:32,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:10:32,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134342885] [2025-03-04 00:10:32,191 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:10:32,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:10:32,220 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 255 statements into 1 equivalence classes. [2025-03-04 00:10:32,295 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 255 of 255 statements. [2025-03-04 00:10:32,295 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:10:32,295 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:10:32,529 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2812 trivial. 0 not checked. [2025-03-04 00:10:32,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:10:32,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134342885] [2025-03-04 00:10:32,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134342885] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:10:32,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:10:32,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 00:10:32,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171947070] [2025-03-04 00:10:32,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:10:32,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 00:10:32,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:10:32,531 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 00:10:32,531 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:10:32,532 INFO L87 Difference]: Start difference. First operand 135 states and 217 transitions. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 1 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 1 states have call successors, (38) [2025-03-04 00:10:32,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:10:32,636 INFO L93 Difference]: Finished difference Result 394 states and 635 transitions. [2025-03-04 00:10:32,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 00:10:32,637 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 1 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 1 states have call successors, (38) Word has length 255 [2025-03-04 00:10:32,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:10:32,641 INFO L225 Difference]: With dead ends: 394 [2025-03-04 00:10:32,643 INFO L226 Difference]: Without dead ends: 262 [2025-03-04 00:10:32,644 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-04 00:10:32,645 INFO L435 NwaCegarLoop]: 321 mSDtfsCounter, 188 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 517 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:10:32,645 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 517 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 00:10:32,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2025-03-04 00:10:32,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 169. [2025-03-04 00:10:32,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 129 states have (on average 1.496124031007752) internal successors, (193), 129 states have internal predecessors, (193), 38 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-04 00:10:32,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 269 transitions. [2025-03-04 00:10:32,669 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 269 transitions. Word has length 255 [2025-03-04 00:10:32,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:10:32,671 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 269 transitions. [2025-03-04 00:10:32,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 1 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 1 states have call successors, (38) [2025-03-04 00:10:32,671 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 269 transitions. [2025-03-04 00:10:32,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2025-03-04 00:10:32,675 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:10:32,676 INFO L218 NwaCegarLoop]: trace histogram [38, 38, 38, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:10:32,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 00:10:32,676 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:10:32,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:10:32,677 INFO L85 PathProgramCache]: Analyzing trace with hash 1552455095, now seen corresponding path program 1 times [2025-03-04 00:10:32,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:10:32,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165373801] [2025-03-04 00:10:32,677 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:10:32,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:10:32,703 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 256 statements into 1 equivalence classes. [2025-03-04 00:10:32,759 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 256 of 256 statements. [2025-03-04 00:10:32,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:10:32,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:10:33,093 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2812 trivial. 0 not checked. [2025-03-04 00:10:33,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:10:33,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165373801] [2025-03-04 00:10:33,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165373801] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:10:33,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:10:33,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 00:10:33,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230994900] [2025-03-04 00:10:33,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:10:33,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 00:10:33,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:10:33,095 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 00:10:33,096 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:10:33,096 INFO L87 Difference]: Start difference. First operand 169 states and 269 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 1 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 1 states have call successors, (38) [2025-03-04 00:10:33,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:10:33,142 INFO L93 Difference]: Finished difference Result 330 states and 525 transitions. [2025-03-04 00:10:33,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 00:10:33,143 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 1 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 1 states have call successors, (38) Word has length 256 [2025-03-04 00:10:33,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:10:33,145 INFO L225 Difference]: With dead ends: 330 [2025-03-04 00:10:33,145 INFO L226 Difference]: Without dead ends: 164 [2025-03-04 00:10:33,145 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-04 00:10:33,147 INFO L435 NwaCegarLoop]: 198 mSDtfsCounter, 200 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 00:10:33,147 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 198 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:10:33,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2025-03-04 00:10:33,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2025-03-04 00:10:33,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 124 states have (on average 1.4274193548387097) internal successors, (177), 124 states have internal predecessors, (177), 38 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-04 00:10:33,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 253 transitions. [2025-03-04 00:10:33,166 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 253 transitions. Word has length 256 [2025-03-04 00:10:33,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:10:33,167 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 253 transitions. [2025-03-04 00:10:33,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 1 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 1 states have call successors, (38) [2025-03-04 00:10:33,167 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 253 transitions. [2025-03-04 00:10:33,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2025-03-04 00:10:33,169 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:10:33,169 INFO L218 NwaCegarLoop]: trace histogram [38, 38, 38, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:10:33,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 00:10:33,170 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:10:33,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:10:33,171 INFO L85 PathProgramCache]: Analyzing trace with hash 1143630870, now seen corresponding path program 1 times [2025-03-04 00:10:33,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:10:33,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528777819] [2025-03-04 00:10:33,171 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:10:33,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:10:33,199 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 256 statements into 1 equivalence classes. [2025-03-04 00:10:33,455 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 256 of 256 statements. [2025-03-04 00:10:33,455 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:10:33,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:10:34,778 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2812 trivial. 0 not checked. [2025-03-04 00:10:34,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:10:34,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528777819] [2025-03-04 00:10:34,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528777819] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:10:34,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:10:34,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 00:10:34,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060537416] [2025-03-04 00:10:34,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:10:34,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 00:10:34,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:10:34,780 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 00:10:34,782 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 00:10:34,782 INFO L87 Difference]: Start difference. First operand 164 states and 253 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 2 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 2 states have call predecessors, (38), 2 states have call successors, (38) [2025-03-04 00:10:35,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:10:35,213 INFO L93 Difference]: Finished difference Result 487 states and 754 transitions. [2025-03-04 00:10:35,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 00:10:35,214 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 2 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 2 states have call predecessors, (38), 2 states have call successors, (38) Word has length 256 [2025-03-04 00:10:35,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:10:35,216 INFO L225 Difference]: With dead ends: 487 [2025-03-04 00:10:35,216 INFO L226 Difference]: Without dead ends: 326 [2025-03-04 00:10:35,217 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-03-04 00:10:35,218 INFO L435 NwaCegarLoop]: 198 mSDtfsCounter, 245 mSDsluCounter, 468 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 167 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 666 SdHoareTripleChecker+Invalid, 323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 167 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 00:10:35,219 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 666 Invalid, 323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [167 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 00:10:35,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2025-03-04 00:10:35,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 230. [2025-03-04 00:10:35,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 151 states have (on average 1.3509933774834437) internal successors, (204), 151 states have internal predecessors, (204), 76 states have call successors, (76), 2 states have call predecessors, (76), 2 states have return successors, (76), 76 states have call predecessors, (76), 76 states have call successors, (76) [2025-03-04 00:10:35,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 356 transitions. [2025-03-04 00:10:35,263 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 356 transitions. Word has length 256 [2025-03-04 00:10:35,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:10:35,264 INFO L471 AbstractCegarLoop]: Abstraction has 230 states and 356 transitions. [2025-03-04 00:10:35,264 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 2 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 2 states have call predecessors, (38), 2 states have call successors, (38) [2025-03-04 00:10:35,265 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 356 transitions. [2025-03-04 00:10:35,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2025-03-04 00:10:35,266 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:10:35,267 INFO L218 NwaCegarLoop]: trace histogram [38, 38, 38, 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, 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, 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, 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, 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-04 00:10:35,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 00:10:35,267 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:10:35,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:10:35,268 INFO L85 PathProgramCache]: Analyzing trace with hash 1173462563, now seen corresponding path program 1 times [2025-03-04 00:10:35,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:10:35,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338951697] [2025-03-04 00:10:35,270 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:10:35,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:10:35,299 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 257 statements into 1 equivalence classes. [2025-03-04 00:10:35,808 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 257 of 257 statements. [2025-03-04 00:10:35,809 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:10:35,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:10:36,414 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 33 proven. 78 refuted. 0 times theorem prover too weak. 2701 trivial. 0 not checked. [2025-03-04 00:10:36,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:10:36,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338951697] [2025-03-04 00:10:36,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338951697] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:10:36,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1892795391] [2025-03-04 00:10:36,415 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:10:36,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:10:36,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:10:36,417 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 00:10:36,419 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 00:10:36,505 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 257 statements into 1 equivalence classes. [2025-03-04 00:10:36,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 257 of 257 statements. [2025-03-04 00:10:36,583 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:10:36,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:10:36,586 INFO L256 TraceCheckSpWp]: Trace formula consists of 630 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 00:10:36,595 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:10:36,682 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2812 trivial. 0 not checked. [2025-03-04 00:10:36,682 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:10:36,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1892795391] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:10:36,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 00:10:36,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2025-03-04 00:10:36,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335617002] [2025-03-04 00:10:36,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:10:36,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 00:10:36,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:10:36,684 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 00:10:36,685 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 00:10:36,686 INFO L87 Difference]: Start difference. First operand 230 states and 356 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 1 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 1 states have call successors, (38) [2025-03-04 00:10:36,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:10:36,794 INFO L93 Difference]: Finished difference Result 530 states and 822 transitions. [2025-03-04 00:10:36,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 00:10:36,795 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 1 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 1 states have call successors, (38) Word has length 257 [2025-03-04 00:10:36,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:10:36,797 INFO L225 Difference]: With dead ends: 530 [2025-03-04 00:10:36,798 INFO L226 Difference]: Without dead ends: 369 [2025-03-04 00:10:36,798 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 258 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-04 00:10:36,799 INFO L435 NwaCegarLoop]: 301 mSDtfsCounter, 169 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 478 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-04 00:10:36,799 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 478 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 00:10:36,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2025-03-04 00:10:36,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 293. [2025-03-04 00:10:36,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 214 states have (on average 1.4065420560747663) internal successors, (301), 214 states have internal predecessors, (301), 76 states have call successors, (76), 2 states have call predecessors, (76), 2 states have return successors, (76), 76 states have call predecessors, (76), 76 states have call successors, (76) [2025-03-04 00:10:36,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 453 transitions. [2025-03-04 00:10:36,829 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 453 transitions. Word has length 257 [2025-03-04 00:10:36,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:10:36,830 INFO L471 AbstractCegarLoop]: Abstraction has 293 states and 453 transitions. [2025-03-04 00:10:36,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 1 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 1 states have call successors, (38) [2025-03-04 00:10:36,830 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 453 transitions. [2025-03-04 00:10:36,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2025-03-04 00:10:36,832 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:10:36,832 INFO L218 NwaCegarLoop]: trace histogram [38, 38, 38, 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, 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, 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, 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, 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-04 00:10:36,840 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 00:10:37,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:10:37,033 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:10:37,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:10:37,034 INFO L85 PathProgramCache]: Analyzing trace with hash -71301918, now seen corresponding path program 1 times [2025-03-04 00:10:37,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:10:37,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486814967] [2025-03-04 00:10:37,034 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:10:37,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:10:37,057 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 257 statements into 1 equivalence classes. [2025-03-04 00:10:37,322 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 257 of 257 statements. [2025-03-04 00:10:37,322 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:10:37,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:10:37,875 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 33 proven. 78 refuted. 0 times theorem prover too weak. 2701 trivial. 0 not checked. [2025-03-04 00:10:37,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:10:37,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486814967] [2025-03-04 00:10:37,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486814967] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:10:37,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1302034497] [2025-03-04 00:10:37,876 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:10:37,876 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:10:37,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:10:37,878 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 00:10:37,879 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 00:10:37,967 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 257 statements into 1 equivalence classes. [2025-03-04 00:10:38,044 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 257 of 257 statements. [2025-03-04 00:10:38,045 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:10:38,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:10:38,049 INFO L256 TraceCheckSpWp]: Trace formula consists of 630 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 00:10:38,056 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:10:38,165 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 937 proven. 21 refuted. 0 times theorem prover too weak. 1854 trivial. 0 not checked. [2025-03-04 00:10:38,167 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:10:38,373 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 90 proven. 21 refuted. 0 times theorem prover too weak. 2701 trivial. 0 not checked. [2025-03-04 00:10:38,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1302034497] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 00:10:38,374 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 00:10:38,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9 [2025-03-04 00:10:38,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705950540] [2025-03-04 00:10:38,374 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 00:10:38,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 00:10:38,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:10:38,375 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 00:10:38,376 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-04 00:10:38,376 INFO L87 Difference]: Start difference. First operand 293 states and 453 transitions. Second operand has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 3 states have call successors, (71), 2 states have call predecessors, (71), 4 states have return successors, (73), 3 states have call predecessors, (73), 3 states have call successors, (73) [2025-03-04 00:10:39,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:10:39,019 INFO L93 Difference]: Finished difference Result 535 states and 813 transitions. [2025-03-04 00:10:39,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-04 00:10:39,019 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 3 states have call successors, (71), 2 states have call predecessors, (71), 4 states have return successors, (73), 3 states have call predecessors, (73), 3 states have call successors, (73) Word has length 257 [2025-03-04 00:10:39,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:10:39,022 INFO L225 Difference]: With dead ends: 535 [2025-03-04 00:10:39,022 INFO L226 Difference]: Without dead ends: 311 [2025-03-04 00:10:39,022 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 532 GetRequests, 514 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=105, Invalid=237, Unknown=0, NotChecked=0, Total=342 [2025-03-04 00:10:39,023 INFO L435 NwaCegarLoop]: 209 mSDtfsCounter, 346 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 455 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 347 SdHoareTripleChecker+Valid, 541 SdHoareTripleChecker+Invalid, 603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 455 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 00:10:39,023 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [347 Valid, 541 Invalid, 603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 455 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 00:10:39,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2025-03-04 00:10:39,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 311. [2025-03-04 00:10:39,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 311 states, 227 states have (on average 1.3612334801762114) internal successors, (309), 227 states have internal predecessors, (309), 76 states have call successors, (76), 7 states have call predecessors, (76), 7 states have return successors, (76), 76 states have call predecessors, (76), 76 states have call successors, (76) [2025-03-04 00:10:39,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 461 transitions. [2025-03-04 00:10:39,060 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 461 transitions. Word has length 257 [2025-03-04 00:10:39,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:10:39,060 INFO L471 AbstractCegarLoop]: Abstraction has 311 states and 461 transitions. [2025-03-04 00:10:39,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 3 states have call successors, (71), 2 states have call predecessors, (71), 4 states have return successors, (73), 3 states have call predecessors, (73), 3 states have call successors, (73) [2025-03-04 00:10:39,060 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 461 transitions. [2025-03-04 00:10:39,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2025-03-04 00:10:39,063 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:10:39,063 INFO L218 NwaCegarLoop]: trace histogram [38, 38, 38, 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, 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, 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, 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, 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-04 00:10:39,070 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 00:10:39,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:10:39,263 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:10:39,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:10:39,264 INFO L85 PathProgramCache]: Analyzing trace with hash 247147716, now seen corresponding path program 1 times [2025-03-04 00:10:39,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:10:39,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901367166] [2025-03-04 00:10:39,264 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:10:39,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:10:39,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 257 statements into 1 equivalence classes. [2025-03-04 00:10:39,393 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 257 of 257 statements. [2025-03-04 00:10:39,393 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:10:39,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:10:40,083 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2812 trivial. 0 not checked. [2025-03-04 00:10:40,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:10:40,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901367166] [2025-03-04 00:10:40,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901367166] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:10:40,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:10:40,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 00:10:40,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528968419] [2025-03-04 00:10:40,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:10:40,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 00:10:40,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:10:40,085 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 00:10:40,085 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-04 00:10:40,086 INFO L87 Difference]: Start difference. First operand 311 states and 461 transitions. Second operand has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 1 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 1 states have call successors, (38) [2025-03-04 00:10:40,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:10:40,549 INFO L93 Difference]: Finished difference Result 824 states and 1220 transitions. [2025-03-04 00:10:40,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 00:10:40,549 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 1 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 1 states have call successors, (38) Word has length 257 [2025-03-04 00:10:40,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:10:40,552 INFO L225 Difference]: With dead ends: 824 [2025-03-04 00:10:40,553 INFO L226 Difference]: Without dead ends: 582 [2025-03-04 00:10:40,553 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2025-03-04 00:10:40,558 INFO L435 NwaCegarLoop]: 321 mSDtfsCounter, 552 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 552 SdHoareTripleChecker+Valid, 647 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 00:10:40,558 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [552 Valid, 647 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 00:10:40,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2025-03-04 00:10:40,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 426. [2025-03-04 00:10:40,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 426 states, 341 states have (on average 1.4105571847507332) internal successors, (481), 341 states have internal predecessors, (481), 76 states have call successors, (76), 8 states have call predecessors, (76), 8 states have return successors, (76), 76 states have call predecessors, (76), 76 states have call successors, (76) [2025-03-04 00:10:40,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 633 transitions. [2025-03-04 00:10:40,604 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 633 transitions. Word has length 257 [2025-03-04 00:10:40,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:10:40,604 INFO L471 AbstractCegarLoop]: Abstraction has 426 states and 633 transitions. [2025-03-04 00:10:40,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 1 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 1 states have call successors, (38) [2025-03-04 00:10:40,605 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 633 transitions. [2025-03-04 00:10:40,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2025-03-04 00:10:40,609 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:10:40,609 INFO L218 NwaCegarLoop]: trace histogram [38, 38, 38, 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, 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, 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, 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, 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-04 00:10:40,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 00:10:40,610 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:10:40,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:10:40,611 INFO L85 PathProgramCache]: Analyzing trace with hash -1884028767, now seen corresponding path program 1 times [2025-03-04 00:10:40,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:10:40,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261033644] [2025-03-04 00:10:40,611 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:10:40,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:10:40,632 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 257 statements into 1 equivalence classes. [2025-03-04 00:10:40,648 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 257 of 257 statements. [2025-03-04 00:10:40,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:10:40,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:10:40,715 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2812 trivial. 0 not checked. [2025-03-04 00:10:40,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:10:40,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261033644] [2025-03-04 00:10:40,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261033644] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:10:40,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:10:40,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 00:10:40,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520044158] [2025-03-04 00:10:40,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:10:40,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 00:10:40,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:10:40,717 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 00:10:40,717 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:10:40,718 INFO L87 Difference]: Start difference. First operand 426 states and 633 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 1 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 1 states have call successors, (38) [2025-03-04 00:10:40,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:10:40,803 INFO L93 Difference]: Finished difference Result 836 states and 1245 transitions. [2025-03-04 00:10:40,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 00:10:40,804 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 1 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 1 states have call successors, (38) Word has length 257 [2025-03-04 00:10:40,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:10:40,807 INFO L225 Difference]: With dead ends: 836 [2025-03-04 00:10:40,807 INFO L226 Difference]: Without dead ends: 491 [2025-03-04 00:10:40,809 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-04 00:10:40,810 INFO L435 NwaCegarLoop]: 238 mSDtfsCounter, 168 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 00:10:40,811 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 416 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:10:40,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2025-03-04 00:10:40,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 317. [2025-03-04 00:10:40,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 317 states, 232 states have (on average 1.3189655172413792) internal successors, (306), 232 states have internal predecessors, (306), 76 states have call successors, (76), 8 states have call predecessors, (76), 8 states have return successors, (76), 76 states have call predecessors, (76), 76 states have call successors, (76) [2025-03-04 00:10:40,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 458 transitions. [2025-03-04 00:10:40,860 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 458 transitions. Word has length 257 [2025-03-04 00:10:40,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:10:40,861 INFO L471 AbstractCegarLoop]: Abstraction has 317 states and 458 transitions. [2025-03-04 00:10:40,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 1 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 1 states have call successors, (38) [2025-03-04 00:10:40,861 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 458 transitions. [2025-03-04 00:10:40,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2025-03-04 00:10:40,863 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:10:40,864 INFO L218 NwaCegarLoop]: trace histogram [38, 38, 38, 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, 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, 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, 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, 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-04 00:10:40,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 00:10:40,864 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:10:40,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:10:40,864 INFO L85 PathProgramCache]: Analyzing trace with hash -1385656283, now seen corresponding path program 1 times [2025-03-04 00:10:40,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:10:40,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637703133] [2025-03-04 00:10:40,865 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:10:40,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:10:40,882 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 257 statements into 1 equivalence classes. [2025-03-04 00:10:41,265 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 257 of 257 statements. [2025-03-04 00:10:41,265 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:10:41,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 00:10:41,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [560656164] [2025-03-04 00:10:41,270 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:10:41,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:10:41,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:10:41,272 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 00:10:41,275 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 00:10:41,366 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 257 statements into 1 equivalence classes. [2025-03-04 00:10:41,478 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 257 of 257 statements. [2025-03-04 00:10:41,478 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:10:41,478 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:10:41,482 INFO L256 TraceCheckSpWp]: Trace formula consists of 626 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-04 00:10:41,486 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:10:42,905 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 758 proven. 123 refuted. 0 times theorem prover too weak. 1931 trivial. 0 not checked. [2025-03-04 00:10:42,906 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:10:43,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:10:43,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637703133] [2025-03-04 00:10:43,274 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 00:10:43,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [560656164] [2025-03-04 00:10:43,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [560656164] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:10:43,274 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-04 00:10:43,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2025-03-04 00:10:43,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833442849] [2025-03-04 00:10:43,274 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-04 00:10:43,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 00:10:43,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:10:43,275 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 00:10:43,276 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306 [2025-03-04 00:10:43,276 INFO L87 Difference]: Start difference. First operand 317 states and 458 transitions. Second operand has 13 states, 13 states have (on average 6.076923076923077) internal successors, (79), 12 states have internal predecessors, (79), 3 states have call successors, (38), 3 states have call predecessors, (38), 4 states have return successors, (38), 2 states have call predecessors, (38), 3 states have call successors, (38) [2025-03-04 00:10:43,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:10:43,969 INFO L93 Difference]: Finished difference Result 835 states and 1199 transitions. [2025-03-04 00:10:43,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-04 00:10:43,970 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.076923076923077) internal successors, (79), 12 states have internal predecessors, (79), 3 states have call successors, (38), 3 states have call predecessors, (38), 4 states have return successors, (38), 2 states have call predecessors, (38), 3 states have call successors, (38) Word has length 257 [2025-03-04 00:10:43,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:10:43,973 INFO L225 Difference]: With dead ends: 835 [2025-03-04 00:10:43,973 INFO L226 Difference]: Without dead ends: 599 [2025-03-04 00:10:43,975 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 283 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=208, Invalid=722, Unknown=0, NotChecked=0, Total=930 [2025-03-04 00:10:43,975 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 240 mSDsluCounter, 1211 mSDsCounter, 0 mSdLazyCounter, 581 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 1359 SdHoareTripleChecker+Invalid, 662 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 581 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 00:10:43,976 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [240 Valid, 1359 Invalid, 662 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 581 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 00:10:43,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2025-03-04 00:10:44,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 459. [2025-03-04 00:10:44,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 459 states, 372 states have (on average 1.3521505376344085) internal successors, (503), 372 states have internal predecessors, (503), 76 states have call successors, (76), 10 states have call predecessors, (76), 10 states have return successors, (76), 76 states have call predecessors, (76), 76 states have call successors, (76) [2025-03-04 00:10:44,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 655 transitions. [2025-03-04 00:10:44,033 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 655 transitions. Word has length 257 [2025-03-04 00:10:44,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:10:44,034 INFO L471 AbstractCegarLoop]: Abstraction has 459 states and 655 transitions. [2025-03-04 00:10:44,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.076923076923077) internal successors, (79), 12 states have internal predecessors, (79), 3 states have call successors, (38), 3 states have call predecessors, (38), 4 states have return successors, (38), 2 states have call predecessors, (38), 3 states have call successors, (38) [2025-03-04 00:10:44,034 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 655 transitions. [2025-03-04 00:10:44,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2025-03-04 00:10:44,036 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:10:44,036 INFO L218 NwaCegarLoop]: trace histogram [38, 38, 38, 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, 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, 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, 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, 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-04 00:10:44,047 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-04 00:10:44,237 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-04 00:10:44,237 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:10:44,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:10:44,237 INFO L85 PathProgramCache]: Analyzing trace with hash 1098320522, now seen corresponding path program 1 times [2025-03-04 00:10:44,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:10:44,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918314509] [2025-03-04 00:10:44,238 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:10:44,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:10:44,257 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 258 statements into 1 equivalence classes. [2025-03-04 00:10:44,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 258 of 258 statements. [2025-03-04 00:10:44,385 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:10:44,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:10:44,645 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2812 trivial. 0 not checked. [2025-03-04 00:10:44,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:10:44,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918314509] [2025-03-04 00:10:44,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918314509] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:10:44,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:10:44,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 00:10:44,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541366028] [2025-03-04 00:10:44,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:10:44,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 00:10:44,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:10:44,646 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 00:10:44,646 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:10:44,647 INFO L87 Difference]: Start difference. First operand 459 states and 655 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 1 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 1 states have call successors, (38) [2025-03-04 00:10:44,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:10:44,726 INFO L93 Difference]: Finished difference Result 723 states and 1042 transitions. [2025-03-04 00:10:44,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 00:10:44,727 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 1 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 1 states have call successors, (38) Word has length 258 [2025-03-04 00:10:44,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:10:44,730 INFO L225 Difference]: With dead ends: 723 [2025-03-04 00:10:44,730 INFO L226 Difference]: Without dead ends: 479 [2025-03-04 00:10:44,731 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-04 00:10:44,731 INFO L435 NwaCegarLoop]: 206 mSDtfsCounter, 16 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:10:44,731 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 377 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 00:10:44,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2025-03-04 00:10:44,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 459. [2025-03-04 00:10:44,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 459 states, 372 states have (on average 1.3306451612903225) internal successors, (495), 372 states have internal predecessors, (495), 76 states have call successors, (76), 10 states have call predecessors, (76), 10 states have return successors, (76), 76 states have call predecessors, (76), 76 states have call successors, (76) [2025-03-04 00:10:44,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 647 transitions. [2025-03-04 00:10:44,765 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 647 transitions. Word has length 258 [2025-03-04 00:10:44,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:10:44,766 INFO L471 AbstractCegarLoop]: Abstraction has 459 states and 647 transitions. [2025-03-04 00:10:44,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 1 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 1 states have call successors, (38) [2025-03-04 00:10:44,766 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 647 transitions. [2025-03-04 00:10:44,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2025-03-04 00:10:44,768 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:10:44,768 INFO L218 NwaCegarLoop]: trace histogram [38, 38, 38, 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, 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, 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, 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, 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-04 00:10:44,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 00:10:44,768 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:10:44,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:10:44,769 INFO L85 PathProgramCache]: Analyzing trace with hash -746595772, now seen corresponding path program 1 times [2025-03-04 00:10:44,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:10:44,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392011848] [2025-03-04 00:10:44,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:10:44,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:10:44,783 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 259 statements into 1 equivalence classes. [2025-03-04 00:10:45,063 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 259 of 259 statements. [2025-03-04 00:10:45,064 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:10:45,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 00:10:45,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1866539068] [2025-03-04 00:10:45,067 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:10:45,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:10:45,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:10:45,069 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 00:10:45,074 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 00:10:45,159 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 259 statements into 1 equivalence classes. [2025-03-04 00:10:45,271 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 259 of 259 statements. [2025-03-04 00:10:45,271 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:10:45,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:10:45,275 INFO L256 TraceCheckSpWp]: Trace formula consists of 627 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-04 00:10:45,280 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:10:46,781 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 37 proven. 111 refuted. 0 times theorem prover too weak. 2664 trivial. 0 not checked. [2025-03-04 00:10:46,781 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:10:52,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:10:52,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392011848] [2025-03-04 00:10:52,096 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 00:10:52,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1866539068] [2025-03-04 00:10:52,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1866539068] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:10:52,096 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-04 00:10:52,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2025-03-04 00:10:52,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292195161] [2025-03-04 00:10:52,096 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-04 00:10:52,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-04 00:10:52,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:10:52,097 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-04 00:10:52,097 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=440, Unknown=0, NotChecked=0, Total=552 [2025-03-04 00:10:52,097 INFO L87 Difference]: Start difference. First operand 459 states and 647 transitions. Second operand has 15 states, 15 states have (on average 5.0) internal successors, (75), 14 states have internal predecessors, (75), 2 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 1 states have call predecessors, (38), 2 states have call successors, (38) [2025-03-04 00:10:54,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:10:54,384 INFO L93 Difference]: Finished difference Result 1129 states and 1572 transitions. [2025-03-04 00:10:54,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-03-04 00:10:54,384 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.0) internal successors, (75), 14 states have internal predecessors, (75), 2 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 1 states have call predecessors, (38), 2 states have call successors, (38) Word has length 259 [2025-03-04 00:10:54,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:10:54,391 INFO L225 Difference]: With dead ends: 1129 [2025-03-04 00:10:54,391 INFO L226 Difference]: Without dead ends: 879 [2025-03-04 00:10:54,393 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 326 GetRequests, 281 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 452 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=525, Invalid=1637, Unknown=0, NotChecked=0, Total=2162 [2025-03-04 00:10:54,394 INFO L435 NwaCegarLoop]: 279 mSDtfsCounter, 1020 mSDsluCounter, 1930 mSDsCounter, 0 mSdLazyCounter, 2216 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1020 SdHoareTripleChecker+Valid, 2209 SdHoareTripleChecker+Invalid, 2299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 2216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-04 00:10:54,394 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1020 Valid, 2209 Invalid, 2299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 2216 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-04 00:10:54,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 879 states. [2025-03-04 00:10:54,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 879 to 482. [2025-03-04 00:10:54,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 482 states, 395 states have (on average 1.3316455696202532) internal successors, (526), 395 states have internal predecessors, (526), 76 states have call successors, (76), 10 states have call predecessors, (76), 10 states have return successors, (76), 76 states have call predecessors, (76), 76 states have call successors, (76) [2025-03-04 00:10:54,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 678 transitions. [2025-03-04 00:10:54,431 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 678 transitions. Word has length 259 [2025-03-04 00:10:54,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:10:54,432 INFO L471 AbstractCegarLoop]: Abstraction has 482 states and 678 transitions. [2025-03-04 00:10:54,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.0) internal successors, (75), 14 states have internal predecessors, (75), 2 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 1 states have call predecessors, (38), 2 states have call successors, (38) [2025-03-04 00:10:54,432 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 678 transitions. [2025-03-04 00:10:54,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2025-03-04 00:10:54,434 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:10:54,434 INFO L218 NwaCegarLoop]: trace histogram [38, 38, 38, 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, 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, 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, 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, 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-04 00:10:54,441 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-04 00:10:54,638 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,SelfDestructingSolverStorable10 [2025-03-04 00:10:54,638 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:10:54,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:10:54,638 INFO L85 PathProgramCache]: Analyzing trace with hash 1203704483, now seen corresponding path program 1 times [2025-03-04 00:10:54,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:10:54,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436030648] [2025-03-04 00:10:54,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:10:54,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:10:54,654 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 259 statements into 1 equivalence classes. [2025-03-04 00:10:54,927 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 259 of 259 statements. [2025-03-04 00:10:54,927 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:10:54,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 00:10:54,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1293025585] [2025-03-04 00:10:54,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:10:54,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:10:54,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:10:54,931 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 00:10:54,932 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 00:10:55,016 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 259 statements into 1 equivalence classes. [2025-03-04 00:10:55,166 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 259 of 259 statements. [2025-03-04 00:10:55,167 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:10:55,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:10:55,169 INFO L256 TraceCheckSpWp]: Trace formula consists of 627 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-04 00:10:55,173 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:10:56,730 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 1021 proven. 267 refuted. 0 times theorem prover too weak. 1524 trivial. 0 not checked. [2025-03-04 00:10:56,730 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:11:03,958 WARN L286 SmtUtils]: Spent 6.43s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-04 00:11:18,249 WARN L286 SmtUtils]: Spent 9.41s on a formula simplification that was a NOOP. DAG size: 38 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-03-04 00:11:39,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:11:39,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436030648] [2025-03-04 00:11:39,737 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 00:11:39,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1293025585] [2025-03-04 00:11:39,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1293025585] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:11:39,737 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-04 00:11:39,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2025-03-04 00:11:39,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318116591] [2025-03-04 00:11:39,737 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-04 00:11:39,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-04 00:11:39,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:11:39,738 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-04 00:11:39,738 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=463, Unknown=1, NotChecked=0, Total=600 [2025-03-04 00:11:39,739 INFO L87 Difference]: Start difference. First operand 482 states and 678 transitions. Second operand has 18 states, 18 states have (on average 4.666666666666667) internal successors, (84), 16 states have internal predecessors, (84), 4 states have call successors, (38), 4 states have call predecessors, (38), 5 states have return successors, (38), 3 states have call predecessors, (38), 4 states have call successors, (38) [2025-03-04 00:11:42,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:11:42,418 INFO L93 Difference]: Finished difference Result 1670 states and 2332 transitions. [2025-03-04 00:11:42,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-03-04 00:11:42,419 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.666666666666667) internal successors, (84), 16 states have internal predecessors, (84), 4 states have call successors, (38), 4 states have call predecessors, (38), 5 states have return successors, (38), 3 states have call predecessors, (38), 4 states have call successors, (38) Word has length 259 [2025-03-04 00:11:42,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:11:42,423 INFO L225 Difference]: With dead ends: 1670 [2025-03-04 00:11:42,423 INFO L226 Difference]: Without dead ends: 1414 [2025-03-04 00:11:42,425 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 319 GetRequests, 280 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 383 ImplicationChecksByTransitivity, 23.1s TimeCoverageRelationStatistics Valid=398, Invalid=1241, Unknown=1, NotChecked=0, Total=1640 [2025-03-04 00:11:42,425 INFO L435 NwaCegarLoop]: 282 mSDtfsCounter, 819 mSDsluCounter, 1999 mSDsCounter, 0 mSdLazyCounter, 2456 mSolverCounterSat, 155 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 820 SdHoareTripleChecker+Valid, 2281 SdHoareTripleChecker+Invalid, 2611 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 155 IncrementalHoareTripleChecker+Valid, 2456 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-04 00:11:42,425 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [820 Valid, 2281 Invalid, 2611 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [155 Valid, 2456 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-04 00:11:42,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1414 states. [2025-03-04 00:11:42,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1414 to 861. [2025-03-04 00:11:42,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 861 states, 729 states have (on average 1.3415637860082306) internal successors, (978), 729 states have internal predecessors, (978), 114 states have call successors, (114), 17 states have call predecessors, (114), 17 states have return successors, (114), 114 states have call predecessors, (114), 114 states have call successors, (114) [2025-03-04 00:11:42,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 861 states to 861 states and 1206 transitions. [2025-03-04 00:11:42,485 INFO L78 Accepts]: Start accepts. Automaton has 861 states and 1206 transitions. Word has length 259 [2025-03-04 00:11:42,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:11:42,486 INFO L471 AbstractCegarLoop]: Abstraction has 861 states and 1206 transitions. [2025-03-04 00:11:42,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.666666666666667) internal successors, (84), 16 states have internal predecessors, (84), 4 states have call successors, (38), 4 states have call predecessors, (38), 5 states have return successors, (38), 3 states have call predecessors, (38), 4 states have call successors, (38) [2025-03-04 00:11:42,486 INFO L276 IsEmpty]: Start isEmpty. Operand 861 states and 1206 transitions. [2025-03-04 00:11:42,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2025-03-04 00:11:42,488 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:11:42,488 INFO L218 NwaCegarLoop]: trace histogram [38, 38, 38, 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, 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, 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, 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, 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-04 00:11:42,497 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-04 00:11:42,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:11:42,689 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:11:42,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:11:42,690 INFO L85 PathProgramCache]: Analyzing trace with hash 1877499955, now seen corresponding path program 1 times [2025-03-04 00:11:42,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:11:42,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136963206] [2025-03-04 00:11:42,690 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:11:42,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:11:42,705 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 260 statements into 1 equivalence classes. [2025-03-04 00:11:42,792 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 260 of 260 statements. [2025-03-04 00:11:42,792 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:11:42,792 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:11:43,733 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2812 trivial. 0 not checked. [2025-03-04 00:11:43,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:11:43,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136963206] [2025-03-04 00:11:43,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136963206] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:11:43,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:11:43,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 00:11:43,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098367851] [2025-03-04 00:11:43,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:11:43,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 00:11:43,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:11:43,735 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 00:11:43,735 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 00:11:43,735 INFO L87 Difference]: Start difference. First operand 861 states and 1206 transitions. Second operand has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 1 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 1 states have call successors, (38) [2025-03-04 00:11:44,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:11:44,306 INFO L93 Difference]: Finished difference Result 1580 states and 2216 transitions. [2025-03-04 00:11:44,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 00:11:44,306 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 1 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 1 states have call successors, (38) Word has length 260 [2025-03-04 00:11:44,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:11:44,310 INFO L225 Difference]: With dead ends: 1580 [2025-03-04 00:11:44,310 INFO L226 Difference]: Without dead ends: 1017 [2025-03-04 00:11:44,311 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2025-03-04 00:11:44,312 INFO L435 NwaCegarLoop]: 240 mSDtfsCounter, 290 mSDsluCounter, 723 mSDsCounter, 0 mSdLazyCounter, 480 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 963 SdHoareTripleChecker+Invalid, 596 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 480 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 00:11:44,312 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [290 Valid, 963 Invalid, 596 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 480 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 00:11:44,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1017 states. [2025-03-04 00:11:44,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1017 to 937. [2025-03-04 00:11:44,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 937 states, 805 states have (on average 1.3453416149068322) internal successors, (1083), 805 states have internal predecessors, (1083), 114 states have call successors, (114), 17 states have call predecessors, (114), 17 states have return successors, (114), 114 states have call predecessors, (114), 114 states have call successors, (114) [2025-03-04 00:11:44,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 937 states to 937 states and 1311 transitions. [2025-03-04 00:11:44,408 INFO L78 Accepts]: Start accepts. Automaton has 937 states and 1311 transitions. Word has length 260 [2025-03-04 00:11:44,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:11:44,408 INFO L471 AbstractCegarLoop]: Abstraction has 937 states and 1311 transitions. [2025-03-04 00:11:44,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 1 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 1 states have call successors, (38) [2025-03-04 00:11:44,408 INFO L276 IsEmpty]: Start isEmpty. Operand 937 states and 1311 transitions. [2025-03-04 00:11:44,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2025-03-04 00:11:44,412 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:11:44,412 INFO L218 NwaCegarLoop]: trace histogram [38, 38, 38, 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, 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, 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, 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, 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-04 00:11:44,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 00:11:44,412 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:11:44,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:11:44,415 INFO L85 PathProgramCache]: Analyzing trace with hash -2087701580, now seen corresponding path program 1 times [2025-03-04 00:11:44,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:11:44,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306803241] [2025-03-04 00:11:44,415 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:11:44,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:11:44,434 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 260 statements into 1 equivalence classes. [2025-03-04 00:11:44,769 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 260 of 260 statements. [2025-03-04 00:11:44,769 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:11:44,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:11:50,068 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 681 proven. 210 refuted. 0 times theorem prover too weak. 1921 trivial. 0 not checked. [2025-03-04 00:11:50,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:11:50,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306803241] [2025-03-04 00:11:50,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306803241] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:11:50,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1053371528] [2025-03-04 00:11:50,068 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:11:50,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:11:50,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:11:50,070 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 00:11:50,071 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 00:11:50,159 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 260 statements into 1 equivalence classes. [2025-03-04 00:11:50,261 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 260 of 260 statements. [2025-03-04 00:11:50,261 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:11:50,261 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:11:50,265 INFO L256 TraceCheckSpWp]: Trace formula consists of 632 conjuncts, 79 conjuncts are in the unsatisfiable core [2025-03-04 00:11:50,270 INFO L279 TraceCheckSpWp]: Computing forward predicates...