./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-22.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-22.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 ae10f7a0aac4ff5642a6d224665fe38f2df489ec0407dcdcfbdd7d0fdf46302b --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 11:17:22,235 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 11:17:22,298 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 11:17:22,303 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 11:17:22,305 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 11:17:22,326 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 11:17:22,327 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 11:17:22,327 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 11:17:22,327 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 11:17:22,327 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 11:17:22,327 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 11:17:22,328 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 11:17:22,328 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 11:17:22,328 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 11:17:22,328 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 11:17:22,328 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 11:17:22,328 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 11:17:22,328 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 11:17:22,328 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 11:17:22,328 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 11:17:22,328 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 11:17:22,328 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 11:17:22,328 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 11:17:22,328 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 11:17:22,328 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 11:17:22,328 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 11:17:22,328 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 11:17:22,328 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 11:17:22,329 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 11:17:22,329 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 11:17:22,329 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 11:17:22,329 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 11:17:22,329 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 11:17:22,329 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 11:17:22,329 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 11:17:22,329 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 11:17:22,329 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 11:17:22,329 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 11:17:22,329 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 11:17:22,329 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 11:17:22,329 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 11:17:22,329 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 11:17:22,329 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 11:17:22,329 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 -> ae10f7a0aac4ff5642a6d224665fe38f2df489ec0407dcdcfbdd7d0fdf46302b [2025-03-08 11:17:22,551 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 11:17:22,560 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 11:17:22,562 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 11:17:22,564 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 11:17:22,564 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 11:17:22,566 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-22.i [2025-03-08 11:17:23,758 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc6910ed9/20a7241d31af4b3f8b57c6033ee78173/FLAG63c5456e5 [2025-03-08 11:17:24,015 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 11:17:24,016 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-22.i [2025-03-08 11:17:24,035 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc6910ed9/20a7241d31af4b3f8b57c6033ee78173/FLAG63c5456e5 [2025-03-08 11:17:24,054 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc6910ed9/20a7241d31af4b3f8b57c6033ee78173 [2025-03-08 11:17:24,056 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 11:17:24,057 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 11:17:24,059 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 11:17:24,060 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 11:17:24,063 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 11:17:24,064 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 11:17:24" (1/1) ... [2025-03-08 11:17:24,064 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5031874c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:17:24, skipping insertion in model container [2025-03-08 11:17:24,065 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 11:17:24" (1/1) ... [2025-03-08 11:17:24,096 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 11:17:24,203 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_fillercode_fillercodesize_ps-cn-500_file-22.i[916,929] [2025-03-08 11:17:24,359 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 11:17:24,372 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 11:17:24,382 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_fillercode_fillercodesize_ps-cn-500_file-22.i[916,929] [2025-03-08 11:17:24,455 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 11:17:24,472 INFO L204 MainTranslator]: Completed translation [2025-03-08 11:17:24,473 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:17:24 WrapperNode [2025-03-08 11:17:24,474 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 11:17:24,474 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 11:17:24,475 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 11:17:24,475 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 11:17:24,479 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:17:24" (1/1) ... [2025-03-08 11:17:24,491 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:17:24" (1/1) ... [2025-03-08 11:17:24,544 INFO L138 Inliner]: procedures = 26, calls = 136, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 942 [2025-03-08 11:17:24,544 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 11:17:24,545 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 11:17:24,545 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 11:17:24,545 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 11:17:24,551 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:17:24" (1/1) ... [2025-03-08 11:17:24,552 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:17:24" (1/1) ... [2025-03-08 11:17:24,567 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:17:24" (1/1) ... [2025-03-08 11:17:24,600 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-08 11:17:24,601 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:17:24" (1/1) ... [2025-03-08 11:17:24,601 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:17:24" (1/1) ... [2025-03-08 11:17:24,623 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:17:24" (1/1) ... [2025-03-08 11:17:24,627 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:17:24" (1/1) ... [2025-03-08 11:17:24,636 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:17:24" (1/1) ... [2025-03-08 11:17:24,647 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:17:24" (1/1) ... [2025-03-08 11:17:24,658 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 11:17:24,660 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 11:17:24,660 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 11:17:24,660 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 11:17:24,661 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:17:24" (1/1) ... [2025-03-08 11:17:24,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 11:17:24,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 11:17:24,685 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-08 11:17:24,687 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-08 11:17:24,703 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 11:17:24,703 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 11:17:24,703 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 11:17:24,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 11:17:24,704 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 11:17:24,704 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 11:17:24,823 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 11:17:24,825 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 11:17:25,733 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L745: havoc property_#t~bitwise93#1;havoc property_#t~short94#1; [2025-03-08 11:17:25,968 INFO L? ?]: Removed 25 outVars from TransFormulas that were not future-live. [2025-03-08 11:17:25,969 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 11:17:26,006 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 11:17:26,006 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 11:17:26,010 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 11:17:26 BoogieIcfgContainer [2025-03-08 11:17:26,011 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 11:17:26,012 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 11:17:26,012 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 11:17:26,016 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 11:17:26,016 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 11:17:24" (1/3) ... [2025-03-08 11:17:26,017 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b82faa5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 11:17:26, skipping insertion in model container [2025-03-08 11:17:26,017 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:17:24" (2/3) ... [2025-03-08 11:17:26,017 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b82faa5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 11:17:26, skipping insertion in model container [2025-03-08 11:17:26,018 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 11:17:26" (3/3) ... [2025-03-08 11:17:26,018 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-22.i [2025-03-08 11:17:26,029 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 11:17:26,032 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-22.i that has 2 procedures, 391 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 11:17:26,087 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 11:17:26,098 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3597b561, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 11:17:26,098 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 11:17:26,103 INFO L276 IsEmpty]: Start isEmpty. Operand has 391 states, 265 states have (on average 1.5849056603773586) internal successors, (420), 266 states have internal predecessors, (420), 123 states have call successors, (123), 1 states have call predecessors, (123), 1 states have return successors, (123), 123 states have call predecessors, (123), 123 states have call successors, (123) [2025-03-08 11:17:26,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 778 [2025-03-08 11:17:26,128 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:17:26,129 INFO L218 NwaCegarLoop]: trace histogram [123, 123, 123, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 11:17:26,130 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:17:26,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:17:26,133 INFO L85 PathProgramCache]: Analyzing trace with hash 474364758, now seen corresponding path program 1 times [2025-03-08 11:17:26,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:17:26,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539829644] [2025-03-08 11:17:26,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:17:26,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:17:26,256 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 777 statements into 1 equivalence classes. [2025-03-08 11:17:26,311 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 777 of 777 statements. [2025-03-08 11:17:26,311 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:17:26,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:17:26,703 INFO L134 CoverageAnalysis]: Checked inductivity of 30012 backedges. 0 proven. 244 refuted. 0 times theorem prover too weak. 29768 trivial. 0 not checked. [2025-03-08 11:17:26,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:17:26,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539829644] [2025-03-08 11:17:26,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539829644] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 11:17:26,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2082136879] [2025-03-08 11:17:26,706 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:17:26,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 11:17:26,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 11:17:26,708 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-08 11:17:26,710 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-08 11:17:26,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 777 statements into 1 equivalence classes. [2025-03-08 11:17:27,084 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 777 of 777 statements. [2025-03-08 11:17:27,084 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:17:27,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:17:27,092 INFO L256 TraceCheckSpWp]: Trace formula consists of 1730 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 11:17:27,111 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 11:17:27,164 INFO L134 CoverageAnalysis]: Checked inductivity of 30012 backedges. 244 proven. 0 refuted. 0 times theorem prover too weak. 29768 trivial. 0 not checked. [2025-03-08 11:17:27,165 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 11:17:27,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2082136879] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:17:27,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 11:17:27,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 11:17:27,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153624477] [2025-03-08 11:17:27,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:17:27,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 11:17:27,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:17:27,189 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 11:17:27,189 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 11:17:27,191 INFO L87 Difference]: Start difference. First operand has 391 states, 265 states have (on average 1.5849056603773586) internal successors, (420), 266 states have internal predecessors, (420), 123 states have call successors, (123), 1 states have call predecessors, (123), 1 states have return successors, (123), 123 states have call predecessors, (123), 123 states have call successors, (123) Second operand has 2 states, 2 states have (on average 83.5) internal successors, (167), 2 states have internal predecessors, (167), 2 states have call successors, (123), 2 states have call predecessors, (123), 1 states have return successors, (123), 1 states have call predecessors, (123), 2 states have call successors, (123) [2025-03-08 11:17:27,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:17:27,291 INFO L93 Difference]: Finished difference Result 776 states and 1450 transitions. [2025-03-08 11:17:27,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 11:17:27,293 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 83.5) internal successors, (167), 2 states have internal predecessors, (167), 2 states have call successors, (123), 2 states have call predecessors, (123), 1 states have return successors, (123), 1 states have call predecessors, (123), 2 states have call successors, (123) Word has length 777 [2025-03-08 11:17:27,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:17:27,302 INFO L225 Difference]: With dead ends: 776 [2025-03-08 11:17:27,303 INFO L226 Difference]: Without dead ends: 388 [2025-03-08 11:17:27,308 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 778 GetRequests, 778 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-08 11:17:27,311 INFO L435 NwaCegarLoop]: 637 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 637 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 11:17:27,312 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 637 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 11:17:27,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2025-03-08 11:17:27,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 388. [2025-03-08 11:17:27,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 388 states, 263 states have (on average 1.570342205323194) internal successors, (413), 263 states have internal predecessors, (413), 123 states have call successors, (123), 1 states have call predecessors, (123), 1 states have return successors, (123), 123 states have call predecessors, (123), 123 states have call successors, (123) [2025-03-08 11:17:27,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 659 transitions. [2025-03-08 11:17:27,404 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 659 transitions. Word has length 777 [2025-03-08 11:17:27,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:17:27,405 INFO L471 AbstractCegarLoop]: Abstraction has 388 states and 659 transitions. [2025-03-08 11:17:27,405 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 83.5) internal successors, (167), 2 states have internal predecessors, (167), 2 states have call successors, (123), 2 states have call predecessors, (123), 1 states have return successors, (123), 1 states have call predecessors, (123), 2 states have call successors, (123) [2025-03-08 11:17:27,405 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 659 transitions. [2025-03-08 11:17:27,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 778 [2025-03-08 11:17:27,420 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:17:27,420 INFO L218 NwaCegarLoop]: trace histogram [123, 123, 123, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 11:17:27,429 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-08 11:17:27,625 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-08 11:17:27,625 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:17:27,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:17:27,626 INFO L85 PathProgramCache]: Analyzing trace with hash -920965660, now seen corresponding path program 1 times [2025-03-08 11:17:27,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:17:27,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730321912] [2025-03-08 11:17:27,626 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:17:27,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:17:27,681 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 777 statements into 1 equivalence classes. [2025-03-08 11:17:27,775 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 777 of 777 statements. [2025-03-08 11:17:27,778 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:17:27,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:17:28,456 INFO L134 CoverageAnalysis]: Checked inductivity of 30012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30012 trivial. 0 not checked. [2025-03-08 11:17:28,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:17:28,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730321912] [2025-03-08 11:17:28,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730321912] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:17:28,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:17:28,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 11:17:28,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328568441] [2025-03-08 11:17:28,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:17:28,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 11:17:28,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:17:28,463 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 11:17:28,465 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:17:28,465 INFO L87 Difference]: Start difference. First operand 388 states and 659 transitions. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 1 states have call successors, (123), 1 states have call predecessors, (123), 1 states have return successors, (123), 1 states have call predecessors, (123), 1 states have call successors, (123) [2025-03-08 11:17:28,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:17:28,579 INFO L93 Difference]: Finished difference Result 978 states and 1671 transitions. [2025-03-08 11:17:28,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 11:17:28,580 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 1 states have call successors, (123), 1 states have call predecessors, (123), 1 states have return successors, (123), 1 states have call predecessors, (123), 1 states have call successors, (123) Word has length 777 [2025-03-08 11:17:28,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:17:28,589 INFO L225 Difference]: With dead ends: 978 [2025-03-08 11:17:28,589 INFO L226 Difference]: Without dead ends: 593 [2025-03-08 11:17:28,591 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-08 11:17:28,591 INFO L435 NwaCegarLoop]: 696 mSDtfsCounter, 326 mSDsluCounter, 622 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 326 SdHoareTripleChecker+Valid, 1318 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 11:17:28,591 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [326 Valid, 1318 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 11:17:28,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2025-03-08 11:17:28,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 590. [2025-03-08 11:17:28,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 590 states, 441 states have (on average 1.6235827664399094) internal successors, (716), 442 states have internal predecessors, (716), 146 states have call successors, (146), 2 states have call predecessors, (146), 2 states have return successors, (146), 145 states have call predecessors, (146), 146 states have call successors, (146) [2025-03-08 11:17:28,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 1008 transitions. [2025-03-08 11:17:28,655 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 1008 transitions. Word has length 777 [2025-03-08 11:17:28,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:17:28,656 INFO L471 AbstractCegarLoop]: Abstraction has 590 states and 1008 transitions. [2025-03-08 11:17:28,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 1 states have call successors, (123), 1 states have call predecessors, (123), 1 states have return successors, (123), 1 states have call predecessors, (123), 1 states have call successors, (123) [2025-03-08 11:17:28,657 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 1008 transitions. [2025-03-08 11:17:28,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 778 [2025-03-08 11:17:28,668 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:17:28,669 INFO L218 NwaCegarLoop]: trace histogram [123, 123, 123, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 11:17:28,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 11:17:28,669 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:17:28,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:17:28,670 INFO L85 PathProgramCache]: Analyzing trace with hash 944584994, now seen corresponding path program 1 times [2025-03-08 11:17:28,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:17:28,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465956201] [2025-03-08 11:17:28,670 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:17:28,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:17:28,704 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 777 statements into 1 equivalence classes. [2025-03-08 11:17:28,758 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 777 of 777 statements. [2025-03-08 11:17:28,759 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:17:28,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:17:29,185 INFO L134 CoverageAnalysis]: Checked inductivity of 30012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30012 trivial. 0 not checked. [2025-03-08 11:17:29,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:17:29,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465956201] [2025-03-08 11:17:29,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465956201] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:17:29,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:17:29,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 11:17:29,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654411915] [2025-03-08 11:17:29,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:17:29,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 11:17:29,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:17:29,191 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 11:17:29,192 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 11:17:29,192 INFO L87 Difference]: Start difference. First operand 590 states and 1008 transitions. Second operand has 4 states, 4 states have (on average 41.25) internal successors, (165), 4 states have internal predecessors, (165), 1 states have call successors, (123), 1 states have call predecessors, (123), 1 states have return successors, (123), 1 states have call predecessors, (123), 1 states have call successors, (123) [2025-03-08 11:17:30,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:17:30,062 INFO L93 Difference]: Finished difference Result 2317 states and 3961 transitions. [2025-03-08 11:17:30,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 11:17:30,063 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 41.25) internal successors, (165), 4 states have internal predecessors, (165), 1 states have call successors, (123), 1 states have call predecessors, (123), 1 states have return successors, (123), 1 states have call predecessors, (123), 1 states have call successors, (123) Word has length 777 [2025-03-08 11:17:30,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:17:30,075 INFO L225 Difference]: With dead ends: 2317 [2025-03-08 11:17:30,076 INFO L226 Difference]: Without dead ends: 1730 [2025-03-08 11:17:30,078 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 11:17:30,078 INFO L435 NwaCegarLoop]: 1073 mSDtfsCounter, 1004 mSDsluCounter, 994 mSDsCounter, 0 mSdLazyCounter, 374 mSolverCounterSat, 246 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1004 SdHoareTripleChecker+Valid, 2067 SdHoareTripleChecker+Invalid, 620 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 246 IncrementalHoareTripleChecker+Valid, 374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 11:17:30,079 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1004 Valid, 2067 Invalid, 620 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [246 Valid, 374 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 11:17:30,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1730 states. [2025-03-08 11:17:30,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1730 to 1726. [2025-03-08 11:17:30,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1726 states, 1281 states have (on average 1.620608899297424) internal successors, (2076), 1284 states have internal predecessors, (2076), 438 states have call successors, (438), 6 states have call predecessors, (438), 6 states have return successors, (438), 435 states have call predecessors, (438), 438 states have call successors, (438) [2025-03-08 11:17:30,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1726 states to 1726 states and 2952 transitions. [2025-03-08 11:17:30,262 INFO L78 Accepts]: Start accepts. Automaton has 1726 states and 2952 transitions. Word has length 777 [2025-03-08 11:17:30,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:17:30,264 INFO L471 AbstractCegarLoop]: Abstraction has 1726 states and 2952 transitions. [2025-03-08 11:17:30,264 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 41.25) internal successors, (165), 4 states have internal predecessors, (165), 1 states have call successors, (123), 1 states have call predecessors, (123), 1 states have return successors, (123), 1 states have call predecessors, (123), 1 states have call successors, (123) [2025-03-08 11:17:30,264 INFO L276 IsEmpty]: Start isEmpty. Operand 1726 states and 2952 transitions. [2025-03-08 11:17:30,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 778 [2025-03-08 11:17:30,271 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:17:30,272 INFO L218 NwaCegarLoop]: trace histogram [123, 123, 123, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 11:17:30,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 11:17:30,272 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:17:30,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:17:30,273 INFO L85 PathProgramCache]: Analyzing trace with hash -1596107231, now seen corresponding path program 1 times [2025-03-08 11:17:30,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:17:30,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714650759] [2025-03-08 11:17:30,274 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:17:30,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:17:30,307 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 777 statements into 1 equivalence classes. [2025-03-08 11:17:30,347 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 777 of 777 statements. [2025-03-08 11:17:30,348 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:17:30,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:17:30,537 INFO L134 CoverageAnalysis]: Checked inductivity of 30012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30012 trivial. 0 not checked. [2025-03-08 11:17:30,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:17:30,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714650759] [2025-03-08 11:17:30,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714650759] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:17:30,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:17:30,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 11:17:30,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523072109] [2025-03-08 11:17:30,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:17:30,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 11:17:30,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:17:30,539 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 11:17:30,540 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:17:30,540 INFO L87 Difference]: Start difference. First operand 1726 states and 2952 transitions. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 1 states have call successors, (123), 1 states have call predecessors, (123), 1 states have return successors, (123), 1 states have call predecessors, (123), 1 states have call successors, (123) [2025-03-08 11:17:30,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:17:30,679 INFO L93 Difference]: Finished difference Result 4621 states and 7922 transitions. [2025-03-08 11:17:30,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 11:17:30,680 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 1 states have call successors, (123), 1 states have call predecessors, (123), 1 states have return successors, (123), 1 states have call predecessors, (123), 1 states have call successors, (123) Word has length 777 [2025-03-08 11:17:30,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:17:30,696 INFO L225 Difference]: With dead ends: 4621 [2025-03-08 11:17:30,696 INFO L226 Difference]: Without dead ends: 2898 [2025-03-08 11:17:30,703 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-08 11:17:30,705 INFO L435 NwaCegarLoop]: 670 mSDtfsCounter, 338 mSDsluCounter, 615 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 338 SdHoareTripleChecker+Valid, 1285 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 11:17:30,706 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [338 Valid, 1285 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 11:17:30,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2898 states. [2025-03-08 11:17:30,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2898 to 2893. [2025-03-08 11:17:30,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2893 states, 2262 states have (on average 1.6396993810786915) internal successors, (3709), 2271 states have internal predecessors, (3709), 618 states have call successors, (618), 12 states have call predecessors, (618), 12 states have return successors, (618), 609 states have call predecessors, (618), 618 states have call successors, (618) [2025-03-08 11:17:30,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2893 states to 2893 states and 4945 transitions. [2025-03-08 11:17:30,903 INFO L78 Accepts]: Start accepts. Automaton has 2893 states and 4945 transitions. Word has length 777 [2025-03-08 11:17:30,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:17:30,905 INFO L471 AbstractCegarLoop]: Abstraction has 2893 states and 4945 transitions. [2025-03-08 11:17:30,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 1 states have call successors, (123), 1 states have call predecessors, (123), 1 states have return successors, (123), 1 states have call predecessors, (123), 1 states have call successors, (123) [2025-03-08 11:17:30,905 INFO L276 IsEmpty]: Start isEmpty. Operand 2893 states and 4945 transitions. [2025-03-08 11:17:30,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 778 [2025-03-08 11:17:30,915 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:17:30,915 INFO L218 NwaCegarLoop]: trace histogram [123, 123, 123, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 11:17:30,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 11:17:30,916 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:17:30,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:17:30,916 INFO L85 PathProgramCache]: Analyzing trace with hash -252673470, now seen corresponding path program 1 times [2025-03-08 11:17:30,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:17:30,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198408946] [2025-03-08 11:17:30,918 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:17:30,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:17:30,965 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 777 statements into 1 equivalence classes. [2025-03-08 11:17:31,000 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 777 of 777 statements. [2025-03-08 11:17:31,000 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:17:31,000 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:17:31,167 INFO L134 CoverageAnalysis]: Checked inductivity of 30012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30012 trivial. 0 not checked. [2025-03-08 11:17:31,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:17:31,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198408946] [2025-03-08 11:17:31,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198408946] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:17:31,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:17:31,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 11:17:31,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587181883] [2025-03-08 11:17:31,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:17:31,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 11:17:31,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:17:31,169 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 11:17:31,169 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:17:31,169 INFO L87 Difference]: Start difference. First operand 2893 states and 4945 transitions. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 1 states have call successors, (123), 1 states have call predecessors, (123), 1 states have return successors, (123), 1 states have call predecessors, (123), 1 states have call successors, (123) [2025-03-08 11:17:31,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:17:31,453 INFO L93 Difference]: Finished difference Result 8649 states and 14787 transitions. [2025-03-08 11:17:31,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 11:17:31,454 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 1 states have call successors, (123), 1 states have call predecessors, (123), 1 states have return successors, (123), 1 states have call predecessors, (123), 1 states have call successors, (123) Word has length 777 [2025-03-08 11:17:31,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:17:31,493 INFO L225 Difference]: With dead ends: 8649 [2025-03-08 11:17:31,494 INFO L226 Difference]: Without dead ends: 5759 [2025-03-08 11:17:31,503 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-08 11:17:31,505 INFO L435 NwaCegarLoop]: 1041 mSDtfsCounter, 608 mSDsluCounter, 624 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 608 SdHoareTripleChecker+Valid, 1665 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 11:17:31,505 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [608 Valid, 1665 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 11:17:31,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5759 states. [2025-03-08 11:17:31,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5759 to 5757. [2025-03-08 11:17:31,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5757 states, 4496 states have (on average 1.6343416370106763) internal successors, (7348), 4514 states have internal predecessors, (7348), 1236 states have call successors, (1236), 24 states have call predecessors, (1236), 24 states have return successors, (1236), 1218 states have call predecessors, (1236), 1236 states have call successors, (1236) [2025-03-08 11:17:31,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5757 states to 5757 states and 9820 transitions. [2025-03-08 11:17:31,929 INFO L78 Accepts]: Start accepts. Automaton has 5757 states and 9820 transitions. Word has length 777 [2025-03-08 11:17:31,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:17:31,930 INFO L471 AbstractCegarLoop]: Abstraction has 5757 states and 9820 transitions. [2025-03-08 11:17:31,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 1 states have call successors, (123), 1 states have call predecessors, (123), 1 states have return successors, (123), 1 states have call predecessors, (123), 1 states have call successors, (123) [2025-03-08 11:17:31,931 INFO L276 IsEmpty]: Start isEmpty. Operand 5757 states and 9820 transitions. [2025-03-08 11:17:31,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 778 [2025-03-08 11:17:31,940 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:17:31,941 INFO L218 NwaCegarLoop]: trace histogram [123, 123, 123, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 11:17:31,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 11:17:31,941 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:17:31,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:17:31,942 INFO L85 PathProgramCache]: Analyzing trace with hash -241357343, now seen corresponding path program 1 times [2025-03-08 11:17:31,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:17:31,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995657720] [2025-03-08 11:17:31,942 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:17:31,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:17:31,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 777 statements into 1 equivalence classes. [2025-03-08 11:17:32,027 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 777 of 777 statements. [2025-03-08 11:17:32,027 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:17:32,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:17:32,330 INFO L134 CoverageAnalysis]: Checked inductivity of 30012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30012 trivial. 0 not checked. [2025-03-08 11:17:32,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:17:32,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995657720] [2025-03-08 11:17:32,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995657720] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:17:32,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:17:32,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 11:17:32,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705730147] [2025-03-08 11:17:32,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:17:32,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 11:17:32,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:17:32,332 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 11:17:32,333 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 11:17:32,333 INFO L87 Difference]: Start difference. First operand 5757 states and 9820 transitions. Second operand has 4 states, 4 states have (on average 41.25) internal successors, (165), 4 states have internal predecessors, (165), 2 states have call successors, (123), 1 states have call predecessors, (123), 1 states have return successors, (123), 2 states have call predecessors, (123), 2 states have call successors, (123) [2025-03-08 11:17:32,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:17:32,780 INFO L93 Difference]: Finished difference Result 17265 states and 29454 transitions. [2025-03-08 11:17:32,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 11:17:32,781 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 41.25) internal successors, (165), 4 states have internal predecessors, (165), 2 states have call successors, (123), 1 states have call predecessors, (123), 1 states have return successors, (123), 2 states have call predecessors, (123), 2 states have call successors, (123) Word has length 777 [2025-03-08 11:17:32,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:17:32,851 INFO L225 Difference]: With dead ends: 17265 [2025-03-08 11:17:32,851 INFO L226 Difference]: Without dead ends: 11511 [2025-03-08 11:17:32,872 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 11:17:32,872 INFO L435 NwaCegarLoop]: 624 mSDtfsCounter, 556 mSDsluCounter, 1220 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 556 SdHoareTripleChecker+Valid, 1844 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 11:17:32,873 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [556 Valid, 1844 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 11:17:32,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11511 states. [2025-03-08 11:17:33,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11511 to 11499. [2025-03-08 11:17:33,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11499 states, 8978 states have (on average 1.6319893071953664) internal successors, (14652), 9014 states have internal predecessors, (14652), 2472 states have call successors, (2472), 48 states have call predecessors, (2472), 48 states have return successors, (2472), 2436 states have call predecessors, (2472), 2472 states have call successors, (2472) [2025-03-08 11:17:33,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11499 states to 11499 states and 19596 transitions. [2025-03-08 11:17:33,784 INFO L78 Accepts]: Start accepts. Automaton has 11499 states and 19596 transitions. Word has length 777 [2025-03-08 11:17:33,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:17:33,785 INFO L471 AbstractCegarLoop]: Abstraction has 11499 states and 19596 transitions. [2025-03-08 11:17:33,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 41.25) internal successors, (165), 4 states have internal predecessors, (165), 2 states have call successors, (123), 1 states have call predecessors, (123), 1 states have return successors, (123), 2 states have call predecessors, (123), 2 states have call successors, (123) [2025-03-08 11:17:33,786 INFO L276 IsEmpty]: Start isEmpty. Operand 11499 states and 19596 transitions. [2025-03-08 11:17:33,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 778 [2025-03-08 11:17:33,799 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:17:33,799 INFO L218 NwaCegarLoop]: trace histogram [123, 123, 123, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 11:17:33,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 11:17:33,800 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:17:33,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:17:33,800 INFO L85 PathProgramCache]: Analyzing trace with hash 1944576704, now seen corresponding path program 1 times [2025-03-08 11:17:33,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:17:33,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048959436] [2025-03-08 11:17:33,800 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:17:33,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:17:33,829 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 777 statements into 1 equivalence classes. [2025-03-08 11:17:33,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 777 of 777 statements. [2025-03-08 11:17:33,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:17:33,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:17:34,360 INFO L134 CoverageAnalysis]: Checked inductivity of 30012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30012 trivial. 0 not checked. [2025-03-08 11:17:34,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:17:34,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048959436] [2025-03-08 11:17:34,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048959436] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:17:34,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:17:34,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 11:17:34,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452365032] [2025-03-08 11:17:34,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:17:34,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 11:17:34,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:17:34,363 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 11:17:34,363 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-08 11:17:34,364 INFO L87 Difference]: Start difference. First operand 11499 states and 19596 transitions. Second operand has 5 states, 5 states have (on average 33.0) internal successors, (165), 5 states have internal predecessors, (165), 1 states have call successors, (123), 1 states have call predecessors, (123), 1 states have return successors, (123), 1 states have call predecessors, (123), 1 states have call successors, (123) [2025-03-08 11:17:35,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:17:35,927 INFO L93 Difference]: Finished difference Result 40001 states and 67695 transitions. [2025-03-08 11:17:35,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 11:17:35,927 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.0) internal successors, (165), 5 states have internal predecessors, (165), 1 states have call successors, (123), 1 states have call predecessors, (123), 1 states have return successors, (123), 1 states have call predecessors, (123), 1 states have call successors, (123) Word has length 777 [2025-03-08 11:17:35,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:17:36,082 INFO L225 Difference]: With dead ends: 40001 [2025-03-08 11:17:36,083 INFO L226 Difference]: Without dead ends: 28505 [2025-03-08 11:17:36,119 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-08 11:17:36,121 INFO L435 NwaCegarLoop]: 713 mSDtfsCounter, 1315 mSDsluCounter, 1028 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 260 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1315 SdHoareTripleChecker+Valid, 1741 SdHoareTripleChecker+Invalid, 563 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 260 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 11:17:36,121 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1315 Valid, 1741 Invalid, 563 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [260 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 11:17:36,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28505 states. [2025-03-08 11:17:38,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28505 to 19395. [2025-03-08 11:17:38,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19395 states, 14678 states have (on average 1.6094835808693282) internal successors, (23624), 14762 states have internal predecessors, (23624), 4620 states have call successors, (4620), 96 states have call predecessors, (4620), 96 states have return successors, (4620), 4536 states have call predecessors, (4620), 4620 states have call successors, (4620) [2025-03-08 11:17:38,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19395 states to 19395 states and 32864 transitions. [2025-03-08 11:17:38,127 INFO L78 Accepts]: Start accepts. Automaton has 19395 states and 32864 transitions. Word has length 777 [2025-03-08 11:17:38,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:17:38,128 INFO L471 AbstractCegarLoop]: Abstraction has 19395 states and 32864 transitions. [2025-03-08 11:17:38,128 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.0) internal successors, (165), 5 states have internal predecessors, (165), 1 states have call successors, (123), 1 states have call predecessors, (123), 1 states have return successors, (123), 1 states have call predecessors, (123), 1 states have call successors, (123) [2025-03-08 11:17:38,128 INFO L276 IsEmpty]: Start isEmpty. Operand 19395 states and 32864 transitions. [2025-03-08 11:17:38,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 778 [2025-03-08 11:17:38,147 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:17:38,147 INFO L218 NwaCegarLoop]: trace histogram [123, 123, 123, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 11:17:38,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 11:17:38,148 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:17:38,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:17:38,148 INFO L85 PathProgramCache]: Analyzing trace with hash 1936817345, now seen corresponding path program 1 times [2025-03-08 11:17:38,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:17:38,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854421987] [2025-03-08 11:17:38,149 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:17:38,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:17:38,177 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 777 statements into 1 equivalence classes. [2025-03-08 11:17:38,226 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 777 of 777 statements. [2025-03-08 11:17:38,229 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:17:38,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:17:38,706 INFO L134 CoverageAnalysis]: Checked inductivity of 30012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30012 trivial. 0 not checked. [2025-03-08 11:17:38,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:17:38,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854421987] [2025-03-08 11:17:38,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854421987] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:17:38,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:17:38,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 11:17:38,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768919528] [2025-03-08 11:17:38,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:17:38,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 11:17:38,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:17:38,708 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 11:17:38,708 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 11:17:38,708 INFO L87 Difference]: Start difference. First operand 19395 states and 32864 transitions. Second operand has 5 states, 5 states have (on average 33.0) internal successors, (165), 5 states have internal predecessors, (165), 1 states have call successors, (123), 1 states have call predecessors, (123), 1 states have return successors, (123), 1 states have call predecessors, (123), 1 states have call successors, (123) [2025-03-08 11:17:40,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:17:40,069 INFO L93 Difference]: Finished difference Result 46689 states and 79157 transitions. [2025-03-08 11:17:40,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 11:17:40,070 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.0) internal successors, (165), 5 states have internal predecessors, (165), 1 states have call successors, (123), 1 states have call predecessors, (123), 1 states have return successors, (123), 1 states have call predecessors, (123), 1 states have call successors, (123) Word has length 777 [2025-03-08 11:17:40,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:17:40,192 INFO L225 Difference]: With dead ends: 46689 [2025-03-08 11:17:40,192 INFO L226 Difference]: Without dead ends: 27297 [2025-03-08 11:17:40,253 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 11:17:40,254 INFO L435 NwaCegarLoop]: 690 mSDtfsCounter, 1328 mSDsluCounter, 1456 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1328 SdHoareTripleChecker+Valid, 2146 SdHoareTripleChecker+Invalid, 327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 11:17:40,254 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1328 Valid, 2146 Invalid, 327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 11:17:40,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27297 states. [2025-03-08 11:17:41,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27297 to 27259. [2025-03-08 11:17:41,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27259 states, 21198 states have (on average 1.6217567695065571) internal successors, (34378), 21330 states have internal predecessors, (34378), 5916 states have call successors, (5916), 144 states have call predecessors, (5916), 144 states have return successors, (5916), 5784 states have call predecessors, (5916), 5916 states have call successors, (5916) [2025-03-08 11:17:41,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27259 states to 27259 states and 46210 transitions. [2025-03-08 11:17:41,929 INFO L78 Accepts]: Start accepts. Automaton has 27259 states and 46210 transitions. Word has length 777 [2025-03-08 11:17:41,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:17:41,930 INFO L471 AbstractCegarLoop]: Abstraction has 27259 states and 46210 transitions. [2025-03-08 11:17:41,930 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.0) internal successors, (165), 5 states have internal predecessors, (165), 1 states have call successors, (123), 1 states have call predecessors, (123), 1 states have return successors, (123), 1 states have call predecessors, (123), 1 states have call successors, (123) [2025-03-08 11:17:41,930 INFO L276 IsEmpty]: Start isEmpty. Operand 27259 states and 46210 transitions. [2025-03-08 11:17:41,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 778 [2025-03-08 11:17:41,958 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:17:41,958 INFO L218 NwaCegarLoop]: trace histogram [123, 123, 123, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 11:17:41,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 11:17:41,959 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:17:41,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:17:41,959 INFO L85 PathProgramCache]: Analyzing trace with hash 1690504258, now seen corresponding path program 1 times [2025-03-08 11:17:41,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:17:41,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723717152] [2025-03-08 11:17:41,960 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:17:41,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:17:41,989 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 777 statements into 1 equivalence classes. [2025-03-08 11:17:42,032 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 777 of 777 statements. [2025-03-08 11:17:42,032 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:17:42,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:17:42,355 INFO L134 CoverageAnalysis]: Checked inductivity of 30012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30012 trivial. 0 not checked. [2025-03-08 11:17:42,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:17:42,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723717152] [2025-03-08 11:17:42,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723717152] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:17:42,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:17:42,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 11:17:42,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294383659] [2025-03-08 11:17:42,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:17:42,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 11:17:42,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:17:42,357 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 11:17:42,358 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:17:42,358 INFO L87 Difference]: Start difference. First operand 27259 states and 46210 transitions. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 1 states have call successors, (123), 1 states have call predecessors, (123), 1 states have return successors, (123), 1 states have call predecessors, (123), 1 states have call successors, (123) [2025-03-08 11:17:43,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:17:43,601 INFO L93 Difference]: Finished difference Result 68180 states and 115638 transitions. [2025-03-08 11:17:43,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 11:17:43,601 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 1 states have call successors, (123), 1 states have call predecessors, (123), 1 states have return successors, (123), 1 states have call predecessors, (123), 1 states have call successors, (123) Word has length 777 [2025-03-08 11:17:43,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:17:43,764 INFO L225 Difference]: With dead ends: 68180 [2025-03-08 11:17:43,764 INFO L226 Difference]: Without dead ends: 40924 [2025-03-08 11:17:43,831 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-08 11:17:43,834 INFO L435 NwaCegarLoop]: 843 mSDtfsCounter, 435 mSDsluCounter, 622 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 435 SdHoareTripleChecker+Valid, 1465 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 11:17:43,835 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [435 Valid, 1465 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 11:17:43,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40924 states. [2025-03-08 11:17:46,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40924 to 40898. [2025-03-08 11:17:46,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40898 states, 31807 states have (on average 1.6190146823026377) internal successors, (51496), 32005 states have internal predecessors, (51496), 8874 states have call successors, (8874), 216 states have call predecessors, (8874), 216 states have return successors, (8874), 8676 states have call predecessors, (8874), 8874 states have call successors, (8874) [2025-03-08 11:17:46,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40898 states to 40898 states and 69244 transitions. [2025-03-08 11:17:46,394 INFO L78 Accepts]: Start accepts. Automaton has 40898 states and 69244 transitions. Word has length 777 [2025-03-08 11:17:46,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:17:46,395 INFO L471 AbstractCegarLoop]: Abstraction has 40898 states and 69244 transitions. [2025-03-08 11:17:46,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 1 states have call successors, (123), 1 states have call predecessors, (123), 1 states have return successors, (123), 1 states have call predecessors, (123), 1 states have call successors, (123) [2025-03-08 11:17:46,396 INFO L276 IsEmpty]: Start isEmpty. Operand 40898 states and 69244 transitions. [2025-03-08 11:17:46,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 779 [2025-03-08 11:17:46,431 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:17:46,431 INFO L218 NwaCegarLoop]: trace histogram [123, 123, 123, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 11:17:46,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 11:17:46,431 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:17:46,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:17:46,432 INFO L85 PathProgramCache]: Analyzing trace with hash 1740228223, now seen corresponding path program 1 times [2025-03-08 11:17:46,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:17:46,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422044269] [2025-03-08 11:17:46,433 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:17:46,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:17:46,458 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 778 statements into 1 equivalence classes. [2025-03-08 11:17:46,488 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 778 of 778 statements. [2025-03-08 11:17:46,489 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:17:46,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:17:47,106 INFO L134 CoverageAnalysis]: Checked inductivity of 30012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30012 trivial. 0 not checked. [2025-03-08 11:17:47,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:17:47,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422044269] [2025-03-08 11:17:47,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422044269] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:17:47,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:17:47,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 11:17:47,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503792290] [2025-03-08 11:17:47,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:17:47,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 11:17:47,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:17:47,108 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 11:17:47,108 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:17:47,108 INFO L87 Difference]: Start difference. First operand 40898 states and 69244 transitions. Second operand has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 1 states have call successors, (123), 1 states have call predecessors, (123), 1 states have return successors, (123), 1 states have call predecessors, (123), 1 states have call successors, (123) [2025-03-08 11:17:49,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:17:49,914 INFO L93 Difference]: Finished difference Result 122364 states and 207078 transitions. [2025-03-08 11:17:49,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 11:17:49,914 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 1 states have call successors, (123), 1 states have call predecessors, (123), 1 states have return successors, (123), 1 states have call predecessors, (123), 1 states have call successors, (123) Word has length 778 [2025-03-08 11:17:49,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:17:50,230 INFO L225 Difference]: With dead ends: 122364 [2025-03-08 11:17:50,231 INFO L226 Difference]: Without dead ends: 81469 [2025-03-08 11:17:50,330 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:17:50,331 INFO L435 NwaCegarLoop]: 631 mSDtfsCounter, 396 mSDsluCounter, 621 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 396 SdHoareTripleChecker+Valid, 1252 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 11:17:50,331 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [396 Valid, 1252 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 11:17:50,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81469 states. [2025-03-08 11:17:55,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81469 to 81287. [2025-03-08 11:17:55,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81287 states, 63106 states have (on average 1.6035559217823978) internal successors, (101194), 63502 states have internal predecessors, (101194), 17748 states have call successors, (17748), 432 states have call predecessors, (17748), 432 states have return successors, (17748), 17352 states have call predecessors, (17748), 17748 states have call successors, (17748) [2025-03-08 11:17:55,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81287 states to 81287 states and 136690 transitions. [2025-03-08 11:17:55,746 INFO L78 Accepts]: Start accepts. Automaton has 81287 states and 136690 transitions. Word has length 778 [2025-03-08 11:17:55,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:17:55,747 INFO L471 AbstractCegarLoop]: Abstraction has 81287 states and 136690 transitions. [2025-03-08 11:17:55,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 1 states have call successors, (123), 1 states have call predecessors, (123), 1 states have return successors, (123), 1 states have call predecessors, (123), 1 states have call successors, (123) [2025-03-08 11:17:55,747 INFO L276 IsEmpty]: Start isEmpty. Operand 81287 states and 136690 transitions. [2025-03-08 11:17:55,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 779 [2025-03-08 11:17:55,800 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:17:55,801 INFO L218 NwaCegarLoop]: trace histogram [123, 123, 123, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 11:17:55,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 11:17:55,801 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:17:55,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:17:55,802 INFO L85 PathProgramCache]: Analyzing trace with hash 1947882335, now seen corresponding path program 1 times [2025-03-08 11:17:55,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:17:55,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217509116] [2025-03-08 11:17:55,802 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:17:55,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:17:55,828 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 778 statements into 1 equivalence classes. [2025-03-08 11:17:55,857 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 778 of 778 statements. [2025-03-08 11:17:55,857 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:17:55,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:17:56,204 INFO L134 CoverageAnalysis]: Checked inductivity of 30012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30012 trivial. 0 not checked. [2025-03-08 11:17:56,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:17:56,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217509116] [2025-03-08 11:17:56,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217509116] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:17:56,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:17:56,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 11:17:56,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881151932] [2025-03-08 11:17:56,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:17:56,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 11:17:56,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:17:56,206 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 11:17:56,206 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 11:17:56,207 INFO L87 Difference]: Start difference. First operand 81287 states and 136690 transitions. Second operand has 5 states, 5 states have (on average 33.2) internal successors, (166), 5 states have internal predecessors, (166), 1 states have call successors, (123), 1 states have call predecessors, (123), 1 states have return successors, (123), 1 states have call predecessors, (123), 1 states have call successors, (123)