./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-76.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-76.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 f602e0f7734a1905046e2fba128f181bd659d39499d3aad0dd0d24704f376d3a --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 20:10:59,137 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 20:10:59,195 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 20:10:59,200 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 20:10:59,203 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 20:10:59,225 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 20:10:59,226 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 20:10:59,226 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 20:10:59,227 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 20:10:59,227 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 20:10:59,227 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 20:10:59,228 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 20:10:59,228 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 20:10:59,228 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 20:10:59,228 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 20:10:59,228 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 20:10:59,228 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 20:10:59,229 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 20:10:59,229 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 20:10:59,229 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 20:10:59,229 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 20:10:59,229 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 20:10:59,229 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 20:10:59,229 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 20:10:59,229 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 20:10:59,229 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 20:10:59,229 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 20:10:59,230 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 20:10:59,230 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 20:10:59,230 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 20:10:59,230 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 20:10:59,230 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 20:10:59,230 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 20:10:59,231 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 20:10:59,231 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 20:10:59,231 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 20:10:59,231 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 20:10:59,231 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 20:10:59,231 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 20:10:59,231 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 20:10:59,231 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 20:10:59,231 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 20:10:59,231 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 20:10:59,231 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 -> f602e0f7734a1905046e2fba128f181bd659d39499d3aad0dd0d24704f376d3a [2025-03-03 20:10:59,467 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 20:10:59,474 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 20:10:59,478 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 20:10:59,479 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 20:10:59,480 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 20:10:59,481 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-76.i [2025-03-03 20:11:00,644 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/231eac29f/c98110cf89e34cf8b6cb1c955cde5ff1/FLAGa8e88ed5a [2025-03-03 20:11:00,944 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 20:11:00,948 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-76.i [2025-03-03 20:11:00,961 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/231eac29f/c98110cf89e34cf8b6cb1c955cde5ff1/FLAGa8e88ed5a [2025-03-03 20:11:00,974 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/231eac29f/c98110cf89e34cf8b6cb1c955cde5ff1 [2025-03-03 20:11:00,976 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 20:11:00,977 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 20:11:00,979 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 20:11:00,979 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 20:11:00,983 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 20:11:00,984 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 08:11:00" (1/1) ... [2025-03-03 20:11:00,984 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e0efbfc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:11:00, skipping insertion in model container [2025-03-03 20:11:00,984 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 08:11:00" (1/1) ... [2025-03-03 20:11:01,021 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 20:11:01,122 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-76.i[916,929] [2025-03-03 20:11:01,251 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 20:11:01,269 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 20:11:01,278 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-76.i[916,929] [2025-03-03 20:11:01,353 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 20:11:01,370 INFO L204 MainTranslator]: Completed translation [2025-03-03 20:11:01,370 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:11:01 WrapperNode [2025-03-03 20:11:01,371 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 20:11:01,372 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 20:11:01,372 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 20:11:01,372 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 20:11:01,376 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:11:01" (1/1) ... [2025-03-03 20:11:01,388 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:11:01" (1/1) ... [2025-03-03 20:11:01,443 INFO L138 Inliner]: procedures = 26, calls = 127, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 929 [2025-03-03 20:11:01,444 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 20:11:01,445 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 20:11:01,445 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 20:11:01,445 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 20:11:01,451 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:11:01" (1/1) ... [2025-03-03 20:11:01,452 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:11:01" (1/1) ... [2025-03-03 20:11:01,465 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:11:01" (1/1) ... [2025-03-03 20:11:01,485 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-03 20:11:01,485 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:11:01" (1/1) ... [2025-03-03 20:11:01,485 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:11:01" (1/1) ... [2025-03-03 20:11:01,507 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:11:01" (1/1) ... [2025-03-03 20:11:01,509 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:11:01" (1/1) ... [2025-03-03 20:11:01,520 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:11:01" (1/1) ... [2025-03-03 20:11:01,523 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:11:01" (1/1) ... [2025-03-03 20:11:01,532 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 20:11:01,534 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 20:11:01,534 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 20:11:01,534 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 20:11:01,535 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:11:01" (1/1) ... [2025-03-03 20:11:01,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 20:11:01,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:11:01,562 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-03 20:11:01,571 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-03 20:11:01,587 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 20:11:01,587 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 20:11:01,588 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 20:11:01,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 20:11:01,588 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 20:11:01,588 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 20:11:01,710 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 20:11:01,712 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 20:11:02,541 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L729: havoc property_#t~bitwise88#1;havoc property_#t~short89#1; [2025-03-03 20:11:02,754 INFO L? ?]: Removed 28 outVars from TransFormulas that were not future-live. [2025-03-03 20:11:02,755 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 20:11:02,790 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 20:11:02,794 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 20:11:02,794 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 08:11:02 BoogieIcfgContainer [2025-03-03 20:11:02,794 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 20:11:02,796 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 20:11:02,796 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 20:11:02,799 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 20:11:02,799 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 08:11:00" (1/3) ... [2025-03-03 20:11:02,800 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bfd2c73 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 08:11:02, skipping insertion in model container [2025-03-03 20:11:02,800 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:11:01" (2/3) ... [2025-03-03 20:11:02,801 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bfd2c73 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 08:11:02, skipping insertion in model container [2025-03-03 20:11:02,801 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 08:11:02" (3/3) ... [2025-03-03 20:11:02,802 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-76.i [2025-03-03 20:11:02,813 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 20:11:02,816 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-76.i that has 2 procedures, 378 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 20:11:02,871 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 20:11:02,882 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;@4eb3aa0d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 20:11:02,883 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 20:11:02,887 INFO L276 IsEmpty]: Start isEmpty. Operand has 378 states, 261 states have (on average 1.582375478927203) internal successors, (413), 262 states have internal predecessors, (413), 114 states have call successors, (114), 1 states have call predecessors, (114), 1 states have return successors, (114), 114 states have call predecessors, (114), 114 states have call successors, (114) [2025-03-03 20:11:02,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 728 [2025-03-03 20:11:02,918 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:11:02,919 INFO L218 NwaCegarLoop]: trace histogram [114, 114, 114, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 20:11:02,920 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:11:02,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:11:02,926 INFO L85 PathProgramCache]: Analyzing trace with hash -2109294136, now seen corresponding path program 1 times [2025-03-03 20:11:02,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:11:02,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475565041] [2025-03-03 20:11:02,933 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:11:02,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:11:03,056 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 727 statements into 1 equivalence classes. [2025-03-03 20:11:03,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 727 of 727 statements. [2025-03-03 20:11:03,110 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:11:03,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:11:03,535 INFO L134 CoverageAnalysis]: Checked inductivity of 25764 backedges. 0 proven. 226 refuted. 0 times theorem prover too weak. 25538 trivial. 0 not checked. [2025-03-03 20:11:03,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:11:03,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475565041] [2025-03-03 20:11:03,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475565041] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 20:11:03,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [38600467] [2025-03-03 20:11:03,539 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:11:03,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 20:11:03,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:11:03,542 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-03 20:11:03,550 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-03 20:11:03,749 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 727 statements into 1 equivalence classes. [2025-03-03 20:11:03,949 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 727 of 727 statements. [2025-03-03 20:11:03,949 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:11:03,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:11:03,957 INFO L256 TraceCheckSpWp]: Trace formula consists of 1648 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 20:11:03,977 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 20:11:04,058 INFO L134 CoverageAnalysis]: Checked inductivity of 25764 backedges. 226 proven. 0 refuted. 0 times theorem prover too weak. 25538 trivial. 0 not checked. [2025-03-03 20:11:04,058 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 20:11:04,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [38600467] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:11:04,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 20:11:04,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 20:11:04,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546549783] [2025-03-03 20:11:04,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:11:04,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 20:11:04,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:11:04,085 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 20:11:04,086 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 20:11:04,089 INFO L87 Difference]: Start difference. First operand has 378 states, 261 states have (on average 1.582375478927203) internal successors, (413), 262 states have internal predecessors, (413), 114 states have call successors, (114), 1 states have call predecessors, (114), 1 states have return successors, (114), 114 states have call predecessors, (114), 114 states have call successors, (114) Second operand has 2 states, 2 states have (on average 81.0) internal successors, (162), 2 states have internal predecessors, (162), 2 states have call successors, (114), 2 states have call predecessors, (114), 1 states have return successors, (114), 1 states have call predecessors, (114), 2 states have call successors, (114) [2025-03-03 20:11:04,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:11:04,183 INFO L93 Difference]: Finished difference Result 745 states and 1383 transitions. [2025-03-03 20:11:04,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 20:11:04,185 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 81.0) internal successors, (162), 2 states have internal predecessors, (162), 2 states have call successors, (114), 2 states have call predecessors, (114), 1 states have return successors, (114), 1 states have call predecessors, (114), 2 states have call successors, (114) Word has length 727 [2025-03-03 20:11:04,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:11:04,192 INFO L225 Difference]: With dead ends: 745 [2025-03-03 20:11:04,192 INFO L226 Difference]: Without dead ends: 370 [2025-03-03 20:11:04,196 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 728 GetRequests, 728 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-03 20:11:04,198 INFO L435 NwaCegarLoop]: 603 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 603 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 20:11:04,198 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 603 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 20:11:04,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2025-03-03 20:11:04,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 370. [2025-03-03 20:11:04,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 370 states, 254 states have (on average 1.5511811023622046) internal successors, (394), 254 states have internal predecessors, (394), 114 states have call successors, (114), 1 states have call predecessors, (114), 1 states have return successors, (114), 114 states have call predecessors, (114), 114 states have call successors, (114) [2025-03-03 20:11:04,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 622 transitions. [2025-03-03 20:11:04,270 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 622 transitions. Word has length 727 [2025-03-03 20:11:04,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:11:04,273 INFO L471 AbstractCegarLoop]: Abstraction has 370 states and 622 transitions. [2025-03-03 20:11:04,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 81.0) internal successors, (162), 2 states have internal predecessors, (162), 2 states have call successors, (114), 2 states have call predecessors, (114), 1 states have return successors, (114), 1 states have call predecessors, (114), 2 states have call successors, (114) [2025-03-03 20:11:04,273 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 622 transitions. [2025-03-03 20:11:04,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 729 [2025-03-03 20:11:04,290 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:11:04,290 INFO L218 NwaCegarLoop]: trace histogram [114, 114, 114, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 20:11:04,299 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-03 20:11:04,492 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-03 20:11:04,492 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:11:04,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:11:04,493 INFO L85 PathProgramCache]: Analyzing trace with hash 997937890, now seen corresponding path program 1 times [2025-03-03 20:11:04,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:11:04,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8004327] [2025-03-03 20:11:04,493 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:11:04,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:11:04,555 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 728 statements into 1 equivalence classes. [2025-03-03 20:11:04,668 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 728 of 728 statements. [2025-03-03 20:11:04,671 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:11:04,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:11:05,596 INFO L134 CoverageAnalysis]: Checked inductivity of 25764 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25764 trivial. 0 not checked. [2025-03-03 20:11:05,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:11:05,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8004327] [2025-03-03 20:11:05,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8004327] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:11:05,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:11:05,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:11:05,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19348067] [2025-03-03 20:11:05,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:11:05,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:11:05,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:11:05,600 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:11:05,601 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:11:05,601 INFO L87 Difference]: Start difference. First operand 370 states and 622 transitions. Second operand has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 1 states have call successors, (114), 1 states have call predecessors, (114), 1 states have return successors, (114), 1 states have call predecessors, (114), 1 states have call successors, (114) [2025-03-03 20:11:05,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:11:05,677 INFO L93 Difference]: Finished difference Result 738 states and 1243 transitions. [2025-03-03 20:11:05,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:11:05,678 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 1 states have call successors, (114), 1 states have call predecessors, (114), 1 states have return successors, (114), 1 states have call predecessors, (114), 1 states have call successors, (114) Word has length 728 [2025-03-03 20:11:05,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:11:05,683 INFO L225 Difference]: With dead ends: 738 [2025-03-03 20:11:05,683 INFO L226 Difference]: Without dead ends: 371 [2025-03-03 20:11:05,684 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-03 20:11:05,685 INFO L435 NwaCegarLoop]: 602 mSDtfsCounter, 0 mSDsluCounter, 597 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1199 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 20:11:05,685 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1199 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 20:11:05,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2025-03-03 20:11:05,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 371. [2025-03-03 20:11:05,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 371 states, 255 states have (on average 1.5490196078431373) internal successors, (395), 255 states have internal predecessors, (395), 114 states have call successors, (114), 1 states have call predecessors, (114), 1 states have return successors, (114), 114 states have call predecessors, (114), 114 states have call successors, (114) [2025-03-03 20:11:05,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 623 transitions. [2025-03-03 20:11:05,723 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 623 transitions. Word has length 728 [2025-03-03 20:11:05,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:11:05,727 INFO L471 AbstractCegarLoop]: Abstraction has 371 states and 623 transitions. [2025-03-03 20:11:05,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 1 states have call successors, (114), 1 states have call predecessors, (114), 1 states have return successors, (114), 1 states have call predecessors, (114), 1 states have call successors, (114) [2025-03-03 20:11:05,728 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 623 transitions. [2025-03-03 20:11:05,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 730 [2025-03-03 20:11:05,742 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:11:05,742 INFO L218 NwaCegarLoop]: trace histogram [114, 114, 114, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 20:11:05,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 20:11:05,743 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:11:05,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:11:05,744 INFO L85 PathProgramCache]: Analyzing trace with hash 1398606801, now seen corresponding path program 1 times [2025-03-03 20:11:05,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:11:05,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774291745] [2025-03-03 20:11:05,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:11:05,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:11:05,797 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 729 statements into 1 equivalence classes. [2025-03-03 20:11:05,867 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 729 of 729 statements. [2025-03-03 20:11:05,867 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:11:05,867 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:11:06,095 INFO L134 CoverageAnalysis]: Checked inductivity of 25764 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25764 trivial. 0 not checked. [2025-03-03 20:11:06,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:11:06,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774291745] [2025-03-03 20:11:06,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774291745] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:11:06,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:11:06,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:11:06,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307927768] [2025-03-03 20:11:06,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:11:06,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:11:06,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:11:06,102 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:11:06,103 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:11:06,103 INFO L87 Difference]: Start difference. First operand 371 states and 623 transitions. Second operand has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 1 states have call successors, (114), 1 states have call predecessors, (114), 1 states have return successors, (114), 1 states have call predecessors, (114), 1 states have call successors, (114) [2025-03-03 20:11:06,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:11:06,216 INFO L93 Difference]: Finished difference Result 952 states and 1607 transitions. [2025-03-03 20:11:06,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:11:06,217 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 1 states have call successors, (114), 1 states have call predecessors, (114), 1 states have return successors, (114), 1 states have call predecessors, (114), 1 states have call successors, (114) Word has length 729 [2025-03-03 20:11:06,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:11:06,226 INFO L225 Difference]: With dead ends: 952 [2025-03-03 20:11:06,227 INFO L226 Difference]: Without dead ends: 584 [2025-03-03 20:11:06,232 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-03 20:11:06,233 INFO L435 NwaCegarLoop]: 836 mSDtfsCounter, 342 mSDsluCounter, 594 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 342 SdHoareTripleChecker+Valid, 1430 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:11:06,234 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [342 Valid, 1430 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 20:11:06,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2025-03-03 20:11:06,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 581. [2025-03-03 20:11:06,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 581 states, 450 states have (on average 1.6155555555555556) internal successors, (727), 451 states have internal predecessors, (727), 128 states have call successors, (128), 2 states have call predecessors, (128), 2 states have return successors, (128), 127 states have call predecessors, (128), 128 states have call successors, (128) [2025-03-03 20:11:06,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 581 states to 581 states and 983 transitions. [2025-03-03 20:11:06,321 INFO L78 Accepts]: Start accepts. Automaton has 581 states and 983 transitions. Word has length 729 [2025-03-03 20:11:06,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:11:06,323 INFO L471 AbstractCegarLoop]: Abstraction has 581 states and 983 transitions. [2025-03-03 20:11:06,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 1 states have call successors, (114), 1 states have call predecessors, (114), 1 states have return successors, (114), 1 states have call predecessors, (114), 1 states have call successors, (114) [2025-03-03 20:11:06,324 INFO L276 IsEmpty]: Start isEmpty. Operand 581 states and 983 transitions. [2025-03-03 20:11:06,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 730 [2025-03-03 20:11:06,334 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:11:06,335 INFO L218 NwaCegarLoop]: trace histogram [114, 114, 114, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 20:11:06,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 20:11:06,335 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:11:06,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:11:06,336 INFO L85 PathProgramCache]: Analyzing trace with hash 428315794, now seen corresponding path program 1 times [2025-03-03 20:11:06,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:11:06,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55600395] [2025-03-03 20:11:06,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:11:06,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:11:06,375 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 729 statements into 1 equivalence classes. [2025-03-03 20:11:06,424 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 729 of 729 statements. [2025-03-03 20:11:06,425 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:11:06,425 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:11:06,595 INFO L134 CoverageAnalysis]: Checked inductivity of 25764 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25764 trivial. 0 not checked. [2025-03-03 20:11:06,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:11:06,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55600395] [2025-03-03 20:11:06,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55600395] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:11:06,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:11:06,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:11:06,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220838915] [2025-03-03 20:11:06,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:11:06,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:11:06,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:11:06,597 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:11:06,597 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:11:06,597 INFO L87 Difference]: Start difference. First operand 581 states and 983 transitions. Second operand has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 1 states have call successors, (114), 1 states have call predecessors, (114), 1 states have return successors, (114), 1 states have call predecessors, (114), 1 states have call successors, (114) [2025-03-03 20:11:06,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:11:06,699 INFO L93 Difference]: Finished difference Result 1498 states and 2525 transitions. [2025-03-03 20:11:06,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:11:06,700 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 1 states have call successors, (114), 1 states have call predecessors, (114), 1 states have return successors, (114), 1 states have call predecessors, (114), 1 states have call successors, (114) Word has length 729 [2025-03-03 20:11:06,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:11:06,708 INFO L225 Difference]: With dead ends: 1498 [2025-03-03 20:11:06,708 INFO L226 Difference]: Without dead ends: 920 [2025-03-03 20:11:06,710 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-03 20:11:06,712 INFO L435 NwaCegarLoop]: 835 mSDtfsCounter, 279 mSDsluCounter, 581 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 1416 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:11:06,713 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [279 Valid, 1416 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 20:11:06,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 920 states. [2025-03-03 20:11:06,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 920 to 917. [2025-03-03 20:11:06,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 917 states, 748 states have (on average 1.6149732620320856) internal successors, (1208), 751 states have internal predecessors, (1208), 164 states have call successors, (164), 4 states have call predecessors, (164), 4 states have return successors, (164), 161 states have call predecessors, (164), 164 states have call successors, (164) [2025-03-03 20:11:06,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 917 states to 917 states and 1536 transitions. [2025-03-03 20:11:06,778 INFO L78 Accepts]: Start accepts. Automaton has 917 states and 1536 transitions. Word has length 729 [2025-03-03 20:11:06,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:11:06,781 INFO L471 AbstractCegarLoop]: Abstraction has 917 states and 1536 transitions. [2025-03-03 20:11:06,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 1 states have call successors, (114), 1 states have call predecessors, (114), 1 states have return successors, (114), 1 states have call predecessors, (114), 1 states have call successors, (114) [2025-03-03 20:11:06,782 INFO L276 IsEmpty]: Start isEmpty. Operand 917 states and 1536 transitions. [2025-03-03 20:11:06,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 730 [2025-03-03 20:11:06,789 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:11:06,789 INFO L218 NwaCegarLoop]: trace histogram [114, 114, 114, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 20:11:06,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 20:11:06,789 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:11:06,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:11:06,791 INFO L85 PathProgramCache]: Analyzing trace with hash -1495194803, now seen corresponding path program 1 times [2025-03-03 20:11:06,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:11:06,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464595779] [2025-03-03 20:11:06,791 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:11:06,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:11:06,832 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 729 statements into 1 equivalence classes. [2025-03-03 20:11:06,897 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 729 of 729 statements. [2025-03-03 20:11:06,897 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:11:06,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:11:07,182 INFO L134 CoverageAnalysis]: Checked inductivity of 25764 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25764 trivial. 0 not checked. [2025-03-03 20:11:07,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:11:07,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464595779] [2025-03-03 20:11:07,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464595779] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:11:07,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:11:07,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 20:11:07,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670923395] [2025-03-03 20:11:07,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:11:07,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 20:11:07,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:11:07,185 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 20:11:07,185 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 20:11:07,186 INFO L87 Difference]: Start difference. First operand 917 states and 1536 transitions. Second operand has 4 states, 4 states have (on average 40.5) internal successors, (162), 4 states have internal predecessors, (162), 1 states have call successors, (114), 1 states have call predecessors, (114), 1 states have return successors, (114), 1 states have call predecessors, (114), 1 states have call successors, (114) [2025-03-03 20:11:07,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:11:07,570 INFO L93 Difference]: Finished difference Result 4103 states and 6854 transitions. [2025-03-03 20:11:07,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 20:11:07,570 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 40.5) internal successors, (162), 4 states have internal predecessors, (162), 1 states have call successors, (114), 1 states have call predecessors, (114), 1 states have return successors, (114), 1 states have call predecessors, (114), 1 states have call successors, (114) Word has length 729 [2025-03-03 20:11:07,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:11:07,589 INFO L225 Difference]: With dead ends: 4103 [2025-03-03 20:11:07,589 INFO L226 Difference]: Without dead ends: 3189 [2025-03-03 20:11:07,593 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-03 20:11:07,594 INFO L435 NwaCegarLoop]: 1314 mSDtfsCounter, 1133 mSDsluCounter, 1902 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1133 SdHoareTripleChecker+Valid, 3216 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 20:11:07,594 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1133 Valid, 3216 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 20:11:07,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3189 states. [2025-03-03 20:11:07,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3189 to 2503. [2025-03-03 20:11:07,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2503 states, 2270 states have (on average 1.647136563876652) internal successors, (3739), 2277 states have internal predecessors, (3739), 224 states have call successors, (224), 8 states have call predecessors, (224), 8 states have return successors, (224), 217 states have call predecessors, (224), 224 states have call successors, (224) [2025-03-03 20:11:07,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2503 states to 2503 states and 4187 transitions. [2025-03-03 20:11:07,739 INFO L78 Accepts]: Start accepts. Automaton has 2503 states and 4187 transitions. Word has length 729 [2025-03-03 20:11:07,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:11:07,741 INFO L471 AbstractCegarLoop]: Abstraction has 2503 states and 4187 transitions. [2025-03-03 20:11:07,741 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.5) internal successors, (162), 4 states have internal predecessors, (162), 1 states have call successors, (114), 1 states have call predecessors, (114), 1 states have return successors, (114), 1 states have call predecessors, (114), 1 states have call successors, (114) [2025-03-03 20:11:07,742 INFO L276 IsEmpty]: Start isEmpty. Operand 2503 states and 4187 transitions. [2025-03-03 20:11:07,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 730 [2025-03-03 20:11:07,753 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:11:07,754 INFO L218 NwaCegarLoop]: trace histogram [114, 114, 114, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 20:11:07,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 20:11:07,754 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:11:07,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:11:07,755 INFO L85 PathProgramCache]: Analyzing trace with hash -160967379, now seen corresponding path program 1 times [2025-03-03 20:11:07,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:11:07,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890786190] [2025-03-03 20:11:07,755 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:11:07,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:11:07,800 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 729 statements into 1 equivalence classes. [2025-03-03 20:11:07,848 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 729 of 729 statements. [2025-03-03 20:11:07,848 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:11:07,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:11:08,043 INFO L134 CoverageAnalysis]: Checked inductivity of 25764 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25764 trivial. 0 not checked. [2025-03-03 20:11:08,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:11:08,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890786190] [2025-03-03 20:11:08,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890786190] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:11:08,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:11:08,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:11:08,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053141096] [2025-03-03 20:11:08,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:11:08,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:11:08,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:11:08,045 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:11:08,045 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:11:08,046 INFO L87 Difference]: Start difference. First operand 2503 states and 4187 transitions. Second operand has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 1 states have call successors, (114), 1 states have call predecessors, (114), 1 states have return successors, (114), 1 states have call predecessors, (114), 1 states have call successors, (114) [2025-03-03 20:11:08,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:11:08,161 INFO L93 Difference]: Finished difference Result 5181 states and 8636 transitions. [2025-03-03 20:11:08,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:11:08,162 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 1 states have call successors, (114), 1 states have call predecessors, (114), 1 states have return successors, (114), 1 states have call predecessors, (114), 1 states have call successors, (114) Word has length 729 [2025-03-03 20:11:08,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:11:08,176 INFO L225 Difference]: With dead ends: 5181 [2025-03-03 20:11:08,176 INFO L226 Difference]: Without dead ends: 2681 [2025-03-03 20:11:08,181 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-03 20:11:08,182 INFO L435 NwaCegarLoop]: 599 mSDtfsCounter, 32 mSDsluCounter, 589 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 1188 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:11:08,182 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 1188 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 20:11:08,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2681 states. [2025-03-03 20:11:08,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2681 to 2599. [2025-03-03 20:11:08,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2599 states, 2366 states have (on average 1.6411665257819104) internal successors, (3883), 2373 states have internal predecessors, (3883), 224 states have call successors, (224), 8 states have call predecessors, (224), 8 states have return successors, (224), 217 states have call predecessors, (224), 224 states have call successors, (224) [2025-03-03 20:11:08,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2599 states to 2599 states and 4331 transitions. [2025-03-03 20:11:08,273 INFO L78 Accepts]: Start accepts. Automaton has 2599 states and 4331 transitions. Word has length 729 [2025-03-03 20:11:08,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:11:08,274 INFO L471 AbstractCegarLoop]: Abstraction has 2599 states and 4331 transitions. [2025-03-03 20:11:08,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 1 states have call successors, (114), 1 states have call predecessors, (114), 1 states have return successors, (114), 1 states have call predecessors, (114), 1 states have call successors, (114) [2025-03-03 20:11:08,275 INFO L276 IsEmpty]: Start isEmpty. Operand 2599 states and 4331 transitions. [2025-03-03 20:11:08,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 730 [2025-03-03 20:11:08,282 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:11:08,282 INFO L218 NwaCegarLoop]: trace histogram [114, 114, 114, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 20:11:08,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 20:11:08,283 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:11:08,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:11:08,283 INFO L85 PathProgramCache]: Analyzing trace with hash -1668519188, now seen corresponding path program 1 times [2025-03-03 20:11:08,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:11:08,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303961757] [2025-03-03 20:11:08,284 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:11:08,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:11:08,335 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 729 statements into 1 equivalence classes. [2025-03-03 20:11:08,401 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 729 of 729 statements. [2025-03-03 20:11:08,401 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:11:08,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:11:08,684 INFO L134 CoverageAnalysis]: Checked inductivity of 25764 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25764 trivial. 0 not checked. [2025-03-03 20:11:08,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:11:08,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303961757] [2025-03-03 20:11:08,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303961757] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:11:08,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:11:08,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 20:11:08,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551655151] [2025-03-03 20:11:08,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:11:08,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 20:11:08,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:11:08,686 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 20:11:08,686 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 20:11:08,687 INFO L87 Difference]: Start difference. First operand 2599 states and 4331 transitions. Second operand has 4 states, 4 states have (on average 40.5) internal successors, (162), 4 states have internal predecessors, (162), 1 states have call successors, (114), 1 states have call predecessors, (114), 1 states have return successors, (114), 1 states have call predecessors, (114), 1 states have call successors, (114) [2025-03-03 20:11:08,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:11:08,789 INFO L93 Difference]: Finished difference Result 5227 states and 8723 transitions. [2025-03-03 20:11:08,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 20:11:08,789 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 40.5) internal successors, (162), 4 states have internal predecessors, (162), 1 states have call successors, (114), 1 states have call predecessors, (114), 1 states have return successors, (114), 1 states have call predecessors, (114), 1 states have call successors, (114) Word has length 729 [2025-03-03 20:11:08,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:11:08,801 INFO L225 Difference]: With dead ends: 5227 [2025-03-03 20:11:08,801 INFO L226 Difference]: Without dead ends: 2631 [2025-03-03 20:11:08,806 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 20:11:08,807 INFO L435 NwaCegarLoop]: 600 mSDtfsCounter, 0 mSDsluCounter, 1191 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1791 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 20:11:08,808 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1791 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 20:11:08,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2631 states. [2025-03-03 20:11:08,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2631 to 2631. [2025-03-03 20:11:08,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2631 states, 2398 states have (on average 1.6392827356130109) internal successors, (3931), 2405 states have internal predecessors, (3931), 224 states have call successors, (224), 8 states have call predecessors, (224), 8 states have return successors, (224), 217 states have call predecessors, (224), 224 states have call successors, (224) [2025-03-03 20:11:08,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2631 states to 2631 states and 4379 transitions. [2025-03-03 20:11:08,916 INFO L78 Accepts]: Start accepts. Automaton has 2631 states and 4379 transitions. Word has length 729 [2025-03-03 20:11:08,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:11:08,917 INFO L471 AbstractCegarLoop]: Abstraction has 2631 states and 4379 transitions. [2025-03-03 20:11:08,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.5) internal successors, (162), 4 states have internal predecessors, (162), 1 states have call successors, (114), 1 states have call predecessors, (114), 1 states have return successors, (114), 1 states have call predecessors, (114), 1 states have call successors, (114) [2025-03-03 20:11:08,917 INFO L276 IsEmpty]: Start isEmpty. Operand 2631 states and 4379 transitions. [2025-03-03 20:11:08,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 730 [2025-03-03 20:11:08,924 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:11:08,924 INFO L218 NwaCegarLoop]: trace histogram [114, 114, 114, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 20:11:08,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 20:11:08,924 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:11:08,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:11:08,926 INFO L85 PathProgramCache]: Analyzing trace with hash -535328595, now seen corresponding path program 1 times [2025-03-03 20:11:08,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:11:08,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632330790] [2025-03-03 20:11:08,926 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:11:08,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:11:08,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 729 statements into 1 equivalence classes. [2025-03-03 20:11:09,019 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 729 of 729 statements. [2025-03-03 20:11:09,019 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:11:09,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:11:09,303 INFO L134 CoverageAnalysis]: Checked inductivity of 25764 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25764 trivial. 0 not checked. [2025-03-03 20:11:09,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:11:09,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632330790] [2025-03-03 20:11:09,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632330790] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:11:09,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:11:09,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:11:09,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448714324] [2025-03-03 20:11:09,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:11:09,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:11:09,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:11:09,306 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:11:09,306 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:11:09,306 INFO L87 Difference]: Start difference. First operand 2631 states and 4379 transitions. Second operand has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 1 states have call successors, (114), 1 states have call predecessors, (114), 1 states have return successors, (114), 1 states have call predecessors, (114), 1 states have call successors, (114) [2025-03-03 20:11:09,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:11:09,417 INFO L93 Difference]: Finished difference Result 5259 states and 8755 transitions. [2025-03-03 20:11:09,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:11:09,418 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 1 states have call successors, (114), 1 states have call predecessors, (114), 1 states have return successors, (114), 1 states have call predecessors, (114), 1 states have call successors, (114) Word has length 729 [2025-03-03 20:11:09,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:11:09,430 INFO L225 Difference]: With dead ends: 5259 [2025-03-03 20:11:09,430 INFO L226 Difference]: Without dead ends: 2631 [2025-03-03 20:11:09,434 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-03 20:11:09,434 INFO L435 NwaCegarLoop]: 601 mSDtfsCounter, 0 mSDsluCounter, 597 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1198 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 20:11:09,434 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1198 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 20:11:09,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2631 states. [2025-03-03 20:11:09,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2631 to 2615. [2025-03-03 20:11:09,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2615 states, 2382 states have (on average 1.6368597816960537) internal successors, (3899), 2389 states have internal predecessors, (3899), 224 states have call successors, (224), 8 states have call predecessors, (224), 8 states have return successors, (224), 217 states have call predecessors, (224), 224 states have call successors, (224) [2025-03-03 20:11:09,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2615 states to 2615 states and 4347 transitions. [2025-03-03 20:11:09,502 INFO L78 Accepts]: Start accepts. Automaton has 2615 states and 4347 transitions. Word has length 729 [2025-03-03 20:11:09,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:11:09,503 INFO L471 AbstractCegarLoop]: Abstraction has 2615 states and 4347 transitions. [2025-03-03 20:11:09,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 1 states have call successors, (114), 1 states have call predecessors, (114), 1 states have return successors, (114), 1 states have call predecessors, (114), 1 states have call successors, (114) [2025-03-03 20:11:09,504 INFO L276 IsEmpty]: Start isEmpty. Operand 2615 states and 4347 transitions. [2025-03-03 20:11:09,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 732 [2025-03-03 20:11:09,510 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:11:09,510 INFO L218 NwaCegarLoop]: trace histogram [114, 114, 114, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 20:11:09,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 20:11:09,511 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:11:09,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:11:09,511 INFO L85 PathProgramCache]: Analyzing trace with hash -1665572874, now seen corresponding path program 1 times [2025-03-03 20:11:09,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:11:09,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570572053] [2025-03-03 20:11:09,512 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:11:09,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:11:09,544 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 731 statements into 1 equivalence classes. [2025-03-03 20:11:09,593 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 731 of 731 statements. [2025-03-03 20:11:09,594 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:11:09,594 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:11:09,887 INFO L134 CoverageAnalysis]: Checked inductivity of 25764 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25764 trivial. 0 not checked. [2025-03-03 20:11:09,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:11:09,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570572053] [2025-03-03 20:11:09,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570572053] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:11:09,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:11:09,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 20:11:09,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035667787] [2025-03-03 20:11:09,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:11:09,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 20:11:09,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:11:09,889 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 20:11:09,889 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 20:11:09,889 INFO L87 Difference]: Start difference. First operand 2615 states and 4347 transitions. Second operand has 5 states, 5 states have (on average 32.8) internal successors, (164), 5 states have internal predecessors, (164), 1 states have call successors, (114), 1 states have call predecessors, (114), 1 states have return successors, (114), 1 states have call predecessors, (114), 1 states have call successors, (114) [2025-03-03 20:11:10,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:11:10,434 INFO L93 Difference]: Finished difference Result 10189 states and 16969 transitions. [2025-03-03 20:11:10,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 20:11:10,434 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 32.8) internal successors, (164), 5 states have internal predecessors, (164), 1 states have call successors, (114), 1 states have call predecessors, (114), 1 states have return successors, (114), 1 states have call predecessors, (114), 1 states have call successors, (114) Word has length 731 [2025-03-03 20:11:10,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:11:10,471 INFO L225 Difference]: With dead ends: 10189 [2025-03-03 20:11:10,471 INFO L226 Difference]: Without dead ends: 7577 [2025-03-03 20:11:10,480 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-03 20:11:10,481 INFO L435 NwaCegarLoop]: 715 mSDtfsCounter, 1120 mSDsluCounter, 1561 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1120 SdHoareTripleChecker+Valid, 2276 SdHoareTripleChecker+Invalid, 359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 20:11:10,481 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1120 Valid, 2276 Invalid, 359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 20:11:10,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7577 states. [2025-03-03 20:11:10,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7577 to 6747. [2025-03-03 20:11:10,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6747 states, 6352 states have (on average 1.6550692695214106) internal successors, (10513), 6367 states have internal predecessors, (10513), 378 states have call successors, (378), 16 states have call predecessors, (378), 16 states have return successors, (378), 363 states have call predecessors, (378), 378 states have call successors, (378) [2025-03-03 20:11:10,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6747 states to 6747 states and 11269 transitions. [2025-03-03 20:11:10,678 INFO L78 Accepts]: Start accepts. Automaton has 6747 states and 11269 transitions. Word has length 731 [2025-03-03 20:11:10,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:11:10,679 INFO L471 AbstractCegarLoop]: Abstraction has 6747 states and 11269 transitions. [2025-03-03 20:11:10,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 32.8) internal successors, (164), 5 states have internal predecessors, (164), 1 states have call successors, (114), 1 states have call predecessors, (114), 1 states have return successors, (114), 1 states have call predecessors, (114), 1 states have call successors, (114) [2025-03-03 20:11:10,684 INFO L276 IsEmpty]: Start isEmpty. Operand 6747 states and 11269 transitions. [2025-03-03 20:11:10,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 733 [2025-03-03 20:11:10,697 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:11:10,697 INFO L218 NwaCegarLoop]: trace histogram [114, 114, 114, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 20:11:10,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 20:11:10,697 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:11:10,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:11:10,698 INFO L85 PathProgramCache]: Analyzing trace with hash -1417916528, now seen corresponding path program 1 times [2025-03-03 20:11:10,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:11:10,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798536692] [2025-03-03 20:11:10,698 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:11:10,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:11:10,730 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 732 statements into 1 equivalence classes. [2025-03-03 20:11:10,764 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 732 of 732 statements. [2025-03-03 20:11:10,764 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:11:10,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:11:11,038 INFO L134 CoverageAnalysis]: Checked inductivity of 25764 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25764 trivial. 0 not checked. [2025-03-03 20:11:11,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:11:11,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798536692] [2025-03-03 20:11:11,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798536692] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:11:11,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:11:11,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 20:11:11,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597745338] [2025-03-03 20:11:11,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:11:11,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 20:11:11,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:11:11,040 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 20:11:11,041 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 20:11:11,041 INFO L87 Difference]: Start difference. First operand 6747 states and 11269 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, (114), 1 states have call predecessors, (114), 1 states have return successors, (114), 1 states have call predecessors, (114), 1 states have call successors, (114) [2025-03-03 20:11:11,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:11:11,532 INFO L93 Difference]: Finished difference Result 20235 states and 33801 transitions. [2025-03-03 20:11:11,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 20:11:11,533 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, (114), 1 states have call predecessors, (114), 1 states have return successors, (114), 1 states have call predecessors, (114), 1 states have call successors, (114) Word has length 732 [2025-03-03 20:11:11,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:11:11,577 INFO L225 Difference]: With dead ends: 20235 [2025-03-03 20:11:11,577 INFO L226 Difference]: Without dead ends: 13491 [2025-03-03 20:11:11,593 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-03 20:11:11,593 INFO L435 NwaCegarLoop]: 597 mSDtfsCounter, 355 mSDsluCounter, 957 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 355 SdHoareTripleChecker+Valid, 1554 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 20:11:11,593 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [355 Valid, 1554 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 20:11:11,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13491 states. [2025-03-03 20:11:11,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13491 to 13473. [2025-03-03 20:11:11,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13473 states, 12684 states have (on average 1.6535793125197098) internal successors, (20974), 12714 states have internal predecessors, (20974), 756 states have call successors, (756), 32 states have call predecessors, (756), 32 states have return successors, (756), 726 states have call predecessors, (756), 756 states have call successors, (756) [2025-03-03 20:11:11,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13473 states to 13473 states and 22486 transitions. [2025-03-03 20:11:11,986 INFO L78 Accepts]: Start accepts. Automaton has 13473 states and 22486 transitions. Word has length 732 [2025-03-03 20:11:11,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:11:11,987 INFO L471 AbstractCegarLoop]: Abstraction has 13473 states and 22486 transitions. [2025-03-03 20:11:11,987 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, (114), 1 states have call predecessors, (114), 1 states have return successors, (114), 1 states have call predecessors, (114), 1 states have call successors, (114) [2025-03-03 20:11:11,987 INFO L276 IsEmpty]: Start isEmpty. Operand 13473 states and 22486 transitions. [2025-03-03 20:11:11,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 733 [2025-03-03 20:11:12,000 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:11:12,000 INFO L218 NwaCegarLoop]: trace histogram [114, 114, 114, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 20:11:12,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 20:11:12,000 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:11:12,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:11:12,001 INFO L85 PathProgramCache]: Analyzing trace with hash 1080099409, now seen corresponding path program 1 times [2025-03-03 20:11:12,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:11:12,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356119135] [2025-03-03 20:11:12,001 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:11:12,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:11:12,032 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 732 statements into 1 equivalence classes. [2025-03-03 20:11:12,068 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 732 of 732 statements. [2025-03-03 20:11:12,069 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:11:12,069 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:11:12,582 INFO L134 CoverageAnalysis]: Checked inductivity of 25764 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25764 trivial. 0 not checked. [2025-03-03 20:11:12,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:11:12,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356119135] [2025-03-03 20:11:12,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356119135] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:11:12,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:11:12,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 20:11:12,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48872972] [2025-03-03 20:11:12,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:11:12,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 20:11:12,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:11:12,584 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 20:11:12,584 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-03 20:11:12,585 INFO L87 Difference]: Start difference. First operand 13473 states and 22486 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, (114), 1 states have call predecessors, (114), 1 states have return successors, (114), 1 states have call predecessors, (114), 1 states have call successors, (114) [2025-03-03 20:11:13,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:11:13,860 INFO L93 Difference]: Finished difference Result 43541 states and 72650 transitions. [2025-03-03 20:11:13,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 20:11:13,861 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, (114), 1 states have call predecessors, (114), 1 states have return successors, (114), 1 states have call predecessors, (114), 1 states have call successors, (114) Word has length 732 [2025-03-03 20:11:13,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:11:13,939 INFO L225 Difference]: With dead ends: 43541 [2025-03-03 20:11:13,939 INFO L226 Difference]: Without dead ends: 28391 [2025-03-03 20:11:13,974 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-03 20:11:13,975 INFO L435 NwaCegarLoop]: 668 mSDtfsCounter, 1501 mSDsluCounter, 1114 mSDsCounter, 0 mSdLazyCounter, 424 mSolverCounterSat, 239 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1501 SdHoareTripleChecker+Valid, 1782 SdHoareTripleChecker+Invalid, 663 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 239 IncrementalHoareTripleChecker+Valid, 424 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 20:11:13,976 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1501 Valid, 1782 Invalid, 663 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [239 Valid, 424 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 20:11:14,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28391 states. [2025-03-03 20:11:14,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28391 to 18861. [2025-03-03 20:11:14,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18861 states, 18072 states have (on average 1.6731961044710049) internal successors, (30238), 18102 states have internal predecessors, (30238), 756 states have call successors, (756), 32 states have call predecessors, (756), 32 states have return successors, (756), 726 states have call predecessors, (756), 756 states have call successors, (756) [2025-03-03 20:11:14,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18861 states to 18861 states and 31750 transitions. [2025-03-03 20:11:14,591 INFO L78 Accepts]: Start accepts. Automaton has 18861 states and 31750 transitions. Word has length 732 [2025-03-03 20:11:14,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:11:14,592 INFO L471 AbstractCegarLoop]: Abstraction has 18861 states and 31750 transitions. [2025-03-03 20:11:14,592 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, (114), 1 states have call predecessors, (114), 1 states have return successors, (114), 1 states have call predecessors, (114), 1 states have call successors, (114) [2025-03-03 20:11:14,592 INFO L276 IsEmpty]: Start isEmpty. Operand 18861 states and 31750 transitions. [2025-03-03 20:11:14,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 733 [2025-03-03 20:11:14,608 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:11:14,609 INFO L218 NwaCegarLoop]: trace histogram [114, 114, 114, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 20:11:14,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 20:11:14,610 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:11:14,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:11:14,611 INFO L85 PathProgramCache]: Analyzing trace with hash 439264690, now seen corresponding path program 1 times [2025-03-03 20:11:14,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:11:14,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789669557] [2025-03-03 20:11:14,611 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:11:14,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:11:14,638 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 732 statements into 1 equivalence classes. [2025-03-03 20:11:14,669 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 732 of 732 statements. [2025-03-03 20:11:14,670 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:11:14,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:11:14,808 INFO L134 CoverageAnalysis]: Checked inductivity of 25764 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25764 trivial. 0 not checked. [2025-03-03 20:11:14,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:11:14,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789669557] [2025-03-03 20:11:14,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789669557] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:11:14,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:11:14,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:11:14,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893715255] [2025-03-03 20:11:14,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:11:14,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:11:14,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:11:14,810 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:11:14,810 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:11:14,811 INFO L87 Difference]: Start difference. First operand 18861 states and 31750 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, (114), 1 states have call predecessors, (114), 1 states have return successors, (114), 1 states have call predecessors, (114), 1 states have call successors, (114) [2025-03-03 20:11:15,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:11:15,078 INFO L93 Difference]: Finished difference Result 42005 states and 71106 transitions. [2025-03-03 20:11:15,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:11:15,079 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, (114), 1 states have call predecessors, (114), 1 states have return successors, (114), 1 states have call predecessors, (114), 1 states have call successors, (114) Word has length 732 [2025-03-03 20:11:15,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:11:15,131 INFO L225 Difference]: With dead ends: 42005 [2025-03-03 20:11:15,131 INFO L226 Difference]: Without dead ends: 23147 [2025-03-03 20:11:15,163 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-03 20:11:15,164 INFO L435 NwaCegarLoop]: 762 mSDtfsCounter, 289 mSDsluCounter, 581 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 1343 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:11:15,164 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [289 Valid, 1343 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 20:11:15,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23147 states. [2025-03-03 20:11:15,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23147 to 22049. [2025-03-03 20:11:15,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22049 states, 21508 states have (on average 1.693974335131114) internal successors, (36434), 21522 states have internal predecessors, (36434), 516 states have call successors, (516), 24 states have call predecessors, (516), 24 states have return successors, (516), 502 states have call predecessors, (516), 516 states have call successors, (516) [2025-03-03 20:11:15,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22049 states to 22049 states and 37466 transitions. [2025-03-03 20:11:15,623 INFO L78 Accepts]: Start accepts. Automaton has 22049 states and 37466 transitions. Word has length 732 [2025-03-03 20:11:15,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:11:15,624 INFO L471 AbstractCegarLoop]: Abstraction has 22049 states and 37466 transitions. [2025-03-03 20:11:15,624 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, (114), 1 states have call predecessors, (114), 1 states have return successors, (114), 1 states have call predecessors, (114), 1 states have call successors, (114) [2025-03-03 20:11:15,624 INFO L276 IsEmpty]: Start isEmpty. Operand 22049 states and 37466 transitions. [2025-03-03 20:11:15,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 733 [2025-03-03 20:11:15,643 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:11:15,643 INFO L218 NwaCegarLoop]: trace histogram [114, 114, 114, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 20:11:15,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 20:11:15,644 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:11:15,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:11:15,644 INFO L85 PathProgramCache]: Analyzing trace with hash -1018049359, now seen corresponding path program 1 times [2025-03-03 20:11:15,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:11:15,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604187933] [2025-03-03 20:11:15,645 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:11:15,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:11:15,672 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 732 statements into 1 equivalence classes. [2025-03-03 20:11:15,718 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 732 of 732 statements. [2025-03-03 20:11:15,718 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:11:15,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:11:16,084 INFO L134 CoverageAnalysis]: Checked inductivity of 25764 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25764 trivial. 0 not checked. [2025-03-03 20:11:16,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:11:16,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604187933] [2025-03-03 20:11:16,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604187933] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:11:16,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:11:16,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 20:11:16,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470938696] [2025-03-03 20:11:16,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:11:16,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 20:11:16,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:11:16,086 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 20:11:16,087 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 20:11:16,087 INFO L87 Difference]: Start difference. First operand 22049 states and 37466 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, (114), 1 states have call predecessors, (114), 1 states have return successors, (114), 1 states have call predecessors, (114), 1 states have call successors, (114) [2025-03-03 20:11:16,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:11:16,960 INFO L93 Difference]: Finished difference Result 75333 states and 126935 transitions. [2025-03-03 20:11:16,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 20:11:16,961 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, (114), 1 states have call predecessors, (114), 1 states have return successors, (114), 1 states have call predecessors, (114), 1 states have call successors, (114) Word has length 732 [2025-03-03 20:11:16,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:11:17,082 INFO L225 Difference]: With dead ends: 75333 [2025-03-03 20:11:17,083 INFO L226 Difference]: Without dead ends: 53287 [2025-03-03 20:11:17,132 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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-03 20:11:17,133 INFO L435 NwaCegarLoop]: 822 mSDtfsCounter, 898 mSDsluCounter, 932 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 898 SdHoareTripleChecker+Valid, 1754 SdHoareTripleChecker+Invalid, 340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 20:11:17,134 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [898 Valid, 1754 Invalid, 340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 20:11:17,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53287 states. [2025-03-03 20:11:18,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53287 to 53281. [2025-03-03 20:11:18,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53281 states, 51708 states have (on average 1.6694515355457569) internal successors, (86324), 51752 states have internal predecessors, (86324), 1500 states have call successors, (1500), 72 states have call predecessors, (1500), 72 states have return successors, (1500), 1456 states have call predecessors, (1500), 1500 states have call successors, (1500) [2025-03-03 20:11:18,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53281 states to 53281 states and 89324 transitions. [2025-03-03 20:11:18,366 INFO L78 Accepts]: Start accepts. Automaton has 53281 states and 89324 transitions. Word has length 732 [2025-03-03 20:11:18,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:11:18,367 INFO L471 AbstractCegarLoop]: Abstraction has 53281 states and 89324 transitions. [2025-03-03 20:11:18,368 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, (114), 1 states have call predecessors, (114), 1 states have return successors, (114), 1 states have call predecessors, (114), 1 states have call successors, (114) [2025-03-03 20:11:18,368 INFO L276 IsEmpty]: Start isEmpty. Operand 53281 states and 89324 transitions. [2025-03-03 20:11:18,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 734 [2025-03-03 20:11:18,406 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:11:18,407 INFO L218 NwaCegarLoop]: trace histogram [114, 114, 114, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 20:11:18,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 20:11:18,408 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:11:18,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:11:18,408 INFO L85 PathProgramCache]: Analyzing trace with hash 2054951348, now seen corresponding path program 1 times [2025-03-03 20:11:18,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:11:18,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734630916] [2025-03-03 20:11:18,408 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:11:18,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:11:18,446 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 733 statements into 1 equivalence classes. [2025-03-03 20:11:18,837 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 733 of 733 statements. [2025-03-03 20:11:18,837 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:11:18,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:11:19,194 INFO L134 CoverageAnalysis]: Checked inductivity of 25764 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25764 trivial. 0 not checked. [2025-03-03 20:11:19,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:11:19,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734630916] [2025-03-03 20:11:19,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734630916] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:11:19,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:11:19,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 20:11:19,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720968161] [2025-03-03 20:11:19,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:11:19,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 20:11:19,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:11:19,197 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 20:11:19,197 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 20:11:19,198 INFO L87 Difference]: Start difference. First operand 53281 states and 89324 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, (114), 1 states have call predecessors, (114), 1 states have return successors, (114), 1 states have call predecessors, (114), 1 states have call successors, (114) [2025-03-03 20:11:20,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:11:20,044 INFO L93 Difference]: Finished difference Result 110606 states and 184683 transitions. [2025-03-03 20:11:20,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 20:11:20,044 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.2) internal successors, (166), 5 states have internal predecessors, (166), 1 states have call successors, (114), 1 states have call predecessors, (114), 1 states have return successors, (114), 1 states have call predecessors, (114), 1 states have call successors, (114) Word has length 733 [2025-03-03 20:11:20,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:11:20,140 INFO L225 Difference]: With dead ends: 110606 [2025-03-03 20:11:20,141 INFO L226 Difference]: Without dead ends: 57328 [2025-03-03 20:11:20,196 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-03 20:11:20,196 INFO L435 NwaCegarLoop]: 714 mSDtfsCounter, 755 mSDsluCounter, 1193 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 755 SdHoareTripleChecker+Valid, 1907 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 20:11:20,197 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [755 Valid, 1907 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 20:11:20,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57328 states. [2025-03-03 20:11:20,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57328 to 53425. [2025-03-03 20:11:20,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53425 states, 51852 states have (on average 1.6675923783074906) internal successors, (86468), 51896 states have internal predecessors, (86468), 1500 states have call successors, (1500), 72 states have call predecessors, (1500), 72 states have return successors, (1500), 1456 states have call predecessors, (1500), 1500 states have call successors, (1500) [2025-03-03 20:11:21,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53425 states to 53425 states and 89468 transitions. [2025-03-03 20:11:21,086 INFO L78 Accepts]: Start accepts. Automaton has 53425 states and 89468 transitions. Word has length 733 [2025-03-03 20:11:21,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:11:21,087 INFO L471 AbstractCegarLoop]: Abstraction has 53425 states and 89468 transitions. [2025-03-03 20:11:21,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.2) internal successors, (166), 5 states have internal predecessors, (166), 1 states have call successors, (114), 1 states have call predecessors, (114), 1 states have return successors, (114), 1 states have call predecessors, (114), 1 states have call successors, (114) [2025-03-03 20:11:21,087 INFO L276 IsEmpty]: Start isEmpty. Operand 53425 states and 89468 transitions. [2025-03-03 20:11:21,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 734 [2025-03-03 20:11:21,111 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:11:21,111 INFO L218 NwaCegarLoop]: trace histogram [114, 114, 114, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 20:11:21,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 20:11:21,111 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:11:21,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:11:21,112 INFO L85 PathProgramCache]: Analyzing trace with hash -1214523949, now seen corresponding path program 1 times [2025-03-03 20:11:21,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:11:21,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697105426] [2025-03-03 20:11:21,112 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:11:21,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:11:21,137 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 733 statements into 1 equivalence classes. [2025-03-03 20:11:21,606 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 733 of 733 statements. [2025-03-03 20:11:21,606 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:11:21,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:11:22,113 INFO L134 CoverageAnalysis]: Checked inductivity of 25764 backedges. 57 proven. 282 refuted. 0 times theorem prover too weak. 25425 trivial. 0 not checked. [2025-03-03 20:11:22,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:11:22,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697105426] [2025-03-03 20:11:22,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697105426] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 20:11:22,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [792702581] [2025-03-03 20:11:22,113 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:11:22,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 20:11:22,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:11:22,115 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 20:11:22,117 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 20:11:22,314 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 733 statements into 1 equivalence classes. [2025-03-03 20:11:22,498 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 733 of 733 statements. [2025-03-03 20:11:22,498 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:11:22,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:11:22,505 INFO L256 TraceCheckSpWp]: Trace formula consists of 1663 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-03 20:11:22,522 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 20:11:23,166 INFO L134 CoverageAnalysis]: Checked inductivity of 25764 backedges. 7145 proven. 39 refuted. 0 times theorem prover too weak. 18580 trivial. 0 not checked. [2025-03-03 20:11:23,167 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 20:11:23,685 INFO L134 CoverageAnalysis]: Checked inductivity of 25764 backedges. 300 proven. 39 refuted. 0 times theorem prover too weak. 25425 trivial. 0 not checked. [2025-03-03 20:11:23,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [792702581] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 20:11:23,686 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 20:11:23,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8, 8] total 16 [2025-03-03 20:11:23,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762672384] [2025-03-03 20:11:23,687 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 20:11:23,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-03 20:11:23,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:11:23,689 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-03 20:11:23,689 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2025-03-03 20:11:23,690 INFO L87 Difference]: Start difference. First operand 53425 states and 89468 transitions. Second operand has 16 states, 16 states have (on average 19.125) internal successors, (306), 16 states have internal predecessors, (306), 5 states have call successors, (226), 3 states have call predecessors, (226), 6 states have return successors, (227), 5 states have call predecessors, (227), 5 states have call successors, (227) [2025-03-03 20:11:29,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:11:29,129 INFO L93 Difference]: Finished difference Result 253975 states and 416013 transitions. [2025-03-03 20:11:29,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2025-03-03 20:11:29,130 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 19.125) internal successors, (306), 16 states have internal predecessors, (306), 5 states have call successors, (226), 3 states have call predecessors, (226), 6 states have return successors, (227), 5 states have call predecessors, (227), 5 states have call successors, (227) Word has length 733 [2025-03-03 20:11:29,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:11:29,490 INFO L225 Difference]: With dead ends: 253975 [2025-03-03 20:11:29,490 INFO L226 Difference]: Without dead ends: 200553 [2025-03-03 20:11:29,589 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1515 GetRequests, 1460 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 859 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=832, Invalid=2248, Unknown=0, NotChecked=0, Total=3080 [2025-03-03 20:11:29,591 INFO L435 NwaCegarLoop]: 746 mSDtfsCounter, 3820 mSDsluCounter, 3150 mSDsCounter, 0 mSdLazyCounter, 2849 mSolverCounterSat, 1725 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3826 SdHoareTripleChecker+Valid, 3896 SdHoareTripleChecker+Invalid, 4574 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1725 IncrementalHoareTripleChecker+Valid, 2849 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-03-03 20:11:29,591 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3826 Valid, 3896 Invalid, 4574 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1725 Valid, 2849 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-03-03 20:11:29,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200553 states. [2025-03-03 20:11:32,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200553 to 99313. [2025-03-03 20:11:32,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99313 states, 96584 states have (on average 1.6381595295287004) internal successors, (158220), 96676 states have internal predecessors, (158220), 2532 states have call successors, (2532), 196 states have call predecessors, (2532), 196 states have return successors, (2532), 2440 states have call predecessors, (2532), 2532 states have call successors, (2532) [2025-03-03 20:11:32,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99313 states to 99313 states and 163284 transitions. [2025-03-03 20:11:32,317 INFO L78 Accepts]: Start accepts. Automaton has 99313 states and 163284 transitions. Word has length 733 [2025-03-03 20:11:32,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:11:32,318 INFO L471 AbstractCegarLoop]: Abstraction has 99313 states and 163284 transitions. [2025-03-03 20:11:32,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 19.125) internal successors, (306), 16 states have internal predecessors, (306), 5 states have call successors, (226), 3 states have call predecessors, (226), 6 states have return successors, (227), 5 states have call predecessors, (227), 5 states have call successors, (227) [2025-03-03 20:11:32,318 INFO L276 IsEmpty]: Start isEmpty. Operand 99313 states and 163284 transitions. [2025-03-03 20:11:32,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 735 [2025-03-03 20:11:32,371 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:11:32,371 INFO L218 NwaCegarLoop]: trace histogram [114, 114, 114, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 20:11:32,382 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-03 20:11:32,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-03 20:11:32,573 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:11:32,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:11:32,574 INFO L85 PathProgramCache]: Analyzing trace with hash -982019024, now seen corresponding path program 1 times [2025-03-03 20:11:32,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:11:32,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916733632] [2025-03-03 20:11:32,574 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:11:32,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:11:32,608 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 734 statements into 1 equivalence classes. [2025-03-03 20:11:33,276 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 734 of 734 statements. [2025-03-03 20:11:33,277 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:11:33,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:11:50,526 INFO L134 CoverageAnalysis]: Checked inductivity of 25764 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25764 trivial. 0 not checked. [2025-03-03 20:11:50,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:11:50,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916733632] [2025-03-03 20:11:50,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916733632] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:11:50,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:11:50,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2025-03-03 20:11:50,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683159354] [2025-03-03 20:11:50,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:11:50,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-03 20:11:50,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:11:50,528 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-03 20:11:50,528 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=405, Unknown=0, NotChecked=0, Total=462 [2025-03-03 20:11:50,529 INFO L87 Difference]: Start difference. First operand 99313 states and 163284 transitions. Second operand has 22 states, 22 states have (on average 7.590909090909091) internal successors, (167), 22 states have internal predecessors, (167), 6 states have call successors, (114), 1 states have call predecessors, (114), 1 states have return successors, (114), 6 states have call predecessors, (114), 6 states have call successors, (114)