./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w8_d64_e0.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w8_d64_e0.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 64bit --witnessprinter.graph.data.programhash dcc8d23cd9f485072084eb5fea8ae908ba08518a8b9707f57a9860924bd91f5c --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-07 22:57:20,807 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-07 22:57:20,873 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-02-07 22:57:20,880 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-07 22:57:20,880 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-07 22:57:20,902 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-07 22:57:20,902 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-07 22:57:20,902 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-07 22:57:20,903 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-07 22:57:20,903 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-07 22:57:20,903 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-07 22:57:20,903 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-07 22:57:20,903 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-07 22:57:20,903 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-07 22:57:20,903 INFO L153 SettingsManager]: * Use SBE=true [2025-02-07 22:57:20,903 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-07 22:57:20,903 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-07 22:57:20,903 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-07 22:57:20,903 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-07 22:57:20,903 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-07 22:57:20,903 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-07 22:57:20,903 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-07 22:57:20,903 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-07 22:57:20,904 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-07 22:57:20,904 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-07 22:57:20,904 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-07 22:57:20,904 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-07 22:57:20,904 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-07 22:57:20,904 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-07 22:57:20,904 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 22:57:20,904 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-07 22:57:20,904 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-07 22:57:20,904 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-07 22:57:20,904 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-07 22:57:20,904 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-07 22:57:20,904 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-07 22:57:20,904 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-07 22:57:20,904 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-07 22:57:20,904 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-07 22:57:20,905 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-07 22:57:20,905 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-jdk21/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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> dcc8d23cd9f485072084eb5fea8ae908ba08518a8b9707f57a9860924bd91f5c [2025-02-07 22:57:21,106 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-07 22:57:21,118 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-07 22:57:21,120 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-07 22:57:21,121 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-07 22:57:21,121 INFO L274 PluginConnector]: CDTParser initialized [2025-02-07 22:57:21,122 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w8_d64_e0.c [2025-02-07 22:57:22,274 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/257ad58f9/2bc57be3657b4a94830c19bdf8b695ce/FLAGee489cd31 [2025-02-07 22:57:22,675 INFO L384 CDTParser]: Found 1 translation units. [2025-02-07 22:57:22,675 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w8_d64_e0.c [2025-02-07 22:57:22,692 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/257ad58f9/2bc57be3657b4a94830c19bdf8b695ce/FLAGee489cd31 [2025-02-07 22:57:22,836 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/257ad58f9/2bc57be3657b4a94830c19bdf8b695ce [2025-02-07 22:57:22,838 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-07 22:57:22,839 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-07 22:57:22,841 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-07 22:57:22,844 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-07 22:57:22,847 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-07 22:57:22,848 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 10:57:22" (1/1) ... [2025-02-07 22:57:22,849 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2cd90062 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:57:22, skipping insertion in model container [2025-02-07 22:57:22,849 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 10:57:22" (1/1) ... [2025-02-07 22:57:22,896 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-07 22:57:23,020 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w8_d64_e0.c[1279,1292] [2025-02-07 22:57:23,440 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 22:57:23,450 INFO L200 MainTranslator]: Completed pre-run [2025-02-07 22:57:23,457 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w8_d64_e0.c[1279,1292] [2025-02-07 22:57:23,637 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 22:57:23,648 INFO L204 MainTranslator]: Completed translation [2025-02-07 22:57:23,649 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:57:23 WrapperNode [2025-02-07 22:57:23,649 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-07 22:57:23,650 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-07 22:57:23,650 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-07 22:57:23,650 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-07 22:57:23,654 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:57:23" (1/1) ... [2025-02-07 22:57:23,698 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:57:23" (1/1) ... [2025-02-07 22:57:24,159 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 5529 [2025-02-07 22:57:24,160 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-07 22:57:24,161 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-07 22:57:24,161 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-07 22:57:24,161 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-07 22:57:24,167 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:57:23" (1/1) ... [2025-02-07 22:57:24,168 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:57:23" (1/1) ... [2025-02-07 22:57:24,272 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:57:23" (1/1) ... [2025-02-07 22:57:24,362 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-02-07 22:57:24,364 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:57:23" (1/1) ... [2025-02-07 22:57:24,364 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:57:23" (1/1) ... [2025-02-07 22:57:24,432 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:57:23" (1/1) ... [2025-02-07 22:57:24,446 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:57:23" (1/1) ... [2025-02-07 22:57:24,465 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:57:23" (1/1) ... [2025-02-07 22:57:24,488 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:57:23" (1/1) ... [2025-02-07 22:57:24,529 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-07 22:57:24,530 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-07 22:57:24,531 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-07 22:57:24,531 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-07 22:57:24,531 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:57:23" (1/1) ... [2025-02-07 22:57:24,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 22:57:24,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 22:57:24,558 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-07 22:57:24,560 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-07 22:57:24,575 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-07 22:57:24,575 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-07 22:57:24,575 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-07 22:57:24,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-07 22:57:24,575 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-07 22:57:24,575 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-07 22:57:25,031 INFO L257 CfgBuilder]: Building ICFG [2025-02-07 22:57:25,033 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-07 22:57:29,786 INFO L? ?]: Removed 3106 outVars from TransFormulas that were not future-live. [2025-02-07 22:57:29,787 INFO L308 CfgBuilder]: Performing block encoding [2025-02-07 22:57:29,878 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-07 22:57:29,879 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-07 22:57:29,879 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 10:57:29 BoogieIcfgContainer [2025-02-07 22:57:29,879 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-07 22:57:29,881 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-07 22:57:29,881 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-07 22:57:29,884 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-07 22:57:29,884 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 10:57:22" (1/3) ... [2025-02-07 22:57:29,884 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ea019cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 10:57:29, skipping insertion in model container [2025-02-07 22:57:29,884 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:57:23" (2/3) ... [2025-02-07 22:57:29,885 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ea019cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 10:57:29, skipping insertion in model container [2025-02-07 22:57:29,885 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 10:57:29" (3/3) ... [2025-02-07 22:57:29,885 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.circular_pointer_top_w8_d64_e0.c [2025-02-07 22:57:29,896 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-07 22:57:29,897 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.circular_pointer_top_w8_d64_e0.c that has 2 procedures, 1510 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-07 22:57:29,944 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-07 22:57:29,951 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;@60738a2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-07 22:57:29,951 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-07 22:57:29,956 INFO L276 IsEmpty]: Start isEmpty. Operand has 1510 states, 1504 states have (on average 1.4986702127659575) internal successors, (2254), 1505 states have internal predecessors, (2254), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-07 22:57:29,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2025-02-07 22:57:29,969 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:57:29,970 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-07 22:57:29,970 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:57:29,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:57:29,973 INFO L85 PathProgramCache]: Analyzing trace with hash 1799031261, now seen corresponding path program 1 times [2025-02-07 22:57:29,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:57:29,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302374908] [2025-02-07 22:57:29,978 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:57:29,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:57:30,101 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 340 statements into 1 equivalence classes. [2025-02-07 22:57:30,160 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 340 of 340 statements. [2025-02-07 22:57:30,160 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:57:30,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:57:30,498 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-07 22:57:30,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:57:30,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302374908] [2025-02-07 22:57:30,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302374908] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 22:57:30,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1666656634] [2025-02-07 22:57:30,499 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:57:30,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 22:57:30,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 22:57:30,506 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 22:57:30,574 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-07 22:57:31,250 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 340 statements into 1 equivalence classes. [2025-02-07 22:57:31,461 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 340 of 340 statements. [2025-02-07 22:57:31,461 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:57:31,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:57:31,473 INFO L256 TraceCheckSpWp]: Trace formula consists of 2371 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-07 22:57:31,484 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 22:57:31,505 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-07 22:57:31,505 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-07 22:57:31,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1666656634] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:57:31,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-07 22:57:31,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-07 22:57:31,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791029015] [2025-02-07 22:57:31,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:57:31,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-07 22:57:31,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:57:31,522 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-07 22:57:31,522 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-07 22:57:31,526 INFO L87 Difference]: Start difference. First operand has 1510 states, 1504 states have (on average 1.4986702127659575) internal successors, (2254), 1505 states have internal predecessors, (2254), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 165.0) internal successors, (330), 2 states have internal predecessors, (330), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-07 22:57:32,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:57:32,127 INFO L93 Difference]: Finished difference Result 2725 states and 4083 transitions. [2025-02-07 22:57:32,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-07 22:57:32,129 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 165.0) internal successors, (330), 2 states have internal predecessors, (330), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 340 [2025-02-07 22:57:32,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:57:32,148 INFO L225 Difference]: With dead ends: 2725 [2025-02-07 22:57:32,148 INFO L226 Difference]: Without dead ends: 1508 [2025-02-07 22:57:32,152 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 341 GetRequests, 341 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-02-07 22:57:32,154 INFO L435 NwaCegarLoop]: 1883 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 373 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1883 SdHoareTripleChecker+Invalid, 373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-07 22:57:32,154 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1883 Invalid, 373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 373 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-07 22:57:32,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1508 states. [2025-02-07 22:57:32,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1508 to 1508. [2025-02-07 22:57:32,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1508 states, 1503 states have (on average 1.4970059880239521) internal successors, (2250), 1503 states have internal predecessors, (2250), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-07 22:57:32,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1508 states to 1508 states and 2256 transitions. [2025-02-07 22:57:32,216 INFO L78 Accepts]: Start accepts. Automaton has 1508 states and 2256 transitions. Word has length 340 [2025-02-07 22:57:32,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:57:32,217 INFO L471 AbstractCegarLoop]: Abstraction has 1508 states and 2256 transitions. [2025-02-07 22:57:32,218 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 165.0) internal successors, (330), 2 states have internal predecessors, (330), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-07 22:57:32,218 INFO L276 IsEmpty]: Start isEmpty. Operand 1508 states and 2256 transitions. [2025-02-07 22:57:32,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2025-02-07 22:57:32,226 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:57:32,227 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-07 22:57:32,239 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-07 22:57:32,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-07 22:57:32,432 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:57:32,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:57:32,436 INFO L85 PathProgramCache]: Analyzing trace with hash -1435734662, now seen corresponding path program 1 times [2025-02-07 22:57:32,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:57:32,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654153225] [2025-02-07 22:57:32,436 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:57:32,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:57:32,595 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 340 statements into 1 equivalence classes. [2025-02-07 22:57:32,809 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 340 of 340 statements. [2025-02-07 22:57:32,809 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:57:32,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:57:34,037 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-07 22:57:34,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:57:34,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654153225] [2025-02-07 22:57:34,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654153225] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:57:34,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:57:34,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 22:57:34,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584425695] [2025-02-07 22:57:34,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:57:34,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 22:57:34,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:57:34,040 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 22:57:34,040 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 22:57:34,040 INFO L87 Difference]: Start difference. First operand 1508 states and 2256 transitions. Second operand has 4 states, 4 states have (on average 82.0) internal successors, (328), 4 states have internal predecessors, (328), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:57:34,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:57:34,650 INFO L93 Difference]: Finished difference Result 1512 states and 2260 transitions. [2025-02-07 22:57:34,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:57:34,650 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 82.0) internal successors, (328), 4 states have internal predecessors, (328), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 340 [2025-02-07 22:57:34,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:57:34,655 INFO L225 Difference]: With dead ends: 1512 [2025-02-07 22:57:34,655 INFO L226 Difference]: Without dead ends: 1510 [2025-02-07 22:57:34,655 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-02-07 22:57:34,656 INFO L435 NwaCegarLoop]: 1881 mSDtfsCounter, 0 mSDsluCounter, 3757 mSDsCounter, 0 mSdLazyCounter, 1129 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 5638 SdHoareTripleChecker+Invalid, 1129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-07 22:57:34,656 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 5638 Invalid, 1129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1129 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-07 22:57:34,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1510 states. [2025-02-07 22:57:34,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1510 to 1510. [2025-02-07 22:57:34,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1510 states, 1505 states have (on average 1.496345514950166) internal successors, (2252), 1505 states have internal predecessors, (2252), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-07 22:57:34,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1510 states to 1510 states and 2258 transitions. [2025-02-07 22:57:34,676 INFO L78 Accepts]: Start accepts. Automaton has 1510 states and 2258 transitions. Word has length 340 [2025-02-07 22:57:34,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:57:34,678 INFO L471 AbstractCegarLoop]: Abstraction has 1510 states and 2258 transitions. [2025-02-07 22:57:34,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 82.0) internal successors, (328), 4 states have internal predecessors, (328), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:57:34,678 INFO L276 IsEmpty]: Start isEmpty. Operand 1510 states and 2258 transitions. [2025-02-07 22:57:34,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 342 [2025-02-07 22:57:34,681 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:57:34,681 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-07 22:57:34,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-07 22:57:34,681 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:57:34,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:57:34,682 INFO L85 PathProgramCache]: Analyzing trace with hash -1553420921, now seen corresponding path program 1 times [2025-02-07 22:57:34,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:57:34,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411600135] [2025-02-07 22:57:34,682 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:57:34,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:57:34,749 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 341 statements into 1 equivalence classes. [2025-02-07 22:57:34,838 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 341 of 341 statements. [2025-02-07 22:57:34,838 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:57:34,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:57:35,356 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-07 22:57:35,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:57:35,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411600135] [2025-02-07 22:57:35,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411600135] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:57:35,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:57:35,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 22:57:35,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680840468] [2025-02-07 22:57:35,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:57:35,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:57:35,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:57:35,358 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:57:35,359 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:57:35,359 INFO L87 Difference]: Start difference. First operand 1510 states and 2258 transitions. Second operand has 5 states, 5 states have (on average 65.8) internal successors, (329), 5 states have internal predecessors, (329), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:57:36,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:57:36,608 INFO L93 Difference]: Finished difference Result 3770 states and 5640 transitions. [2025-02-07 22:57:36,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 22:57:36,608 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 65.8) internal successors, (329), 5 states have internal predecessors, (329), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 341 [2025-02-07 22:57:36,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:57:36,613 INFO L225 Difference]: With dead ends: 3770 [2025-02-07 22:57:36,613 INFO L226 Difference]: Without dead ends: 1510 [2025-02-07 22:57:36,615 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-02-07 22:57:36,615 INFO L435 NwaCegarLoop]: 1868 mSDtfsCounter, 4786 mSDsluCounter, 3408 mSDsCounter, 0 mSdLazyCounter, 1693 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4786 SdHoareTripleChecker+Valid, 5276 SdHoareTripleChecker+Invalid, 1778 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 1693 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-02-07 22:57:36,616 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4786 Valid, 5276 Invalid, 1778 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 1693 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-02-07 22:57:36,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1510 states. [2025-02-07 22:57:36,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1510 to 1510. [2025-02-07 22:57:36,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1510 states, 1505 states have (on average 1.4956810631229236) internal successors, (2251), 1505 states have internal predecessors, (2251), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-07 22:57:36,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1510 states to 1510 states and 2257 transitions. [2025-02-07 22:57:36,635 INFO L78 Accepts]: Start accepts. Automaton has 1510 states and 2257 transitions. Word has length 341 [2025-02-07 22:57:36,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:57:36,635 INFO L471 AbstractCegarLoop]: Abstraction has 1510 states and 2257 transitions. [2025-02-07 22:57:36,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 65.8) internal successors, (329), 5 states have internal predecessors, (329), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:57:36,636 INFO L276 IsEmpty]: Start isEmpty. Operand 1510 states and 2257 transitions. [2025-02-07 22:57:36,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2025-02-07 22:57:36,638 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:57:36,638 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-07 22:57:36,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-07 22:57:36,639 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:57:36,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:57:36,639 INFO L85 PathProgramCache]: Analyzing trace with hash 453870352, now seen corresponding path program 1 times [2025-02-07 22:57:36,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:57:36,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744166588] [2025-02-07 22:57:36,640 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:57:36,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:57:36,712 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 342 statements into 1 equivalence classes. [2025-02-07 22:57:36,823 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 342 of 342 statements. [2025-02-07 22:57:36,823 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:57:36,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:57:37,234 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-07 22:57:37,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:57:37,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744166588] [2025-02-07 22:57:37,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744166588] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:57:37,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:57:37,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 22:57:37,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740684648] [2025-02-07 22:57:37,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:57:37,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 22:57:37,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:57:37,236 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 22:57:37,237 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 22:57:37,237 INFO L87 Difference]: Start difference. First operand 1510 states and 2257 transitions. Second operand has 4 states, 4 states have (on average 82.5) internal successors, (330), 4 states have internal predecessors, (330), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:57:37,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:57:37,808 INFO L93 Difference]: Finished difference Result 2729 states and 4078 transitions. [2025-02-07 22:57:37,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:57:37,809 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 82.5) internal successors, (330), 4 states have internal predecessors, (330), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 342 [2025-02-07 22:57:37,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:57:37,813 INFO L225 Difference]: With dead ends: 2729 [2025-02-07 22:57:37,813 INFO L226 Difference]: Without dead ends: 1512 [2025-02-07 22:57:37,814 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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-02-07 22:57:37,815 INFO L435 NwaCegarLoop]: 1880 mSDtfsCounter, 0 mSDsluCounter, 3752 mSDsCounter, 0 mSdLazyCounter, 1132 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 5632 SdHoareTripleChecker+Invalid, 1132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-07 22:57:37,815 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 5632 Invalid, 1132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1132 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-07 22:57:37,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1512 states. [2025-02-07 22:57:37,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1512 to 1512. [2025-02-07 22:57:37,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1512 states, 1507 states have (on average 1.4950232249502322) internal successors, (2253), 1507 states have internal predecessors, (2253), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-07 22:57:37,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1512 states to 1512 states and 2259 transitions. [2025-02-07 22:57:37,835 INFO L78 Accepts]: Start accepts. Automaton has 1512 states and 2259 transitions. Word has length 342 [2025-02-07 22:57:37,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:57:37,835 INFO L471 AbstractCegarLoop]: Abstraction has 1512 states and 2259 transitions. [2025-02-07 22:57:37,836 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 82.5) internal successors, (330), 4 states have internal predecessors, (330), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:57:37,836 INFO L276 IsEmpty]: Start isEmpty. Operand 1512 states and 2259 transitions. [2025-02-07 22:57:37,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 344 [2025-02-07 22:57:37,838 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:57:37,838 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-07 22:57:37,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-07 22:57:37,839 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:57:37,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:57:37,839 INFO L85 PathProgramCache]: Analyzing trace with hash -1178377556, now seen corresponding path program 1 times [2025-02-07 22:57:37,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:57:37,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976392684] [2025-02-07 22:57:37,839 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:57:37,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:57:37,935 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 343 statements into 1 equivalence classes. [2025-02-07 22:57:38,157 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 343 of 343 statements. [2025-02-07 22:57:38,157 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:57:38,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:57:38,963 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-07 22:57:38,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:57:38,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976392684] [2025-02-07 22:57:38,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976392684] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:57:38,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:57:38,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 22:57:38,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24135198] [2025-02-07 22:57:38,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:57:38,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 22:57:38,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:57:38,964 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 22:57:38,964 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 22:57:38,964 INFO L87 Difference]: Start difference. First operand 1512 states and 2259 transitions. Second operand has 4 states, 4 states have (on average 82.75) internal successors, (331), 4 states have internal predecessors, (331), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:57:39,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:57:39,960 INFO L93 Difference]: Finished difference Result 2731 states and 4079 transitions. [2025-02-07 22:57:39,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:57:39,960 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 82.75) internal successors, (331), 4 states have internal predecessors, (331), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 343 [2025-02-07 22:57:39,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:57:39,965 INFO L225 Difference]: With dead ends: 2731 [2025-02-07 22:57:39,965 INFO L226 Difference]: Without dead ends: 1512 [2025-02-07 22:57:39,967 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:57:39,968 INFO L435 NwaCegarLoop]: 1624 mSDtfsCounter, 1944 mSDsluCounter, 1625 mSDsCounter, 0 mSdLazyCounter, 1262 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1944 SdHoareTripleChecker+Valid, 3249 SdHoareTripleChecker+Invalid, 1262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-07 22:57:39,968 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1944 Valid, 3249 Invalid, 1262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1262 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-07 22:57:39,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1512 states. [2025-02-07 22:57:39,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1512 to 1512. [2025-02-07 22:57:39,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1512 states, 1507 states have (on average 1.4943596549435965) internal successors, (2252), 1507 states have internal predecessors, (2252), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-07 22:57:39,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1512 states to 1512 states and 2258 transitions. [2025-02-07 22:57:39,999 INFO L78 Accepts]: Start accepts. Automaton has 1512 states and 2258 transitions. Word has length 343 [2025-02-07 22:57:39,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:57:40,000 INFO L471 AbstractCegarLoop]: Abstraction has 1512 states and 2258 transitions. [2025-02-07 22:57:40,000 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 82.75) internal successors, (331), 4 states have internal predecessors, (331), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:57:40,000 INFO L276 IsEmpty]: Start isEmpty. Operand 1512 states and 2258 transitions. [2025-02-07 22:57:40,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 345 [2025-02-07 22:57:40,005 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:57:40,005 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-07 22:57:40,006 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-07 22:57:40,006 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:57:40,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:57:40,007 INFO L85 PathProgramCache]: Analyzing trace with hash -1953418056, now seen corresponding path program 1 times [2025-02-07 22:57:40,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:57:40,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680317858] [2025-02-07 22:57:40,009 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:57:40,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:57:40,107 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 344 statements into 1 equivalence classes. [2025-02-07 22:57:40,217 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 344 of 344 statements. [2025-02-07 22:57:40,217 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:57:40,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:57:40,604 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-07 22:57:40,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:57:40,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680317858] [2025-02-07 22:57:40,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680317858] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:57:40,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:57:40,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 22:57:40,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643445876] [2025-02-07 22:57:40,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:57:40,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:57:40,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:57:40,607 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:57:40,608 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:57:40,608 INFO L87 Difference]: Start difference. First operand 1512 states and 2258 transitions. Second operand has 5 states, 5 states have (on average 66.4) internal successors, (332), 5 states have internal predecessors, (332), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:57:41,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:57:41,479 INFO L93 Difference]: Finished difference Result 2783 states and 4154 transitions. [2025-02-07 22:57:41,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 22:57:41,479 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 66.4) internal successors, (332), 5 states have internal predecessors, (332), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 344 [2025-02-07 22:57:41,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:57:41,484 INFO L225 Difference]: With dead ends: 2783 [2025-02-07 22:57:41,484 INFO L226 Difference]: Without dead ends: 1512 [2025-02-07 22:57:41,486 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-07 22:57:41,487 INFO L435 NwaCegarLoop]: 1850 mSDtfsCounter, 2047 mSDsluCounter, 3477 mSDsCounter, 0 mSdLazyCounter, 1437 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2047 SdHoareTripleChecker+Valid, 5327 SdHoareTripleChecker+Invalid, 1462 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-07 22:57:41,487 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2047 Valid, 5327 Invalid, 1462 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1437 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-07 22:57:41,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1512 states. [2025-02-07 22:57:41,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1512 to 1512. [2025-02-07 22:57:41,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1512 states, 1507 states have (on average 1.493696084936961) internal successors, (2251), 1507 states have internal predecessors, (2251), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-07 22:57:41,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1512 states to 1512 states and 2257 transitions. [2025-02-07 22:57:41,505 INFO L78 Accepts]: Start accepts. Automaton has 1512 states and 2257 transitions. Word has length 344 [2025-02-07 22:57:41,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:57:41,506 INFO L471 AbstractCegarLoop]: Abstraction has 1512 states and 2257 transitions. [2025-02-07 22:57:41,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 66.4) internal successors, (332), 5 states have internal predecessors, (332), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:57:41,506 INFO L276 IsEmpty]: Start isEmpty. Operand 1512 states and 2257 transitions. [2025-02-07 22:57:41,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 346 [2025-02-07 22:57:41,508 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:57:41,508 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-07 22:57:41,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-07 22:57:41,509 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:57:41,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:57:41,509 INFO L85 PathProgramCache]: Analyzing trace with hash 1073445610, now seen corresponding path program 1 times [2025-02-07 22:57:41,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:57:41,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413879646] [2025-02-07 22:57:41,509 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:57:41,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:57:41,579 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 345 statements into 1 equivalence classes. [2025-02-07 22:57:41,645 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 345 of 345 statements. [2025-02-07 22:57:41,645 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:57:41,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:57:41,978 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-07 22:57:41,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:57:41,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413879646] [2025-02-07 22:57:41,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413879646] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:57:41,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:57:41,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 22:57:41,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024289716] [2025-02-07 22:57:41,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:57:41,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:57:41,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:57:41,980 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:57:41,980 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:57:41,980 INFO L87 Difference]: Start difference. First operand 1512 states and 2257 transitions. Second operand has 5 states, 5 states have (on average 66.6) internal successors, (333), 5 states have internal predecessors, (333), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:57:42,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:57:42,761 INFO L93 Difference]: Finished difference Result 2731 states and 4075 transitions. [2025-02-07 22:57:42,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:57:42,761 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 66.6) internal successors, (333), 5 states have internal predecessors, (333), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 345 [2025-02-07 22:57:42,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:57:42,765 INFO L225 Difference]: With dead ends: 2731 [2025-02-07 22:57:42,766 INFO L226 Difference]: Without dead ends: 1512 [2025-02-07 22:57:42,768 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-02-07 22:57:42,768 INFO L435 NwaCegarLoop]: 1624 mSDtfsCounter, 2242 mSDsluCounter, 1631 mSDsCounter, 0 mSdLazyCounter, 1258 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2245 SdHoareTripleChecker+Valid, 3255 SdHoareTripleChecker+Invalid, 1259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-07 22:57:42,768 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2245 Valid, 3255 Invalid, 1259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1258 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-07 22:57:42,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1512 states. [2025-02-07 22:57:42,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1512 to 1512. [2025-02-07 22:57:42,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1512 states, 1507 states have (on average 1.4930325149303252) internal successors, (2250), 1507 states have internal predecessors, (2250), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-07 22:57:42,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1512 states to 1512 states and 2256 transitions. [2025-02-07 22:57:42,791 INFO L78 Accepts]: Start accepts. Automaton has 1512 states and 2256 transitions. Word has length 345 [2025-02-07 22:57:42,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:57:42,791 INFO L471 AbstractCegarLoop]: Abstraction has 1512 states and 2256 transitions. [2025-02-07 22:57:42,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 66.6) internal successors, (333), 5 states have internal predecessors, (333), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:57:42,792 INFO L276 IsEmpty]: Start isEmpty. Operand 1512 states and 2256 transitions. [2025-02-07 22:57:42,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 347 [2025-02-07 22:57:42,793 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:57:42,793 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-07 22:57:42,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-07 22:57:42,794 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:57:42,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:57:42,794 INFO L85 PathProgramCache]: Analyzing trace with hash -1949473987, now seen corresponding path program 1 times [2025-02-07 22:57:42,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:57:42,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488434874] [2025-02-07 22:57:42,794 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:57:42,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:57:42,867 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 346 statements into 1 equivalence classes. [2025-02-07 22:57:42,951 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 346 of 346 statements. [2025-02-07 22:57:42,952 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:57:42,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:57:43,303 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-07 22:57:43,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:57:43,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488434874] [2025-02-07 22:57:43,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488434874] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:57:43,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:57:43,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 22:57:43,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485351481] [2025-02-07 22:57:43,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:57:43,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:57:43,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:57:43,305 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:57:43,305 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:57:43,305 INFO L87 Difference]: Start difference. First operand 1512 states and 2256 transitions. Second operand has 5 states, 5 states have (on average 66.8) internal successors, (334), 5 states have internal predecessors, (334), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:57:44,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:57:44,127 INFO L93 Difference]: Finished difference Result 2731 states and 4073 transitions. [2025-02-07 22:57:44,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:57:44,128 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 66.8) internal successors, (334), 5 states have internal predecessors, (334), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 346 [2025-02-07 22:57:44,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:57:44,133 INFO L225 Difference]: With dead ends: 2731 [2025-02-07 22:57:44,133 INFO L226 Difference]: Without dead ends: 1512 [2025-02-07 22:57:44,134 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-02-07 22:57:44,135 INFO L435 NwaCegarLoop]: 1624 mSDtfsCounter, 4223 mSDsluCounter, 1625 mSDsCounter, 0 mSdLazyCounter, 1256 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4226 SdHoareTripleChecker+Valid, 3249 SdHoareTripleChecker+Invalid, 1257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-07 22:57:44,136 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4226 Valid, 3249 Invalid, 1257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1256 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-07 22:57:44,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1512 states. [2025-02-07 22:57:44,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1512 to 1512. [2025-02-07 22:57:44,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1512 states, 1507 states have (on average 1.4923689449236894) internal successors, (2249), 1507 states have internal predecessors, (2249), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-07 22:57:44,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1512 states to 1512 states and 2255 transitions. [2025-02-07 22:57:44,151 INFO L78 Accepts]: Start accepts. Automaton has 1512 states and 2255 transitions. Word has length 346 [2025-02-07 22:57:44,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:57:44,152 INFO L471 AbstractCegarLoop]: Abstraction has 1512 states and 2255 transitions. [2025-02-07 22:57:44,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 66.8) internal successors, (334), 5 states have internal predecessors, (334), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:57:44,153 INFO L276 IsEmpty]: Start isEmpty. Operand 1512 states and 2255 transitions. [2025-02-07 22:57:44,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 348 [2025-02-07 22:57:44,154 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:57:44,154 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-07 22:57:44,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-07 22:57:44,154 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:57:44,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:57:44,155 INFO L85 PathProgramCache]: Analyzing trace with hash -1258079537, now seen corresponding path program 1 times [2025-02-07 22:57:44,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:57:44,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853042628] [2025-02-07 22:57:44,155 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:57:44,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:57:44,226 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 347 statements into 1 equivalence classes. [2025-02-07 22:57:44,299 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 347 of 347 statements. [2025-02-07 22:57:44,299 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:57:44,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:57:44,579 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-07 22:57:44,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:57:44,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853042628] [2025-02-07 22:57:44,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853042628] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:57:44,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:57:44,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 22:57:44,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588799924] [2025-02-07 22:57:44,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:57:44,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:57:44,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:57:44,580 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:57:44,580 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:57:44,581 INFO L87 Difference]: Start difference. First operand 1512 states and 2255 transitions. Second operand has 5 states, 5 states have (on average 67.0) internal successors, (335), 5 states have internal predecessors, (335), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:57:45,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:57:45,358 INFO L93 Difference]: Finished difference Result 2731 states and 4071 transitions. [2025-02-07 22:57:45,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:57:45,359 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 67.0) internal successors, (335), 5 states have internal predecessors, (335), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 347 [2025-02-07 22:57:45,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:57:45,362 INFO L225 Difference]: With dead ends: 2731 [2025-02-07 22:57:45,362 INFO L226 Difference]: Without dead ends: 1512 [2025-02-07 22:57:45,367 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-02-07 22:57:45,368 INFO L435 NwaCegarLoop]: 1624 mSDtfsCounter, 4215 mSDsluCounter, 1625 mSDsCounter, 0 mSdLazyCounter, 1254 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4218 SdHoareTripleChecker+Valid, 3249 SdHoareTripleChecker+Invalid, 1255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-07 22:57:45,368 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4218 Valid, 3249 Invalid, 1255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1254 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-07 22:57:45,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1512 states. [2025-02-07 22:57:45,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1512 to 1512. [2025-02-07 22:57:45,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1512 states, 1507 states have (on average 1.4917053749170537) internal successors, (2248), 1507 states have internal predecessors, (2248), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-07 22:57:45,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1512 states to 1512 states and 2254 transitions. [2025-02-07 22:57:45,395 INFO L78 Accepts]: Start accepts. Automaton has 1512 states and 2254 transitions. Word has length 347 [2025-02-07 22:57:45,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:57:45,396 INFO L471 AbstractCegarLoop]: Abstraction has 1512 states and 2254 transitions. [2025-02-07 22:57:45,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 67.0) internal successors, (335), 5 states have internal predecessors, (335), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:57:45,396 INFO L276 IsEmpty]: Start isEmpty. Operand 1512 states and 2254 transitions. [2025-02-07 22:57:45,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2025-02-07 22:57:45,397 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:57:45,397 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-07 22:57:45,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-07 22:57:45,398 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:57:45,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:57:45,398 INFO L85 PathProgramCache]: Analyzing trace with hash 18655298, now seen corresponding path program 1 times [2025-02-07 22:57:45,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:57:45,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107267556] [2025-02-07 22:57:45,398 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:57:45,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:57:45,524 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 348 statements into 1 equivalence classes. [2025-02-07 22:57:45,590 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 348 of 348 statements. [2025-02-07 22:57:45,591 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:57:45,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:57:45,871 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-07 22:57:45,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:57:45,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107267556] [2025-02-07 22:57:45,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107267556] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:57:45,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:57:45,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 22:57:45,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352598931] [2025-02-07 22:57:45,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:57:45,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:57:45,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:57:45,873 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:57:45,873 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:57:45,873 INFO L87 Difference]: Start difference. First operand 1512 states and 2254 transitions. Second operand has 5 states, 5 states have (on average 67.2) internal successors, (336), 5 states have internal predecessors, (336), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:57:46,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:57:46,620 INFO L93 Difference]: Finished difference Result 2731 states and 4069 transitions. [2025-02-07 22:57:46,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:57:46,620 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 67.2) internal successors, (336), 5 states have internal predecessors, (336), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 348 [2025-02-07 22:57:46,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:57:46,624 INFO L225 Difference]: With dead ends: 2731 [2025-02-07 22:57:46,624 INFO L226 Difference]: Without dead ends: 1512 [2025-02-07 22:57:46,625 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-02-07 22:57:46,625 INFO L435 NwaCegarLoop]: 1624 mSDtfsCounter, 4207 mSDsluCounter, 1625 mSDsCounter, 0 mSdLazyCounter, 1252 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4210 SdHoareTripleChecker+Valid, 3249 SdHoareTripleChecker+Invalid, 1253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-07 22:57:46,625 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4210 Valid, 3249 Invalid, 1253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1252 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-07 22:57:46,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1512 states. [2025-02-07 22:57:46,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1512 to 1512. [2025-02-07 22:57:46,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1512 states, 1507 states have (on average 1.4910418049104182) internal successors, (2247), 1507 states have internal predecessors, (2247), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-07 22:57:46,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1512 states to 1512 states and 2253 transitions. [2025-02-07 22:57:46,640 INFO L78 Accepts]: Start accepts. Automaton has 1512 states and 2253 transitions. Word has length 348 [2025-02-07 22:57:46,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:57:46,640 INFO L471 AbstractCegarLoop]: Abstraction has 1512 states and 2253 transitions. [2025-02-07 22:57:46,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 67.2) internal successors, (336), 5 states have internal predecessors, (336), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:57:46,641 INFO L276 IsEmpty]: Start isEmpty. Operand 1512 states and 2253 transitions. [2025-02-07 22:57:46,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 350 [2025-02-07 22:57:46,642 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:57:46,642 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-07 22:57:46,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-07 22:57:46,642 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:57:46,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:57:46,643 INFO L85 PathProgramCache]: Analyzing trace with hash -1630197452, now seen corresponding path program 1 times [2025-02-07 22:57:46,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:57:46,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324959821] [2025-02-07 22:57:46,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:57:46,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:57:46,708 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 349 statements into 1 equivalence classes. [2025-02-07 22:57:46,771 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 349 of 349 statements. [2025-02-07 22:57:46,771 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:57:46,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:57:47,146 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-07 22:57:47,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:57:47,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324959821] [2025-02-07 22:57:47,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324959821] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:57:47,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:57:47,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 22:57:47,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660436086] [2025-02-07 22:57:47,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:57:47,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:57:47,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:57:47,147 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:57:47,147 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:57:47,147 INFO L87 Difference]: Start difference. First operand 1512 states and 2253 transitions. Second operand has 5 states, 5 states have (on average 67.4) internal successors, (337), 5 states have internal predecessors, (337), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:57:47,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:57:47,996 INFO L93 Difference]: Finished difference Result 2731 states and 4067 transitions. [2025-02-07 22:57:47,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:57:47,996 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 67.4) internal successors, (337), 5 states have internal predecessors, (337), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 349 [2025-02-07 22:57:47,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:57:48,001 INFO L225 Difference]: With dead ends: 2731 [2025-02-07 22:57:48,001 INFO L226 Difference]: Without dead ends: 1512 [2025-02-07 22:57:48,002 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-02-07 22:57:48,003 INFO L435 NwaCegarLoop]: 1624 mSDtfsCounter, 4199 mSDsluCounter, 1625 mSDsCounter, 0 mSdLazyCounter, 1250 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4202 SdHoareTripleChecker+Valid, 3249 SdHoareTripleChecker+Invalid, 1251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-07 22:57:48,003 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4202 Valid, 3249 Invalid, 1251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1250 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-07 22:57:48,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1512 states. [2025-02-07 22:57:48,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1512 to 1512. [2025-02-07 22:57:48,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1512 states, 1507 states have (on average 1.4903782349037824) internal successors, (2246), 1507 states have internal predecessors, (2246), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-07 22:57:48,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1512 states to 1512 states and 2252 transitions. [2025-02-07 22:57:48,028 INFO L78 Accepts]: Start accepts. Automaton has 1512 states and 2252 transitions. Word has length 349 [2025-02-07 22:57:48,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:57:48,029 INFO L471 AbstractCegarLoop]: Abstraction has 1512 states and 2252 transitions. [2025-02-07 22:57:48,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 67.4) internal successors, (337), 5 states have internal predecessors, (337), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:57:48,029 INFO L276 IsEmpty]: Start isEmpty. Operand 1512 states and 2252 transitions. [2025-02-07 22:57:48,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2025-02-07 22:57:48,032 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:57:48,032 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-07 22:57:48,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-07 22:57:48,033 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:57:48,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:57:48,033 INFO L85 PathProgramCache]: Analyzing trace with hash -126139449, now seen corresponding path program 1 times [2025-02-07 22:57:48,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:57:48,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221261750] [2025-02-07 22:57:48,033 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:57:48,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:57:48,120 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 350 statements into 1 equivalence classes. [2025-02-07 22:57:48,185 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 350 of 350 statements. [2025-02-07 22:57:48,185 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:57:48,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:57:48,464 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-07 22:57:48,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:57:48,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221261750] [2025-02-07 22:57:48,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221261750] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:57:48,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:57:48,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 22:57:48,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644387378] [2025-02-07 22:57:48,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:57:48,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:57:48,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:57:48,466 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:57:48,466 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:57:48,466 INFO L87 Difference]: Start difference. First operand 1512 states and 2252 transitions. Second operand has 5 states, 5 states have (on average 67.6) internal successors, (338), 5 states have internal predecessors, (338), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:57:49,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:57:49,271 INFO L93 Difference]: Finished difference Result 2731 states and 4065 transitions. [2025-02-07 22:57:49,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:57:49,271 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 67.6) internal successors, (338), 5 states have internal predecessors, (338), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 350 [2025-02-07 22:57:49,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:57:49,275 INFO L225 Difference]: With dead ends: 2731 [2025-02-07 22:57:49,275 INFO L226 Difference]: Without dead ends: 1512 [2025-02-07 22:57:49,277 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-02-07 22:57:49,277 INFO L435 NwaCegarLoop]: 1624 mSDtfsCounter, 2222 mSDsluCounter, 1631 mSDsCounter, 0 mSdLazyCounter, 1248 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2225 SdHoareTripleChecker+Valid, 3255 SdHoareTripleChecker+Invalid, 1249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-07 22:57:49,278 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2225 Valid, 3255 Invalid, 1249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1248 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-07 22:57:49,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1512 states. [2025-02-07 22:57:49,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1512 to 1512. [2025-02-07 22:57:49,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1512 states, 1507 states have (on average 1.4897146648971467) internal successors, (2245), 1507 states have internal predecessors, (2245), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-07 22:57:49,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1512 states to 1512 states and 2251 transitions. [2025-02-07 22:57:49,297 INFO L78 Accepts]: Start accepts. Automaton has 1512 states and 2251 transitions. Word has length 350 [2025-02-07 22:57:49,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:57:49,299 INFO L471 AbstractCegarLoop]: Abstraction has 1512 states and 2251 transitions. [2025-02-07 22:57:49,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 67.6) internal successors, (338), 5 states have internal predecessors, (338), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:57:49,300 INFO L276 IsEmpty]: Start isEmpty. Operand 1512 states and 2251 transitions. [2025-02-07 22:57:49,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2025-02-07 22:57:49,301 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:57:49,301 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-07 22:57:49,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-07 22:57:49,302 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:57:49,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:57:49,302 INFO L85 PathProgramCache]: Analyzing trace with hash -243300839, now seen corresponding path program 1 times [2025-02-07 22:57:49,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:57:49,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371988080] [2025-02-07 22:57:49,302 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:57:49,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:57:49,370 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 351 statements into 1 equivalence classes. [2025-02-07 22:57:49,484 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 351 of 351 statements. [2025-02-07 22:57:49,484 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:57:49,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:57:49,734 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-07 22:57:49,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:57:49,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371988080] [2025-02-07 22:57:49,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1371988080] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:57:49,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:57:49,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 22:57:49,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694584896] [2025-02-07 22:57:49,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:57:49,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:57:49,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:57:49,737 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:57:49,737 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:57:49,737 INFO L87 Difference]: Start difference. First operand 1512 states and 2251 transitions. Second operand has 5 states, 5 states have (on average 67.8) internal successors, (339), 5 states have internal predecessors, (339), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:57:50,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:57:50,524 INFO L93 Difference]: Finished difference Result 2731 states and 4063 transitions. [2025-02-07 22:57:50,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:57:50,524 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 67.8) internal successors, (339), 5 states have internal predecessors, (339), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 351 [2025-02-07 22:57:50,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:57:50,528 INFO L225 Difference]: With dead ends: 2731 [2025-02-07 22:57:50,528 INFO L226 Difference]: Without dead ends: 1512 [2025-02-07 22:57:50,529 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-02-07 22:57:50,530 INFO L435 NwaCegarLoop]: 1624 mSDtfsCounter, 2218 mSDsluCounter, 1631 mSDsCounter, 0 mSdLazyCounter, 1246 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2221 SdHoareTripleChecker+Valid, 3255 SdHoareTripleChecker+Invalid, 1247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-07 22:57:50,530 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2221 Valid, 3255 Invalid, 1247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1246 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-07 22:57:50,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1512 states. [2025-02-07 22:57:50,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1512 to 1512. [2025-02-07 22:57:50,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1512 states, 1507 states have (on average 1.489051094890511) internal successors, (2244), 1507 states have internal predecessors, (2244), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-07 22:57:50,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1512 states to 1512 states and 2250 transitions. [2025-02-07 22:57:50,542 INFO L78 Accepts]: Start accepts. Automaton has 1512 states and 2250 transitions. Word has length 351 [2025-02-07 22:57:50,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:57:50,542 INFO L471 AbstractCegarLoop]: Abstraction has 1512 states and 2250 transitions. [2025-02-07 22:57:50,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 67.8) internal successors, (339), 5 states have internal predecessors, (339), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:57:50,543 INFO L276 IsEmpty]: Start isEmpty. Operand 1512 states and 2250 transitions. [2025-02-07 22:57:50,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2025-02-07 22:57:50,544 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:57:50,544 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-07 22:57:50,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-07 22:57:50,544 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:57:50,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:57:50,545 INFO L85 PathProgramCache]: Analyzing trace with hash -540707380, now seen corresponding path program 1 times [2025-02-07 22:57:50,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:57:50,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591926395] [2025-02-07 22:57:50,545 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:57:50,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:57:50,617 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 352 statements into 1 equivalence classes. [2025-02-07 22:57:50,685 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 352 of 352 statements. [2025-02-07 22:57:50,685 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:57:50,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:57:50,949 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-07 22:57:50,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:57:50,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591926395] [2025-02-07 22:57:50,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591926395] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:57:50,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:57:50,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 22:57:50,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243855683] [2025-02-07 22:57:50,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:57:50,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:57:50,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:57:50,951 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:57:50,951 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:57:50,951 INFO L87 Difference]: Start difference. First operand 1512 states and 2250 transitions. Second operand has 5 states, 5 states have (on average 68.0) internal successors, (340), 5 states have internal predecessors, (340), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:57:51,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:57:51,675 INFO L93 Difference]: Finished difference Result 2731 states and 4061 transitions. [2025-02-07 22:57:51,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:57:51,676 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 68.0) internal successors, (340), 5 states have internal predecessors, (340), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 352 [2025-02-07 22:57:51,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:57:51,679 INFO L225 Difference]: With dead ends: 2731 [2025-02-07 22:57:51,679 INFO L226 Difference]: Without dead ends: 1512 [2025-02-07 22:57:51,680 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-02-07 22:57:51,680 INFO L435 NwaCegarLoop]: 1624 mSDtfsCounter, 2214 mSDsluCounter, 1631 mSDsCounter, 0 mSdLazyCounter, 1244 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2217 SdHoareTripleChecker+Valid, 3255 SdHoareTripleChecker+Invalid, 1245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-07 22:57:51,680 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2217 Valid, 3255 Invalid, 1245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1244 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-07 22:57:51,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1512 states. [2025-02-07 22:57:51,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1512 to 1512. [2025-02-07 22:57:51,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1512 states, 1507 states have (on average 1.4883875248838752) internal successors, (2243), 1507 states have internal predecessors, (2243), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-07 22:57:51,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1512 states to 1512 states and 2249 transitions. [2025-02-07 22:57:51,693 INFO L78 Accepts]: Start accepts. Automaton has 1512 states and 2249 transitions. Word has length 352 [2025-02-07 22:57:51,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:57:51,694 INFO L471 AbstractCegarLoop]: Abstraction has 1512 states and 2249 transitions. [2025-02-07 22:57:51,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 68.0) internal successors, (340), 5 states have internal predecessors, (340), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:57:51,694 INFO L276 IsEmpty]: Start isEmpty. Operand 1512 states and 2249 transitions. [2025-02-07 22:57:51,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 354 [2025-02-07 22:57:51,695 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:57:51,696 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-07 22:57:51,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-07 22:57:51,696 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:57:51,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:57:51,696 INFO L85 PathProgramCache]: Analyzing trace with hash -2123329154, now seen corresponding path program 1 times [2025-02-07 22:57:51,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:57:51,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316142307] [2025-02-07 22:57:51,696 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:57:51,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:57:51,799 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 353 statements into 1 equivalence classes. [2025-02-07 22:57:51,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 353 of 353 statements. [2025-02-07 22:57:51,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:57:51,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:57:52,357 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-07 22:57:52,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:57:52,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316142307] [2025-02-07 22:57:52,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316142307] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:57:52,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:57:52,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 22:57:52,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847975070] [2025-02-07 22:57:52,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:57:52,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:57:52,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:57:52,359 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:57:52,359 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:57:52,362 INFO L87 Difference]: Start difference. First operand 1512 states and 2249 transitions. Second operand has 5 states, 5 states have (on average 68.2) internal successors, (341), 5 states have internal predecessors, (341), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:57:52,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:57:52,985 INFO L93 Difference]: Finished difference Result 2731 states and 4059 transitions. [2025-02-07 22:57:52,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:57:52,985 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 68.2) internal successors, (341), 5 states have internal predecessors, (341), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 353 [2025-02-07 22:57:52,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:57:52,988 INFO L225 Difference]: With dead ends: 2731 [2025-02-07 22:57:52,989 INFO L226 Difference]: Without dead ends: 1512 [2025-02-07 22:57:52,990 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-02-07 22:57:52,992 INFO L435 NwaCegarLoop]: 1624 mSDtfsCounter, 2210 mSDsluCounter, 1631 mSDsCounter, 0 mSdLazyCounter, 1242 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2213 SdHoareTripleChecker+Valid, 3255 SdHoareTripleChecker+Invalid, 1243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-07 22:57:52,992 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2213 Valid, 3255 Invalid, 1243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1242 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-07 22:57:52,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1512 states. [2025-02-07 22:57:53,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1512 to 1512. [2025-02-07 22:57:53,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1512 states, 1507 states have (on average 1.4877239548772396) internal successors, (2242), 1507 states have internal predecessors, (2242), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-07 22:57:53,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1512 states to 1512 states and 2248 transitions. [2025-02-07 22:57:53,008 INFO L78 Accepts]: Start accepts. Automaton has 1512 states and 2248 transitions. Word has length 353 [2025-02-07 22:57:53,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:57:53,009 INFO L471 AbstractCegarLoop]: Abstraction has 1512 states and 2248 transitions. [2025-02-07 22:57:53,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 68.2) internal successors, (341), 5 states have internal predecessors, (341), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:57:53,009 INFO L276 IsEmpty]: Start isEmpty. Operand 1512 states and 2248 transitions. [2025-02-07 22:57:53,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 355 [2025-02-07 22:57:53,013 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:57:53,013 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-07 22:57:53,014 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-07 22:57:53,014 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:57:53,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:57:53,014 INFO L85 PathProgramCache]: Analyzing trace with hash -977830319, now seen corresponding path program 1 times [2025-02-07 22:57:53,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:57:53,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838186978] [2025-02-07 22:57:53,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:57:53,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:57:53,089 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 354 statements into 1 equivalence classes. [2025-02-07 22:57:53,152 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 354 of 354 statements. [2025-02-07 22:57:53,152 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:57:53,152 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:57:53,470 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-07 22:57:53,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:57:53,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838186978] [2025-02-07 22:57:53,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838186978] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:57:53,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:57:53,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 22:57:53,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288937972] [2025-02-07 22:57:53,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:57:53,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:57:53,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:57:53,472 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:57:53,472 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:57:53,472 INFO L87 Difference]: Start difference. First operand 1512 states and 2248 transitions. Second operand has 5 states, 5 states have (on average 68.4) internal successors, (342), 5 states have internal predecessors, (342), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:57:54,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:57:54,253 INFO L93 Difference]: Finished difference Result 2731 states and 4057 transitions. [2025-02-07 22:57:54,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:57:54,253 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 68.4) internal successors, (342), 5 states have internal predecessors, (342), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 354 [2025-02-07 22:57:54,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:57:54,257 INFO L225 Difference]: With dead ends: 2731 [2025-02-07 22:57:54,257 INFO L226 Difference]: Without dead ends: 1512 [2025-02-07 22:57:54,258 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-02-07 22:57:54,258 INFO L435 NwaCegarLoop]: 1624 mSDtfsCounter, 2206 mSDsluCounter, 1631 mSDsCounter, 0 mSdLazyCounter, 1240 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2209 SdHoareTripleChecker+Valid, 3255 SdHoareTripleChecker+Invalid, 1241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-07 22:57:54,258 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2209 Valid, 3255 Invalid, 1241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1240 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-07 22:57:54,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1512 states. [2025-02-07 22:57:54,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1512 to 1512. [2025-02-07 22:57:54,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1512 states, 1507 states have (on average 1.4870603848706039) internal successors, (2241), 1507 states have internal predecessors, (2241), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-07 22:57:54,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1512 states to 1512 states and 2247 transitions. [2025-02-07 22:57:54,270 INFO L78 Accepts]: Start accepts. Automaton has 1512 states and 2247 transitions. Word has length 354 [2025-02-07 22:57:54,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:57:54,270 INFO L471 AbstractCegarLoop]: Abstraction has 1512 states and 2247 transitions. [2025-02-07 22:57:54,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 68.4) internal successors, (342), 5 states have internal predecessors, (342), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:57:54,270 INFO L276 IsEmpty]: Start isEmpty. Operand 1512 states and 2247 transitions. [2025-02-07 22:57:54,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 356 [2025-02-07 22:57:54,271 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:57:54,271 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-07 22:57:54,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-07 22:57:54,272 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:57:54,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:57:54,272 INFO L85 PathProgramCache]: Analyzing trace with hash 1668713315, now seen corresponding path program 1 times [2025-02-07 22:57:54,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:57:54,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862258772] [2025-02-07 22:57:54,272 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:57:54,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:57:54,338 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 355 statements into 1 equivalence classes. [2025-02-07 22:57:54,403 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 355 of 355 statements. [2025-02-07 22:57:54,403 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:57:54,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:57:54,654 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-07 22:57:54,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:57:54,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862258772] [2025-02-07 22:57:54,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862258772] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:57:54,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:57:54,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 22:57:54,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976183856] [2025-02-07 22:57:54,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:57:54,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:57:54,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:57:54,656 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:57:54,656 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:57:54,656 INFO L87 Difference]: Start difference. First operand 1512 states and 2247 transitions. Second operand has 5 states, 5 states have (on average 68.6) internal successors, (343), 5 states have internal predecessors, (343), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:57:55,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:57:55,419 INFO L93 Difference]: Finished difference Result 2731 states and 4055 transitions. [2025-02-07 22:57:55,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:57:55,419 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 68.6) internal successors, (343), 5 states have internal predecessors, (343), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 355 [2025-02-07 22:57:55,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:57:55,426 INFO L225 Difference]: With dead ends: 2731 [2025-02-07 22:57:55,426 INFO L226 Difference]: Without dead ends: 1512 [2025-02-07 22:57:55,427 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-02-07 22:57:55,428 INFO L435 NwaCegarLoop]: 1624 mSDtfsCounter, 4151 mSDsluCounter, 1625 mSDsCounter, 0 mSdLazyCounter, 1238 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4154 SdHoareTripleChecker+Valid, 3249 SdHoareTripleChecker+Invalid, 1239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-07 22:57:55,428 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4154 Valid, 3249 Invalid, 1239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1238 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-07 22:57:55,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1512 states. [2025-02-07 22:57:55,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1512 to 1512. [2025-02-07 22:57:55,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1512 states, 1507 states have (on average 1.4863968148639681) internal successors, (2240), 1507 states have internal predecessors, (2240), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-07 22:57:55,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1512 states to 1512 states and 2246 transitions. [2025-02-07 22:57:55,441 INFO L78 Accepts]: Start accepts. Automaton has 1512 states and 2246 transitions. Word has length 355 [2025-02-07 22:57:55,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:57:55,442 INFO L471 AbstractCegarLoop]: Abstraction has 1512 states and 2246 transitions. [2025-02-07 22:57:55,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 68.6) internal successors, (343), 5 states have internal predecessors, (343), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:57:55,442 INFO L276 IsEmpty]: Start isEmpty. Operand 1512 states and 2246 transitions. [2025-02-07 22:57:55,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 357 [2025-02-07 22:57:55,444 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:57:55,444 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-07 22:57:55,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-07 22:57:55,445 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:57:55,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:57:55,445 INFO L85 PathProgramCache]: Analyzing trace with hash -1712480938, now seen corresponding path program 1 times [2025-02-07 22:57:55,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:57:55,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504301960] [2025-02-07 22:57:55,445 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:57:55,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:57:55,508 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 356 statements into 1 equivalence classes. [2025-02-07 22:57:55,579 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 356 of 356 statements. [2025-02-07 22:57:55,580 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:57:55,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:57:55,877 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-07 22:57:55,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:57:55,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504301960] [2025-02-07 22:57:55,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504301960] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:57:55,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:57:55,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 22:57:55,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599763676] [2025-02-07 22:57:55,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:57:55,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:57:55,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:57:55,878 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:57:55,878 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:57:55,879 INFO L87 Difference]: Start difference. First operand 1512 states and 2246 transitions. Second operand has 5 states, 5 states have (on average 68.8) internal successors, (344), 5 states have internal predecessors, (344), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:57:56,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:57:56,479 INFO L93 Difference]: Finished difference Result 2731 states and 4053 transitions. [2025-02-07 22:57:56,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:57:56,480 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 68.8) internal successors, (344), 5 states have internal predecessors, (344), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 356 [2025-02-07 22:57:56,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:57:56,483 INFO L225 Difference]: With dead ends: 2731 [2025-02-07 22:57:56,483 INFO L226 Difference]: Without dead ends: 1512 [2025-02-07 22:57:56,484 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-02-07 22:57:56,485 INFO L435 NwaCegarLoop]: 1624 mSDtfsCounter, 2198 mSDsluCounter, 1631 mSDsCounter, 0 mSdLazyCounter, 1236 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2201 SdHoareTripleChecker+Valid, 3255 SdHoareTripleChecker+Invalid, 1237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-07 22:57:56,485 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2201 Valid, 3255 Invalid, 1237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1236 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-07 22:57:56,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1512 states. [2025-02-07 22:57:56,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1512 to 1512. [2025-02-07 22:57:56,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1512 states, 1507 states have (on average 1.4857332448573324) internal successors, (2239), 1507 states have internal predecessors, (2239), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-07 22:57:56,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1512 states to 1512 states and 2245 transitions. [2025-02-07 22:57:56,496 INFO L78 Accepts]: Start accepts. Automaton has 1512 states and 2245 transitions. Word has length 356 [2025-02-07 22:57:56,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:57:56,496 INFO L471 AbstractCegarLoop]: Abstraction has 1512 states and 2245 transitions. [2025-02-07 22:57:56,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 68.8) internal successors, (344), 5 states have internal predecessors, (344), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:57:56,496 INFO L276 IsEmpty]: Start isEmpty. Operand 1512 states and 2245 transitions. [2025-02-07 22:57:56,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 358 [2025-02-07 22:57:56,497 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:57:56,498 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-07 22:57:56,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-07 22:57:56,498 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:57:56,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:57:56,498 INFO L85 PathProgramCache]: Analyzing trace with hash 1287631816, now seen corresponding path program 1 times [2025-02-07 22:57:56,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:57:56,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808087609] [2025-02-07 22:57:56,499 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:57:56,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:57:56,564 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 357 statements into 1 equivalence classes. [2025-02-07 22:57:56,629 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 357 of 357 statements. [2025-02-07 22:57:56,629 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:57:56,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:57:56,898 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-07 22:57:56,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:57:56,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808087609] [2025-02-07 22:57:56,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808087609] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:57:56,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:57:56,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 22:57:56,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348685985] [2025-02-07 22:57:56,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:57:56,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:57:56,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:57:56,900 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:57:56,900 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:57:56,900 INFO L87 Difference]: Start difference. First operand 1512 states and 2245 transitions. Second operand has 5 states, 5 states have (on average 69.0) internal successors, (345), 5 states have internal predecessors, (345), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:57:57,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:57:57,540 INFO L93 Difference]: Finished difference Result 2731 states and 4051 transitions. [2025-02-07 22:57:57,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:57:57,540 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 69.0) internal successors, (345), 5 states have internal predecessors, (345), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 357 [2025-02-07 22:57:57,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:57:57,544 INFO L225 Difference]: With dead ends: 2731 [2025-02-07 22:57:57,544 INFO L226 Difference]: Without dead ends: 1512 [2025-02-07 22:57:57,545 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-02-07 22:57:57,545 INFO L435 NwaCegarLoop]: 1624 mSDtfsCounter, 2194 mSDsluCounter, 1631 mSDsCounter, 0 mSdLazyCounter, 1234 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2197 SdHoareTripleChecker+Valid, 3255 SdHoareTripleChecker+Invalid, 1235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-07 22:57:57,545 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2197 Valid, 3255 Invalid, 1235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1234 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-07 22:57:57,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1512 states. [2025-02-07 22:57:57,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1512 to 1512. [2025-02-07 22:57:57,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1512 states, 1507 states have (on average 1.4850696748506969) internal successors, (2238), 1507 states have internal predecessors, (2238), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-07 22:57:57,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1512 states to 1512 states and 2244 transitions. [2025-02-07 22:57:57,557 INFO L78 Accepts]: Start accepts. Automaton has 1512 states and 2244 transitions. Word has length 357 [2025-02-07 22:57:57,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:57:57,557 INFO L471 AbstractCegarLoop]: Abstraction has 1512 states and 2244 transitions. [2025-02-07 22:57:57,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 69.0) internal successors, (345), 5 states have internal predecessors, (345), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:57:57,558 INFO L276 IsEmpty]: Start isEmpty. Operand 1512 states and 2244 transitions. [2025-02-07 22:57:57,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 359 [2025-02-07 22:57:57,559 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:57:57,559 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-07 22:57:57,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-07 22:57:57,559 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:57:57,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:57:57,560 INFO L85 PathProgramCache]: Analyzing trace with hash 1826886363, now seen corresponding path program 1 times [2025-02-07 22:57:57,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:57:57,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987678164] [2025-02-07 22:57:57,560 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:57:57,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:57:57,676 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 358 statements into 1 equivalence classes. [2025-02-07 22:57:57,783 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 358 of 358 statements. [2025-02-07 22:57:57,784 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:57:57,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:57:58,135 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-07 22:57:58,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:57:58,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987678164] [2025-02-07 22:57:58,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987678164] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:57:58,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:57:58,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 22:57:58,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695659135] [2025-02-07 22:57:58,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:57:58,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:57:58,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:57:58,137 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:57:58,137 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:57:58,137 INFO L87 Difference]: Start difference. First operand 1512 states and 2244 transitions. Second operand has 5 states, 5 states have (on average 69.2) internal successors, (346), 5 states have internal predecessors, (346), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:57:58,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:57:58,750 INFO L93 Difference]: Finished difference Result 2731 states and 4049 transitions. [2025-02-07 22:57:58,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:57:58,750 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 69.2) internal successors, (346), 5 states have internal predecessors, (346), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 358 [2025-02-07 22:57:58,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:57:58,753 INFO L225 Difference]: With dead ends: 2731 [2025-02-07 22:57:58,753 INFO L226 Difference]: Without dead ends: 1512 [2025-02-07 22:57:58,754 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-02-07 22:57:58,754 INFO L435 NwaCegarLoop]: 1624 mSDtfsCounter, 2190 mSDsluCounter, 1631 mSDsCounter, 0 mSdLazyCounter, 1232 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2193 SdHoareTripleChecker+Valid, 3255 SdHoareTripleChecker+Invalid, 1233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-07 22:57:58,754 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2193 Valid, 3255 Invalid, 1233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1232 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-07 22:57:58,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1512 states. [2025-02-07 22:57:58,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1512 to 1512. [2025-02-07 22:57:58,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1512 states, 1507 states have (on average 1.484406104844061) internal successors, (2237), 1507 states have internal predecessors, (2237), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-07 22:57:58,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1512 states to 1512 states and 2243 transitions. [2025-02-07 22:57:58,765 INFO L78 Accepts]: Start accepts. Automaton has 1512 states and 2243 transitions. Word has length 358 [2025-02-07 22:57:58,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:57:58,765 INFO L471 AbstractCegarLoop]: Abstraction has 1512 states and 2243 transitions. [2025-02-07 22:57:58,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 69.2) internal successors, (346), 5 states have internal predecessors, (346), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:57:58,766 INFO L276 IsEmpty]: Start isEmpty. Operand 1512 states and 2243 transitions. [2025-02-07 22:57:58,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 360 [2025-02-07 22:57:58,767 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:57:58,767 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-07 22:57:58,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-07 22:57:58,767 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:57:58,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:57:58,768 INFO L85 PathProgramCache]: Analyzing trace with hash -220575059, now seen corresponding path program 1 times [2025-02-07 22:57:58,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:57:58,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005616064] [2025-02-07 22:57:58,768 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:57:58,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:57:58,837 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 359 statements into 1 equivalence classes. [2025-02-07 22:57:58,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 359 of 359 statements. [2025-02-07 22:57:58,905 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:57:58,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:57:59,176 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-07 22:57:59,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:57:59,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005616064] [2025-02-07 22:57:59,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005616064] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:57:59,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:57:59,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 22:57:59,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86216116] [2025-02-07 22:57:59,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:57:59,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:57:59,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:57:59,178 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:57:59,179 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:57:59,179 INFO L87 Difference]: Start difference. First operand 1512 states and 2243 transitions. Second operand has 5 states, 5 states have (on average 69.4) internal successors, (347), 5 states have internal predecessors, (347), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:57:59,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:57:59,842 INFO L93 Difference]: Finished difference Result 2731 states and 4047 transitions. [2025-02-07 22:57:59,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:57:59,842 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 69.4) internal successors, (347), 5 states have internal predecessors, (347), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 359 [2025-02-07 22:57:59,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:57:59,845 INFO L225 Difference]: With dead ends: 2731 [2025-02-07 22:57:59,845 INFO L226 Difference]: Without dead ends: 1512 [2025-02-07 22:57:59,846 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-02-07 22:57:59,847 INFO L435 NwaCegarLoop]: 1624 mSDtfsCounter, 2186 mSDsluCounter, 1631 mSDsCounter, 0 mSdLazyCounter, 1230 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2189 SdHoareTripleChecker+Valid, 3255 SdHoareTripleChecker+Invalid, 1231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-07 22:57:59,847 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2189 Valid, 3255 Invalid, 1231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1230 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-07 22:57:59,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1512 states. [2025-02-07 22:57:59,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1512 to 1512. [2025-02-07 22:57:59,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1512 states, 1507 states have (on average 1.4837425348374254) internal successors, (2236), 1507 states have internal predecessors, (2236), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-07 22:57:59,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1512 states to 1512 states and 2242 transitions. [2025-02-07 22:57:59,863 INFO L78 Accepts]: Start accepts. Automaton has 1512 states and 2242 transitions. Word has length 359 [2025-02-07 22:57:59,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:57:59,863 INFO L471 AbstractCegarLoop]: Abstraction has 1512 states and 2242 transitions. [2025-02-07 22:57:59,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 69.4) internal successors, (347), 5 states have internal predecessors, (347), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:57:59,863 INFO L276 IsEmpty]: Start isEmpty. Operand 1512 states and 2242 transitions. [2025-02-07 22:57:59,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 361 [2025-02-07 22:57:59,865 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:57:59,866 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-07 22:57:59,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-07 22:57:59,866 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:57:59,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:57:59,866 INFO L85 PathProgramCache]: Analyzing trace with hash -1342759200, now seen corresponding path program 1 times [2025-02-07 22:57:59,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:57:59,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883818490] [2025-02-07 22:57:59,867 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:57:59,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:57:59,966 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 360 statements into 1 equivalence classes. [2025-02-07 22:58:00,034 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 360 of 360 statements. [2025-02-07 22:58:00,034 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:58:00,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:58:00,290 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-07 22:58:00,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:58:00,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883818490] [2025-02-07 22:58:00,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883818490] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:58:00,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:58:00,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 22:58:00,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297067708] [2025-02-07 22:58:00,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:58:00,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:58:00,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:58:00,293 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:58:00,293 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:58:00,293 INFO L87 Difference]: Start difference. First operand 1512 states and 2242 transitions. Second operand has 5 states, 5 states have (on average 69.6) internal successors, (348), 5 states have internal predecessors, (348), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:58:00,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:58:00,894 INFO L93 Difference]: Finished difference Result 2731 states and 4045 transitions. [2025-02-07 22:58:00,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:58:00,897 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 69.6) internal successors, (348), 5 states have internal predecessors, (348), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 360 [2025-02-07 22:58:00,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:58:00,900 INFO L225 Difference]: With dead ends: 2731 [2025-02-07 22:58:00,900 INFO L226 Difference]: Without dead ends: 1512 [2025-02-07 22:58:00,901 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-02-07 22:58:00,902 INFO L435 NwaCegarLoop]: 1624 mSDtfsCounter, 4111 mSDsluCounter, 1625 mSDsCounter, 0 mSdLazyCounter, 1228 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4114 SdHoareTripleChecker+Valid, 3249 SdHoareTripleChecker+Invalid, 1229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-07 22:58:00,902 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4114 Valid, 3249 Invalid, 1229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1228 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-07 22:58:00,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1512 states. [2025-02-07 22:58:00,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1512 to 1512. [2025-02-07 22:58:00,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1512 states, 1507 states have (on average 1.4830789648307896) internal successors, (2235), 1507 states have internal predecessors, (2235), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-07 22:58:00,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1512 states to 1512 states and 2241 transitions. [2025-02-07 22:58:00,915 INFO L78 Accepts]: Start accepts. Automaton has 1512 states and 2241 transitions. Word has length 360 [2025-02-07 22:58:00,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:58:00,916 INFO L471 AbstractCegarLoop]: Abstraction has 1512 states and 2241 transitions. [2025-02-07 22:58:00,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 69.6) internal successors, (348), 5 states have internal predecessors, (348), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:58:00,916 INFO L276 IsEmpty]: Start isEmpty. Operand 1512 states and 2241 transitions. [2025-02-07 22:58:00,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 362 [2025-02-07 22:58:00,917 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:58:00,917 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-07 22:58:00,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-07 22:58:00,918 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:58:00,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:58:00,918 INFO L85 PathProgramCache]: Analyzing trace with hash 1806995474, now seen corresponding path program 1 times [2025-02-07 22:58:00,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:58:00,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670693361] [2025-02-07 22:58:00,918 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:58:00,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:58:00,993 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 361 statements into 1 equivalence classes. [2025-02-07 22:58:01,063 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 361 of 361 statements. [2025-02-07 22:58:01,063 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:58:01,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:58:01,329 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-07 22:58:01,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:58:01,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670693361] [2025-02-07 22:58:01,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670693361] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:58:01,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:58:01,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 22:58:01,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879399892] [2025-02-07 22:58:01,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:58:01,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:58:01,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:58:01,333 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:58:01,333 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:58:01,334 INFO L87 Difference]: Start difference. First operand 1512 states and 2241 transitions. Second operand has 5 states, 5 states have (on average 69.8) internal successors, (349), 5 states have internal predecessors, (349), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:58:02,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:58:02,115 INFO L93 Difference]: Finished difference Result 2731 states and 4043 transitions. [2025-02-07 22:58:02,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:58:02,115 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 69.8) internal successors, (349), 5 states have internal predecessors, (349), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 361 [2025-02-07 22:58:02,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:58:02,118 INFO L225 Difference]: With dead ends: 2731 [2025-02-07 22:58:02,118 INFO L226 Difference]: Without dead ends: 1512 [2025-02-07 22:58:02,119 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-02-07 22:58:02,119 INFO L435 NwaCegarLoop]: 1624 mSDtfsCounter, 2178 mSDsluCounter, 1631 mSDsCounter, 0 mSdLazyCounter, 1226 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2181 SdHoareTripleChecker+Valid, 3255 SdHoareTripleChecker+Invalid, 1227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-07 22:58:02,119 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2181 Valid, 3255 Invalid, 1227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1226 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-07 22:58:02,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1512 states. [2025-02-07 22:58:02,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1512 to 1512. [2025-02-07 22:58:02,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1512 states, 1507 states have (on average 1.4824153948241539) internal successors, (2234), 1507 states have internal predecessors, (2234), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-07 22:58:02,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1512 states to 1512 states and 2240 transitions. [2025-02-07 22:58:02,130 INFO L78 Accepts]: Start accepts. Automaton has 1512 states and 2240 transitions. Word has length 361 [2025-02-07 22:58:02,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:58:02,130 INFO L471 AbstractCegarLoop]: Abstraction has 1512 states and 2240 transitions. [2025-02-07 22:58:02,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 69.8) internal successors, (349), 5 states have internal predecessors, (349), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:58:02,130 INFO L276 IsEmpty]: Start isEmpty. Operand 1512 states and 2240 transitions. [2025-02-07 22:58:02,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 363 [2025-02-07 22:58:02,132 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:58:02,132 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-07 22:58:02,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-07 22:58:02,132 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:58:02,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:58:02,132 INFO L85 PathProgramCache]: Analyzing trace with hash 1969422693, now seen corresponding path program 1 times [2025-02-07 22:58:02,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:58:02,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060540678] [2025-02-07 22:58:02,133 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:58:02,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:58:02,229 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 362 statements into 1 equivalence classes. [2025-02-07 22:58:02,301 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 362 of 362 statements. [2025-02-07 22:58:02,301 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:58:02,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:58:02,578 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-07 22:58:02,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:58:02,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060540678] [2025-02-07 22:58:02,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060540678] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:58:02,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:58:02,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 22:58:02,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215609083] [2025-02-07 22:58:02,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:58:02,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:58:02,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:58:02,579 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:58:02,580 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:58:02,580 INFO L87 Difference]: Start difference. First operand 1512 states and 2240 transitions. Second operand has 5 states, 5 states have (on average 70.0) internal successors, (350), 5 states have internal predecessors, (350), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:58:03,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:58:03,176 INFO L93 Difference]: Finished difference Result 2731 states and 4041 transitions. [2025-02-07 22:58:03,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:58:03,177 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 70.0) internal successors, (350), 5 states have internal predecessors, (350), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 362 [2025-02-07 22:58:03,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:58:03,179 INFO L225 Difference]: With dead ends: 2731 [2025-02-07 22:58:03,179 INFO L226 Difference]: Without dead ends: 1512 [2025-02-07 22:58:03,180 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-02-07 22:58:03,180 INFO L435 NwaCegarLoop]: 1624 mSDtfsCounter, 4095 mSDsluCounter, 1625 mSDsCounter, 0 mSdLazyCounter, 1224 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4098 SdHoareTripleChecker+Valid, 3249 SdHoareTripleChecker+Invalid, 1225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-07 22:58:03,180 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4098 Valid, 3249 Invalid, 1225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1224 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-07 22:58:03,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1512 states. [2025-02-07 22:58:03,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1512 to 1512. [2025-02-07 22:58:03,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1512 states, 1507 states have (on average 1.4817518248175183) internal successors, (2233), 1507 states have internal predecessors, (2233), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-07 22:58:03,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1512 states to 1512 states and 2239 transitions. [2025-02-07 22:58:03,193 INFO L78 Accepts]: Start accepts. Automaton has 1512 states and 2239 transitions. Word has length 362 [2025-02-07 22:58:03,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:58:03,193 INFO L471 AbstractCegarLoop]: Abstraction has 1512 states and 2239 transitions. [2025-02-07 22:58:03,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 70.0) internal successors, (350), 5 states have internal predecessors, (350), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:58:03,193 INFO L276 IsEmpty]: Start isEmpty. Operand 1512 states and 2239 transitions. [2025-02-07 22:58:03,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 364 [2025-02-07 22:58:03,195 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:58:03,195 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-07 22:58:03,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-07 22:58:03,195 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:58:03,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:58:03,196 INFO L85 PathProgramCache]: Analyzing trace with hash -1919106057, now seen corresponding path program 1 times [2025-02-07 22:58:03,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:58:03,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139492421] [2025-02-07 22:58:03,196 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:58:03,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:58:03,260 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 363 statements into 1 equivalence classes. [2025-02-07 22:58:03,334 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 363 of 363 statements. [2025-02-07 22:58:03,334 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:58:03,334 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:58:03,612 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-07 22:58:03,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:58:03,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139492421] [2025-02-07 22:58:03,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139492421] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:58:03,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:58:03,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 22:58:03,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978538227] [2025-02-07 22:58:03,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:58:03,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:58:03,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:58:03,614 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:58:03,614 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:58:03,615 INFO L87 Difference]: Start difference. First operand 1512 states and 2239 transitions. Second operand has 5 states, 5 states have (on average 70.2) internal successors, (351), 5 states have internal predecessors, (351), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:58:04,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:58:04,210 INFO L93 Difference]: Finished difference Result 2731 states and 4039 transitions. [2025-02-07 22:58:04,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:58:04,211 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 70.2) internal successors, (351), 5 states have internal predecessors, (351), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 363 [2025-02-07 22:58:04,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:58:04,213 INFO L225 Difference]: With dead ends: 2731 [2025-02-07 22:58:04,213 INFO L226 Difference]: Without dead ends: 1512 [2025-02-07 22:58:04,214 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-02-07 22:58:04,215 INFO L435 NwaCegarLoop]: 1624 mSDtfsCounter, 2170 mSDsluCounter, 1631 mSDsCounter, 0 mSdLazyCounter, 1222 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2173 SdHoareTripleChecker+Valid, 3255 SdHoareTripleChecker+Invalid, 1223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-07 22:58:04,215 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2173 Valid, 3255 Invalid, 1223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1222 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-07 22:58:04,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1512 states. [2025-02-07 22:58:04,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1512 to 1512. [2025-02-07 22:58:04,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1512 states, 1507 states have (on average 1.4810882548108826) internal successors, (2232), 1507 states have internal predecessors, (2232), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-07 22:58:04,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1512 states to 1512 states and 2238 transitions. [2025-02-07 22:58:04,228 INFO L78 Accepts]: Start accepts. Automaton has 1512 states and 2238 transitions. Word has length 363 [2025-02-07 22:58:04,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:58:04,228 INFO L471 AbstractCegarLoop]: Abstraction has 1512 states and 2238 transitions. [2025-02-07 22:58:04,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 70.2) internal successors, (351), 5 states have internal predecessors, (351), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:58:04,229 INFO L276 IsEmpty]: Start isEmpty. Operand 1512 states and 2238 transitions. [2025-02-07 22:58:04,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 365 [2025-02-07 22:58:04,230 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:58:04,230 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-07 22:58:04,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-02-07 22:58:04,231 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:58:04,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:58:04,231 INFO L85 PathProgramCache]: Analyzing trace with hash -1337722262, now seen corresponding path program 1 times [2025-02-07 22:58:04,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:58:04,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182503317] [2025-02-07 22:58:04,232 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:58:04,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:58:04,310 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 364 statements into 1 equivalence classes. [2025-02-07 22:58:04,383 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 364 of 364 statements. [2025-02-07 22:58:04,384 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:58:04,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:58:04,687 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-07 22:58:04,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:58:04,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182503317] [2025-02-07 22:58:04,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182503317] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:58:04,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:58:04,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 22:58:04,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106494031] [2025-02-07 22:58:04,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:58:04,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:58:04,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:58:04,689 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:58:04,689 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:58:04,689 INFO L87 Difference]: Start difference. First operand 1512 states and 2238 transitions. Second operand has 5 states, 5 states have (on average 70.4) internal successors, (352), 5 states have internal predecessors, (352), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:58:05,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:58:05,459 INFO L93 Difference]: Finished difference Result 2731 states and 4037 transitions. [2025-02-07 22:58:05,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:58:05,459 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 70.4) internal successors, (352), 5 states have internal predecessors, (352), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 364 [2025-02-07 22:58:05,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:58:05,461 INFO L225 Difference]: With dead ends: 2731 [2025-02-07 22:58:05,461 INFO L226 Difference]: Without dead ends: 1512 [2025-02-07 22:58:05,462 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-02-07 22:58:05,462 INFO L435 NwaCegarLoop]: 1624 mSDtfsCounter, 2166 mSDsluCounter, 1631 mSDsCounter, 0 mSdLazyCounter, 1220 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2169 SdHoareTripleChecker+Valid, 3255 SdHoareTripleChecker+Invalid, 1221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-07 22:58:05,463 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2169 Valid, 3255 Invalid, 1221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1220 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-07 22:58:05,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1512 states. [2025-02-07 22:58:05,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1512 to 1512. [2025-02-07 22:58:05,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1512 states, 1507 states have (on average 1.4804246848042468) internal successors, (2231), 1507 states have internal predecessors, (2231), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-07 22:58:05,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1512 states to 1512 states and 2237 transitions. [2025-02-07 22:58:05,473 INFO L78 Accepts]: Start accepts. Automaton has 1512 states and 2237 transitions. Word has length 364 [2025-02-07 22:58:05,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:58:05,473 INFO L471 AbstractCegarLoop]: Abstraction has 1512 states and 2237 transitions. [2025-02-07 22:58:05,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 70.4) internal successors, (352), 5 states have internal predecessors, (352), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:58:05,473 INFO L276 IsEmpty]: Start isEmpty. Operand 1512 states and 2237 transitions. [2025-02-07 22:58:05,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 366 [2025-02-07 22:58:05,474 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:58:05,474 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-07 22:58:05,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-02-07 22:58:05,474 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:58:05,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:58:05,475 INFO L85 PathProgramCache]: Analyzing trace with hash 1329669724, now seen corresponding path program 1 times [2025-02-07 22:58:05,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:58:05,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151038262] [2025-02-07 22:58:05,475 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:58:05,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:58:05,551 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 365 statements into 1 equivalence classes. [2025-02-07 22:58:05,625 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 365 of 365 statements. [2025-02-07 22:58:05,625 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:58:05,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:58:05,904 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-07 22:58:05,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:58:05,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151038262] [2025-02-07 22:58:05,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151038262] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:58:05,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:58:05,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 22:58:05,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759281349] [2025-02-07 22:58:05,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:58:05,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:58:05,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:58:05,906 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:58:05,906 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:58:05,906 INFO L87 Difference]: Start difference. First operand 1512 states and 2237 transitions. Second operand has 5 states, 5 states have (on average 70.6) internal successors, (353), 5 states have internal predecessors, (353), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:58:06,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:58:06,584 INFO L93 Difference]: Finished difference Result 2731 states and 4035 transitions. [2025-02-07 22:58:06,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:58:06,584 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 70.6) internal successors, (353), 5 states have internal predecessors, (353), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 365 [2025-02-07 22:58:06,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:58:06,586 INFO L225 Difference]: With dead ends: 2731 [2025-02-07 22:58:06,586 INFO L226 Difference]: Without dead ends: 1512 [2025-02-07 22:58:06,587 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-02-07 22:58:06,587 INFO L435 NwaCegarLoop]: 1624 mSDtfsCounter, 4071 mSDsluCounter, 1625 mSDsCounter, 0 mSdLazyCounter, 1218 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4074 SdHoareTripleChecker+Valid, 3249 SdHoareTripleChecker+Invalid, 1219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-07 22:58:06,587 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4074 Valid, 3249 Invalid, 1219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1218 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-07 22:58:06,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1512 states. [2025-02-07 22:58:06,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1512 to 1512. [2025-02-07 22:58:06,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1512 states, 1507 states have (on average 1.479761114797611) internal successors, (2230), 1507 states have internal predecessors, (2230), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-07 22:58:06,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1512 states to 1512 states and 2236 transitions. [2025-02-07 22:58:06,604 INFO L78 Accepts]: Start accepts. Automaton has 1512 states and 2236 transitions. Word has length 365 [2025-02-07 22:58:06,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:58:06,604 INFO L471 AbstractCegarLoop]: Abstraction has 1512 states and 2236 transitions. [2025-02-07 22:58:06,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 70.6) internal successors, (353), 5 states have internal predecessors, (353), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:58:06,604 INFO L276 IsEmpty]: Start isEmpty. Operand 1512 states and 2236 transitions. [2025-02-07 22:58:06,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 367 [2025-02-07 22:58:06,605 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:58:06,606 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-07 22:58:06,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-02-07 22:58:06,606 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:58:06,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:58:06,607 INFO L85 PathProgramCache]: Analyzing trace with hash 1956006383, now seen corresponding path program 1 times [2025-02-07 22:58:06,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:58:06,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18457370] [2025-02-07 22:58:06,607 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:58:06,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:58:06,676 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 366 statements into 1 equivalence classes. [2025-02-07 22:58:06,746 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 366 of 366 statements. [2025-02-07 22:58:06,746 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:58:06,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:58:07,105 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-07 22:58:07,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:58:07,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18457370] [2025-02-07 22:58:07,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18457370] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:58:07,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:58:07,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 22:58:07,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254620997] [2025-02-07 22:58:07,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:58:07,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:58:07,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:58:07,107 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:58:07,107 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:58:07,107 INFO L87 Difference]: Start difference. First operand 1512 states and 2236 transitions. Second operand has 5 states, 5 states have (on average 70.8) internal successors, (354), 5 states have internal predecessors, (354), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:58:07,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:58:07,796 INFO L93 Difference]: Finished difference Result 2731 states and 4033 transitions. [2025-02-07 22:58:07,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:58:07,796 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 70.8) internal successors, (354), 5 states have internal predecessors, (354), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 366 [2025-02-07 22:58:07,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:58:07,798 INFO L225 Difference]: With dead ends: 2731 [2025-02-07 22:58:07,802 INFO L226 Difference]: Without dead ends: 1512 [2025-02-07 22:58:07,803 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-02-07 22:58:07,804 INFO L435 NwaCegarLoop]: 1624 mSDtfsCounter, 4063 mSDsluCounter, 1625 mSDsCounter, 0 mSdLazyCounter, 1216 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4066 SdHoareTripleChecker+Valid, 3249 SdHoareTripleChecker+Invalid, 1217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-07 22:58:07,804 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4066 Valid, 3249 Invalid, 1217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1216 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-07 22:58:07,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1512 states. [2025-02-07 22:58:07,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1512 to 1512. [2025-02-07 22:58:07,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1512 states, 1507 states have (on average 1.4790975447909755) internal successors, (2229), 1507 states have internal predecessors, (2229), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-07 22:58:07,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1512 states to 1512 states and 2235 transitions. [2025-02-07 22:58:07,829 INFO L78 Accepts]: Start accepts. Automaton has 1512 states and 2235 transitions. Word has length 366 [2025-02-07 22:58:07,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:58:07,829 INFO L471 AbstractCegarLoop]: Abstraction has 1512 states and 2235 transitions. [2025-02-07 22:58:07,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 70.8) internal successors, (354), 5 states have internal predecessors, (354), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:58:07,829 INFO L276 IsEmpty]: Start isEmpty. Operand 1512 states and 2235 transitions. [2025-02-07 22:58:07,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 368 [2025-02-07 22:58:07,834 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:58:07,835 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-07 22:58:07,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-02-07 22:58:07,835 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:58:07,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:58:07,835 INFO L85 PathProgramCache]: Analyzing trace with hash 665843521, now seen corresponding path program 1 times [2025-02-07 22:58:07,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:58:07,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036325231] [2025-02-07 22:58:07,835 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:58:07,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:58:08,053 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 367 statements into 1 equivalence classes. [2025-02-07 22:58:08,203 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 367 of 367 statements. [2025-02-07 22:58:08,203 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:58:08,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:58:08,504 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-07 22:58:08,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:58:08,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036325231] [2025-02-07 22:58:08,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036325231] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:58:08,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:58:08,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 22:58:08,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852109555] [2025-02-07 22:58:08,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:58:08,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:58:08,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:58:08,505 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:58:08,505 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:58:08,506 INFO L87 Difference]: Start difference. First operand 1512 states and 2235 transitions. Second operand has 5 states, 5 states have (on average 71.0) internal successors, (355), 5 states have internal predecessors, (355), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:58:09,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:58:09,176 INFO L93 Difference]: Finished difference Result 2731 states and 4031 transitions. [2025-02-07 22:58:09,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:58:09,177 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 71.0) internal successors, (355), 5 states have internal predecessors, (355), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 367 [2025-02-07 22:58:09,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:58:09,179 INFO L225 Difference]: With dead ends: 2731 [2025-02-07 22:58:09,179 INFO L226 Difference]: Without dead ends: 1512 [2025-02-07 22:58:09,180 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-02-07 22:58:09,180 INFO L435 NwaCegarLoop]: 1624 mSDtfsCounter, 4055 mSDsluCounter, 1625 mSDsCounter, 0 mSdLazyCounter, 1214 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4058 SdHoareTripleChecker+Valid, 3249 SdHoareTripleChecker+Invalid, 1215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-07 22:58:09,180 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4058 Valid, 3249 Invalid, 1215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1214 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-07 22:58:09,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1512 states. [2025-02-07 22:58:09,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1512 to 1512. [2025-02-07 22:58:09,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1512 states, 1507 states have (on average 1.4784339747843398) internal successors, (2228), 1507 states have internal predecessors, (2228), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-07 22:58:09,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1512 states to 1512 states and 2234 transitions. [2025-02-07 22:58:09,190 INFO L78 Accepts]: Start accepts. Automaton has 1512 states and 2234 transitions. Word has length 367 [2025-02-07 22:58:09,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:58:09,190 INFO L471 AbstractCegarLoop]: Abstraction has 1512 states and 2234 transitions. [2025-02-07 22:58:09,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 71.0) internal successors, (355), 5 states have internal predecessors, (355), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:58:09,191 INFO L276 IsEmpty]: Start isEmpty. Operand 1512 states and 2234 transitions. [2025-02-07 22:58:09,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 369 [2025-02-07 22:58:09,192 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:58:09,192 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-07 22:58:09,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-02-07 22:58:09,192 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:58:09,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:58:09,193 INFO L85 PathProgramCache]: Analyzing trace with hash 926298100, now seen corresponding path program 1 times [2025-02-07 22:58:09,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:58:09,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858947663] [2025-02-07 22:58:09,193 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:58:09,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:58:09,264 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 368 statements into 1 equivalence classes. [2025-02-07 22:58:09,340 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 368 of 368 statements. [2025-02-07 22:58:09,341 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:58:09,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:58:09,602 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-07 22:58:09,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:58:09,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858947663] [2025-02-07 22:58:09,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858947663] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:58:09,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:58:09,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 22:58:09,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322662410] [2025-02-07 22:58:09,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:58:09,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:58:09,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:58:09,603 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:58:09,603 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:58:09,604 INFO L87 Difference]: Start difference. First operand 1512 states and 2234 transitions. Second operand has 5 states, 5 states have (on average 71.2) internal successors, (356), 5 states have internal predecessors, (356), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:58:10,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:58:10,298 INFO L93 Difference]: Finished difference Result 2731 states and 4029 transitions. [2025-02-07 22:58:10,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:58:10,298 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 71.2) internal successors, (356), 5 states have internal predecessors, (356), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 368 [2025-02-07 22:58:10,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:58:10,304 INFO L225 Difference]: With dead ends: 2731 [2025-02-07 22:58:10,304 INFO L226 Difference]: Without dead ends: 1512 [2025-02-07 22:58:10,305 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-02-07 22:58:10,306 INFO L435 NwaCegarLoop]: 1624 mSDtfsCounter, 2150 mSDsluCounter, 1631 mSDsCounter, 0 mSdLazyCounter, 1212 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2153 SdHoareTripleChecker+Valid, 3255 SdHoareTripleChecker+Invalid, 1213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-07 22:58:10,306 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2153 Valid, 3255 Invalid, 1213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1212 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-07 22:58:10,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1512 states. [2025-02-07 22:58:10,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1512 to 1512. [2025-02-07 22:58:10,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1512 states, 1507 states have (on average 1.477770404777704) internal successors, (2227), 1507 states have internal predecessors, (2227), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-07 22:58:10,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1512 states to 1512 states and 2233 transitions. [2025-02-07 22:58:10,324 INFO L78 Accepts]: Start accepts. Automaton has 1512 states and 2233 transitions. Word has length 368 [2025-02-07 22:58:10,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:58:10,324 INFO L471 AbstractCegarLoop]: Abstraction has 1512 states and 2233 transitions. [2025-02-07 22:58:10,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 71.2) internal successors, (356), 5 states have internal predecessors, (356), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:58:10,324 INFO L276 IsEmpty]: Start isEmpty. Operand 1512 states and 2233 transitions. [2025-02-07 22:58:10,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 370 [2025-02-07 22:58:10,325 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:58:10,326 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-07 22:58:10,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-02-07 22:58:10,326 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:58:10,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:58:10,326 INFO L85 PathProgramCache]: Analyzing trace with hash 1851225766, now seen corresponding path program 1 times [2025-02-07 22:58:10,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:58:10,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554454316] [2025-02-07 22:58:10,326 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:58:10,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:58:10,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 369 statements into 1 equivalence classes. [2025-02-07 22:58:10,472 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 369 of 369 statements. [2025-02-07 22:58:10,472 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:58:10,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:58:10,768 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-07 22:58:10,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:58:10,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554454316] [2025-02-07 22:58:10,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554454316] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:58:10,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:58:10,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 22:58:10,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625260239] [2025-02-07 22:58:10,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:58:10,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:58:10,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:58:10,769 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:58:10,769 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:58:10,770 INFO L87 Difference]: Start difference. First operand 1512 states and 2233 transitions. Second operand has 5 states, 5 states have (on average 71.4) internal successors, (357), 5 states have internal predecessors, (357), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:58:11,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:58:11,356 INFO L93 Difference]: Finished difference Result 2731 states and 4027 transitions. [2025-02-07 22:58:11,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:58:11,356 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 71.4) internal successors, (357), 5 states have internal predecessors, (357), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 369 [2025-02-07 22:58:11,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:58:11,358 INFO L225 Difference]: With dead ends: 2731 [2025-02-07 22:58:11,358 INFO L226 Difference]: Without dead ends: 1512 [2025-02-07 22:58:11,359 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-02-07 22:58:11,359 INFO L435 NwaCegarLoop]: 1624 mSDtfsCounter, 4039 mSDsluCounter, 1625 mSDsCounter, 0 mSdLazyCounter, 1210 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4042 SdHoareTripleChecker+Valid, 3249 SdHoareTripleChecker+Invalid, 1211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-07 22:58:11,360 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4042 Valid, 3249 Invalid, 1211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1210 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-07 22:58:11,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1512 states. [2025-02-07 22:58:11,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1512 to 1512. [2025-02-07 22:58:11,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1512 states, 1507 states have (on average 1.4771068347710683) internal successors, (2226), 1507 states have internal predecessors, (2226), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-07 22:58:11,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1512 states to 1512 states and 2232 transitions. [2025-02-07 22:58:11,369 INFO L78 Accepts]: Start accepts. Automaton has 1512 states and 2232 transitions. Word has length 369 [2025-02-07 22:58:11,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:58:11,371 INFO L471 AbstractCegarLoop]: Abstraction has 1512 states and 2232 transitions. [2025-02-07 22:58:11,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 71.4) internal successors, (357), 5 states have internal predecessors, (357), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:58:11,371 INFO L276 IsEmpty]: Start isEmpty. Operand 1512 states and 2232 transitions. [2025-02-07 22:58:11,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 371 [2025-02-07 22:58:11,372 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:58:11,372 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-07 22:58:11,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-02-07 22:58:11,372 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:58:11,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:58:11,373 INFO L85 PathProgramCache]: Analyzing trace with hash 232778873, now seen corresponding path program 1 times [2025-02-07 22:58:11,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:58:11,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205114694] [2025-02-07 22:58:11,373 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:58:11,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:58:11,446 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 370 statements into 1 equivalence classes. [2025-02-07 22:58:11,521 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 370 of 370 statements. [2025-02-07 22:58:11,521 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:58:11,521 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:58:11,785 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-07 22:58:11,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:58:11,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205114694] [2025-02-07 22:58:11,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205114694] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:58:11,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:58:11,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 22:58:11,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934941731] [2025-02-07 22:58:11,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:58:11,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:58:11,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:58:11,786 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:58:11,786 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:58:11,787 INFO L87 Difference]: Start difference. First operand 1512 states and 2232 transitions. Second operand has 5 states, 5 states have (on average 71.6) internal successors, (358), 5 states have internal predecessors, (358), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:58:12,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:58:12,398 INFO L93 Difference]: Finished difference Result 2731 states and 4025 transitions. [2025-02-07 22:58:12,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:58:12,399 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 71.6) internal successors, (358), 5 states have internal predecessors, (358), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 370 [2025-02-07 22:58:12,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:58:12,401 INFO L225 Difference]: With dead ends: 2731 [2025-02-07 22:58:12,401 INFO L226 Difference]: Without dead ends: 1512 [2025-02-07 22:58:12,402 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-02-07 22:58:12,403 INFO L435 NwaCegarLoop]: 1624 mSDtfsCounter, 4025 mSDsluCounter, 1625 mSDsCounter, 0 mSdLazyCounter, 1208 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4028 SdHoareTripleChecker+Valid, 3249 SdHoareTripleChecker+Invalid, 1209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-07 22:58:12,403 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4028 Valid, 3249 Invalid, 1209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1208 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-07 22:58:12,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1512 states. [2025-02-07 22:58:12,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1512 to 1512. [2025-02-07 22:58:12,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1512 states, 1507 states have (on average 1.4764432647644326) internal successors, (2225), 1507 states have internal predecessors, (2225), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-07 22:58:12,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1512 states to 1512 states and 2231 transitions. [2025-02-07 22:58:12,416 INFO L78 Accepts]: Start accepts. Automaton has 1512 states and 2231 transitions. Word has length 370 [2025-02-07 22:58:12,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:58:12,417 INFO L471 AbstractCegarLoop]: Abstraction has 1512 states and 2231 transitions. [2025-02-07 22:58:12,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 71.6) internal successors, (358), 5 states have internal predecessors, (358), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:58:12,417 INFO L276 IsEmpty]: Start isEmpty. Operand 1512 states and 2231 transitions. [2025-02-07 22:58:12,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 372 [2025-02-07 22:58:12,418 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:58:12,419 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-07 22:58:12,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-02-07 22:58:12,419 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:58:12,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:58:12,419 INFO L85 PathProgramCache]: Analyzing trace with hash 1785030438, now seen corresponding path program 1 times [2025-02-07 22:58:12,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:58:12,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589179632] [2025-02-07 22:58:12,419 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:58:12,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:58:12,511 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 371 statements into 1 equivalence classes. [2025-02-07 22:58:12,587 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 371 of 371 statements. [2025-02-07 22:58:12,587 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:58:12,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:58:12,888 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-07 22:58:12,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:58:12,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589179632] [2025-02-07 22:58:12,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589179632] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:58:12,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:58:12,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 22:58:12,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170888117] [2025-02-07 22:58:12,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:58:12,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:58:12,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:58:12,889 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:58:12,889 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:58:12,889 INFO L87 Difference]: Start difference. First operand 1512 states and 2231 transitions. Second operand has 5 states, 5 states have (on average 71.8) internal successors, (359), 5 states have internal predecessors, (359), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:58:13,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:58:13,647 INFO L93 Difference]: Finished difference Result 2731 states and 4023 transitions. [2025-02-07 22:58:13,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:58:13,647 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 71.8) internal successors, (359), 5 states have internal predecessors, (359), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 371 [2025-02-07 22:58:13,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:58:13,650 INFO L225 Difference]: With dead ends: 2731 [2025-02-07 22:58:13,650 INFO L226 Difference]: Without dead ends: 1512 [2025-02-07 22:58:13,651 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-02-07 22:58:13,651 INFO L435 NwaCegarLoop]: 1624 mSDtfsCounter, 2135 mSDsluCounter, 1631 mSDsCounter, 0 mSdLazyCounter, 1206 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2138 SdHoareTripleChecker+Valid, 3255 SdHoareTripleChecker+Invalid, 1207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-07 22:58:13,651 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2138 Valid, 3255 Invalid, 1207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1206 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-07 22:58:13,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1512 states. [2025-02-07 22:58:13,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1512 to 1512. [2025-02-07 22:58:13,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1512 states, 1507 states have (on average 1.475779694757797) internal successors, (2224), 1507 states have internal predecessors, (2224), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-07 22:58:13,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1512 states to 1512 states and 2230 transitions. [2025-02-07 22:58:13,661 INFO L78 Accepts]: Start accepts. Automaton has 1512 states and 2230 transitions. Word has length 371 [2025-02-07 22:58:13,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:58:13,662 INFO L471 AbstractCegarLoop]: Abstraction has 1512 states and 2230 transitions. [2025-02-07 22:58:13,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 71.8) internal successors, (359), 5 states have internal predecessors, (359), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:58:13,662 INFO L276 IsEmpty]: Start isEmpty. Operand 1512 states and 2230 transitions. [2025-02-07 22:58:13,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2025-02-07 22:58:13,663 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:58:13,663 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-07 22:58:13,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-02-07 22:58:13,664 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:58:13,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:58:13,664 INFO L85 PathProgramCache]: Analyzing trace with hash -107696268, now seen corresponding path program 1 times [2025-02-07 22:58:13,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:58:13,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659616183] [2025-02-07 22:58:13,664 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:58:13,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:58:13,739 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 372 statements into 1 equivalence classes. [2025-02-07 22:58:13,817 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 372 of 372 statements. [2025-02-07 22:58:13,817 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:58:13,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:58:14,094 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-07 22:58:14,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:58:14,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659616183] [2025-02-07 22:58:14,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659616183] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:58:14,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:58:14,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 22:58:14,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827111730] [2025-02-07 22:58:14,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:58:14,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:58:14,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:58:14,096 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:58:14,096 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:58:14,096 INFO L87 Difference]: Start difference. First operand 1512 states and 2230 transitions. Second operand has 5 states, 5 states have (on average 72.0) internal successors, (360), 5 states have internal predecessors, (360), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:58:14,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:58:14,853 INFO L93 Difference]: Finished difference Result 2731 states and 4021 transitions. [2025-02-07 22:58:14,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:58:14,854 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 72.0) internal successors, (360), 5 states have internal predecessors, (360), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 372 [2025-02-07 22:58:14,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:58:14,855 INFO L225 Difference]: With dead ends: 2731 [2025-02-07 22:58:14,855 INFO L226 Difference]: Without dead ends: 1512 [2025-02-07 22:58:14,856 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-02-07 22:58:14,857 INFO L435 NwaCegarLoop]: 1624 mSDtfsCounter, 4009 mSDsluCounter, 1625 mSDsCounter, 0 mSdLazyCounter, 1204 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4012 SdHoareTripleChecker+Valid, 3249 SdHoareTripleChecker+Invalid, 1205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-07 22:58:14,857 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4012 Valid, 3249 Invalid, 1205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1204 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-07 22:58:14,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1512 states. [2025-02-07 22:58:14,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1512 to 1512. [2025-02-07 22:58:14,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1512 states, 1507 states have (on average 1.4751161247511613) internal successors, (2223), 1507 states have internal predecessors, (2223), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-07 22:58:14,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1512 states to 1512 states and 2229 transitions. [2025-02-07 22:58:14,867 INFO L78 Accepts]: Start accepts. Automaton has 1512 states and 2229 transitions. Word has length 372 [2025-02-07 22:58:14,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:58:14,867 INFO L471 AbstractCegarLoop]: Abstraction has 1512 states and 2229 transitions. [2025-02-07 22:58:14,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 72.0) internal successors, (360), 5 states have internal predecessors, (360), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:58:14,868 INFO L276 IsEmpty]: Start isEmpty. Operand 1512 states and 2229 transitions. [2025-02-07 22:58:14,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 374 [2025-02-07 22:58:14,869 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:58:14,869 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-07 22:58:14,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-02-07 22:58:14,869 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:58:14,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:58:14,870 INFO L85 PathProgramCache]: Analyzing trace with hash 955611393, now seen corresponding path program 1 times [2025-02-07 22:58:14,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:58:14,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919790654] [2025-02-07 22:58:14,870 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:58:14,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:58:14,940 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 373 statements into 1 equivalence classes. [2025-02-07 22:58:15,017 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 373 of 373 statements. [2025-02-07 22:58:15,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:58:15,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:58:15,318 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-07 22:58:15,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:58:15,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919790654] [2025-02-07 22:58:15,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919790654] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:58:15,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:58:15,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 22:58:15,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482409361] [2025-02-07 22:58:15,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:58:15,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:58:15,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:58:15,319 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:58:15,319 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:58:15,320 INFO L87 Difference]: Start difference. First operand 1512 states and 2229 transitions. Second operand has 5 states, 5 states have (on average 72.2) internal successors, (361), 5 states have internal predecessors, (361), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:58:16,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:58:16,075 INFO L93 Difference]: Finished difference Result 2731 states and 4019 transitions. [2025-02-07 22:58:16,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:58:16,075 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 72.2) internal successors, (361), 5 states have internal predecessors, (361), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 373 [2025-02-07 22:58:16,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:58:16,077 INFO L225 Difference]: With dead ends: 2731 [2025-02-07 22:58:16,077 INFO L226 Difference]: Without dead ends: 1512 [2025-02-07 22:58:16,078 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-02-07 22:58:16,078 INFO L435 NwaCegarLoop]: 1624 mSDtfsCounter, 4001 mSDsluCounter, 1625 mSDsCounter, 0 mSdLazyCounter, 1202 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4004 SdHoareTripleChecker+Valid, 3249 SdHoareTripleChecker+Invalid, 1203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-07 22:58:16,078 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4004 Valid, 3249 Invalid, 1203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1202 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-07 22:58:16,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1512 states. [2025-02-07 22:58:16,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1512 to 1512. [2025-02-07 22:58:16,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1512 states, 1507 states have (on average 1.4744525547445255) internal successors, (2222), 1507 states have internal predecessors, (2222), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-07 22:58:16,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1512 states to 1512 states and 2228 transitions. [2025-02-07 22:58:16,088 INFO L78 Accepts]: Start accepts. Automaton has 1512 states and 2228 transitions. Word has length 373 [2025-02-07 22:58:16,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:58:16,089 INFO L471 AbstractCegarLoop]: Abstraction has 1512 states and 2228 transitions. [2025-02-07 22:58:16,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 72.2) internal successors, (361), 5 states have internal predecessors, (361), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:58:16,089 INFO L276 IsEmpty]: Start isEmpty. Operand 1512 states and 2228 transitions. [2025-02-07 22:58:16,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 375 [2025-02-07 22:58:16,090 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:58:16,090 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-07 22:58:16,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-02-07 22:58:16,090 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:58:16,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:58:16,091 INFO L85 PathProgramCache]: Analyzing trace with hash -383896593, now seen corresponding path program 1 times [2025-02-07 22:58:16,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:58:16,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273909662] [2025-02-07 22:58:16,091 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:58:16,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:58:16,159 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 374 statements into 1 equivalence classes. [2025-02-07 22:58:16,237 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 374 of 374 statements. [2025-02-07 22:58:16,238 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:58:16,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:58:16,501 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-07 22:58:16,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:58:16,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273909662] [2025-02-07 22:58:16,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273909662] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:58:16,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:58:16,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 22:58:16,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407163346] [2025-02-07 22:58:16,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:58:16,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:58:16,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:58:16,503 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:58:16,503 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:58:16,503 INFO L87 Difference]: Start difference. First operand 1512 states and 2228 transitions. Second operand has 5 states, 5 states have (on average 72.4) internal successors, (362), 5 states have internal predecessors, (362), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:58:17,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:58:17,126 INFO L93 Difference]: Finished difference Result 2731 states and 4017 transitions. [2025-02-07 22:58:17,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:58:17,126 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 72.4) internal successors, (362), 5 states have internal predecessors, (362), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 374 [2025-02-07 22:58:17,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:58:17,129 INFO L225 Difference]: With dead ends: 2731 [2025-02-07 22:58:17,129 INFO L226 Difference]: Without dead ends: 1512 [2025-02-07 22:58:17,130 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-02-07 22:58:17,130 INFO L435 NwaCegarLoop]: 1624 mSDtfsCounter, 3993 mSDsluCounter, 1625 mSDsCounter, 0 mSdLazyCounter, 1200 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3996 SdHoareTripleChecker+Valid, 3249 SdHoareTripleChecker+Invalid, 1201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-07 22:58:17,131 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3996 Valid, 3249 Invalid, 1201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1200 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-07 22:58:17,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1512 states. [2025-02-07 22:58:17,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1512 to 1512. [2025-02-07 22:58:17,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1512 states, 1507 states have (on average 1.4737889847378898) internal successors, (2221), 1507 states have internal predecessors, (2221), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-07 22:58:17,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1512 states to 1512 states and 2227 transitions. [2025-02-07 22:58:17,141 INFO L78 Accepts]: Start accepts. Automaton has 1512 states and 2227 transitions. Word has length 374 [2025-02-07 22:58:17,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:58:17,142 INFO L471 AbstractCegarLoop]: Abstraction has 1512 states and 2227 transitions. [2025-02-07 22:58:17,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 72.4) internal successors, (362), 5 states have internal predecessors, (362), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:58:17,142 INFO L276 IsEmpty]: Start isEmpty. Operand 1512 states and 2227 transitions. [2025-02-07 22:58:17,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 376 [2025-02-07 22:58:17,143 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:58:17,143 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-07 22:58:17,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-02-07 22:58:17,144 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:58:17,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:58:17,144 INFO L85 PathProgramCache]: Analyzing trace with hash 1872372828, now seen corresponding path program 1 times [2025-02-07 22:58:17,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:58:17,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883823636] [2025-02-07 22:58:17,145 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:58:17,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:58:17,233 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 375 statements into 1 equivalence classes. [2025-02-07 22:58:17,361 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 375 of 375 statements. [2025-02-07 22:58:17,361 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:58:17,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:58:17,737 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-07 22:58:17,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:58:17,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883823636] [2025-02-07 22:58:17,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883823636] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:58:17,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:58:17,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 22:58:17,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470179933] [2025-02-07 22:58:17,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:58:17,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 22:58:17,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:58:17,738 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 22:58:17,738 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 22:58:17,739 INFO L87 Difference]: Start difference. First operand 1512 states and 2227 transitions. Second operand has 4 states, 4 states have (on average 90.75) internal successors, (363), 4 states have internal predecessors, (363), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:58:18,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:58:18,396 INFO L93 Difference]: Finished difference Result 2731 states and 4015 transitions. [2025-02-07 22:58:18,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:58:18,396 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 90.75) internal successors, (363), 4 states have internal predecessors, (363), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 375 [2025-02-07 22:58:18,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:58:18,398 INFO L225 Difference]: With dead ends: 2731 [2025-02-07 22:58:18,398 INFO L226 Difference]: Without dead ends: 1512 [2025-02-07 22:58:18,399 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-02-07 22:58:18,399 INFO L435 NwaCegarLoop]: 1720 mSDtfsCounter, 1966 mSDsluCounter, 1721 mSDsCounter, 0 mSdLazyCounter, 1006 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1966 SdHoareTripleChecker+Valid, 3441 SdHoareTripleChecker+Invalid, 1006 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1006 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-07 22:58:18,399 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1966 Valid, 3441 Invalid, 1006 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1006 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-07 22:58:18,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1512 states. [2025-02-07 22:58:18,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1512 to 1512. [2025-02-07 22:58:18,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1512 states, 1507 states have (on average 1.4731254147312542) internal successors, (2220), 1507 states have internal predecessors, (2220), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-07 22:58:18,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1512 states to 1512 states and 2226 transitions. [2025-02-07 22:58:18,423 INFO L78 Accepts]: Start accepts. Automaton has 1512 states and 2226 transitions. Word has length 375 [2025-02-07 22:58:18,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:58:18,423 INFO L471 AbstractCegarLoop]: Abstraction has 1512 states and 2226 transitions. [2025-02-07 22:58:18,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 90.75) internal successors, (363), 4 states have internal predecessors, (363), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:58:18,423 INFO L276 IsEmpty]: Start isEmpty. Operand 1512 states and 2226 transitions. [2025-02-07 22:58:18,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 377 [2025-02-07 22:58:18,425 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:58:18,425 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-07 22:58:18,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-02-07 22:58:18,425 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:58:18,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:58:18,426 INFO L85 PathProgramCache]: Analyzing trace with hash 539632527, now seen corresponding path program 1 times [2025-02-07 22:58:18,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:58:18,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814765994] [2025-02-07 22:58:18,426 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:58:18,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:58:18,501 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 376 statements into 1 equivalence classes. [2025-02-07 22:58:18,586 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 376 of 376 statements. [2025-02-07 22:58:18,587 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:58:18,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:58:18,851 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-07 22:58:18,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:58:18,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814765994] [2025-02-07 22:58:18,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814765994] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:58:18,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:58:18,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 22:58:18,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510131628] [2025-02-07 22:58:18,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:58:18,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:58:18,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:58:18,852 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:58:18,852 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:58:18,853 INFO L87 Difference]: Start difference. First operand 1512 states and 2226 transitions. Second operand has 5 states, 5 states have (on average 72.8) internal successors, (364), 5 states have internal predecessors, (364), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:58:19,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:58:19,601 INFO L93 Difference]: Finished difference Result 2761 states and 4057 transitions. [2025-02-07 22:58:19,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 22:58:19,601 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 72.8) internal successors, (364), 5 states have internal predecessors, (364), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 376 [2025-02-07 22:58:19,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:58:19,603 INFO L225 Difference]: With dead ends: 2761 [2025-02-07 22:58:19,603 INFO L226 Difference]: Without dead ends: 1512 [2025-02-07 22:58:19,604 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-07 22:58:19,604 INFO L435 NwaCegarLoop]: 1829 mSDtfsCounter, 2025 mSDsluCounter, 3552 mSDsCounter, 0 mSdLazyCounter, 1287 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2025 SdHoareTripleChecker+Valid, 5381 SdHoareTripleChecker+Invalid, 1301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-07 22:58:19,604 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2025 Valid, 5381 Invalid, 1301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1287 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-07 22:58:19,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1512 states. [2025-02-07 22:58:19,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1512 to 1512. [2025-02-07 22:58:19,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1512 states, 1507 states have (on average 1.4724618447246185) internal successors, (2219), 1507 states have internal predecessors, (2219), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-07 22:58:19,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1512 states to 1512 states and 2225 transitions. [2025-02-07 22:58:19,615 INFO L78 Accepts]: Start accepts. Automaton has 1512 states and 2225 transitions. Word has length 376 [2025-02-07 22:58:19,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:58:19,615 INFO L471 AbstractCegarLoop]: Abstraction has 1512 states and 2225 transitions. [2025-02-07 22:58:19,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 72.8) internal successors, (364), 5 states have internal predecessors, (364), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:58:19,615 INFO L276 IsEmpty]: Start isEmpty. Operand 1512 states and 2225 transitions. [2025-02-07 22:58:19,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 378 [2025-02-07 22:58:19,617 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:58:19,617 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-07 22:58:19,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-02-07 22:58:19,617 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:58:19,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:58:19,617 INFO L85 PathProgramCache]: Analyzing trace with hash -1716000911, now seen corresponding path program 1 times [2025-02-07 22:58:19,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:58:19,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506618092] [2025-02-07 22:58:19,618 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:58:19,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:58:19,688 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 377 statements into 1 equivalence classes. [2025-02-07 22:58:19,778 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 377 of 377 statements. [2025-02-07 22:58:19,778 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:58:19,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:58:20,038 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-07 22:58:20,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:58:20,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506618092] [2025-02-07 22:58:20,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506618092] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:58:20,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:58:20,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 22:58:20,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775079215] [2025-02-07 22:58:20,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:58:20,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:58:20,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:58:20,039 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:58:20,040 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:58:20,040 INFO L87 Difference]: Start difference. First operand 1512 states and 2225 transitions. Second operand has 5 states, 5 states have (on average 73.0) internal successors, (365), 5 states have internal predecessors, (365), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:58:20,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:58:20,696 INFO L93 Difference]: Finished difference Result 2731 states and 4011 transitions. [2025-02-07 22:58:20,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:58:20,696 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 73.0) internal successors, (365), 5 states have internal predecessors, (365), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 377 [2025-02-07 22:58:20,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:58:20,698 INFO L225 Difference]: With dead ends: 2731 [2025-02-07 22:58:20,698 INFO L226 Difference]: Without dead ends: 1512 [2025-02-07 22:58:20,699 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-02-07 22:58:20,700 INFO L435 NwaCegarLoop]: 1720 mSDtfsCounter, 2210 mSDsluCounter, 1727 mSDsCounter, 0 mSdLazyCounter, 1002 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2213 SdHoareTripleChecker+Valid, 3447 SdHoareTripleChecker+Invalid, 1003 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1002 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-07 22:58:20,700 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2213 Valid, 3447 Invalid, 1003 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1002 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-07 22:58:20,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1512 states. [2025-02-07 22:58:20,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1512 to 1512. [2025-02-07 22:58:20,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1512 states, 1507 states have (on average 1.4717982747179827) internal successors, (2218), 1507 states have internal predecessors, (2218), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-07 22:58:20,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1512 states to 1512 states and 2224 transitions. [2025-02-07 22:58:20,712 INFO L78 Accepts]: Start accepts. Automaton has 1512 states and 2224 transitions. Word has length 377 [2025-02-07 22:58:20,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:58:20,712 INFO L471 AbstractCegarLoop]: Abstraction has 1512 states and 2224 transitions. [2025-02-07 22:58:20,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 73.0) internal successors, (365), 5 states have internal predecessors, (365), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:58:20,713 INFO L276 IsEmpty]: Start isEmpty. Operand 1512 states and 2224 transitions. [2025-02-07 22:58:20,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 379 [2025-02-07 22:58:20,714 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:58:20,714 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-07 22:58:20,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-02-07 22:58:20,715 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:58:20,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:58:20,715 INFO L85 PathProgramCache]: Analyzing trace with hash 1781620756, now seen corresponding path program 1 times [2025-02-07 22:58:20,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:58:20,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487504683] [2025-02-07 22:58:20,715 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:58:20,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:58:20,790 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 378 statements into 1 equivalence classes. [2025-02-07 22:58:20,880 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 378 of 378 statements. [2025-02-07 22:58:20,881 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:58:20,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:58:21,182 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-07 22:58:21,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:58:21,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487504683] [2025-02-07 22:58:21,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487504683] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:58:21,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:58:21,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 22:58:21,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278089227] [2025-02-07 22:58:21,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:58:21,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:58:21,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:58:21,183 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:58:21,183 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:58:21,183 INFO L87 Difference]: Start difference. First operand 1512 states and 2224 transitions. Second operand has 5 states, 5 states have (on average 73.2) internal successors, (366), 5 states have internal predecessors, (366), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:58:21,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:58:21,819 INFO L93 Difference]: Finished difference Result 2731 states and 4009 transitions. [2025-02-07 22:58:21,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:58:21,820 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 73.2) internal successors, (366), 5 states have internal predecessors, (366), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 378 [2025-02-07 22:58:21,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:58:21,821 INFO L225 Difference]: With dead ends: 2731 [2025-02-07 22:58:21,821 INFO L226 Difference]: Without dead ends: 1512 [2025-02-07 22:58:21,822 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-02-07 22:58:21,822 INFO L435 NwaCegarLoop]: 1720 mSDtfsCounter, 4191 mSDsluCounter, 1721 mSDsCounter, 0 mSdLazyCounter, 1000 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4194 SdHoareTripleChecker+Valid, 3441 SdHoareTripleChecker+Invalid, 1001 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1000 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-07 22:58:21,822 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4194 Valid, 3441 Invalid, 1001 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1000 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-07 22:58:21,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1512 states. [2025-02-07 22:58:21,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1512 to 1512. [2025-02-07 22:58:21,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1512 states, 1507 states have (on average 1.471134704711347) internal successors, (2217), 1507 states have internal predecessors, (2217), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-07 22:58:21,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1512 states to 1512 states and 2223 transitions. [2025-02-07 22:58:21,833 INFO L78 Accepts]: Start accepts. Automaton has 1512 states and 2223 transitions. Word has length 378 [2025-02-07 22:58:21,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:58:21,834 INFO L471 AbstractCegarLoop]: Abstraction has 1512 states and 2223 transitions. [2025-02-07 22:58:21,834 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 73.2) internal successors, (366), 5 states have internal predecessors, (366), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:58:21,834 INFO L276 IsEmpty]: Start isEmpty. Operand 1512 states and 2223 transitions. [2025-02-07 22:58:21,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 380 [2025-02-07 22:58:21,835 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:58:21,835 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-07 22:58:21,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-02-07 22:58:21,835 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:58:21,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:58:21,836 INFO L85 PathProgramCache]: Analyzing trace with hash 402852182, now seen corresponding path program 1 times [2025-02-07 22:58:21,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:58:21,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032288554] [2025-02-07 22:58:21,836 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:58:21,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:58:21,908 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 379 statements into 1 equivalence classes. [2025-02-07 22:58:21,997 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 379 of 379 statements. [2025-02-07 22:58:21,997 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:58:21,997 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:58:22,248 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-07 22:58:22,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:58:22,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032288554] [2025-02-07 22:58:22,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032288554] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:58:22,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:58:22,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 22:58:22,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449044815] [2025-02-07 22:58:22,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:58:22,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:58:22,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:58:22,250 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:58:22,250 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:58:22,250 INFO L87 Difference]: Start difference. First operand 1512 states and 2223 transitions. Second operand has 5 states, 5 states have (on average 73.4) internal successors, (367), 5 states have internal predecessors, (367), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:58:22,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:58:22,918 INFO L93 Difference]: Finished difference Result 2731 states and 4007 transitions. [2025-02-07 22:58:22,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:58:22,918 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 73.4) internal successors, (367), 5 states have internal predecessors, (367), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 379 [2025-02-07 22:58:22,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:58:22,920 INFO L225 Difference]: With dead ends: 2731 [2025-02-07 22:58:22,920 INFO L226 Difference]: Without dead ends: 1512 [2025-02-07 22:58:22,921 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-02-07 22:58:22,921 INFO L435 NwaCegarLoop]: 1720 mSDtfsCounter, 2202 mSDsluCounter, 1727 mSDsCounter, 0 mSdLazyCounter, 998 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2205 SdHoareTripleChecker+Valid, 3447 SdHoareTripleChecker+Invalid, 999 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 998 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-07 22:58:22,921 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2205 Valid, 3447 Invalid, 999 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 998 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-07 22:58:22,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1512 states. [2025-02-07 22:58:22,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1512 to 1512. [2025-02-07 22:58:22,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1512 states, 1507 states have (on average 1.4704711347047112) internal successors, (2216), 1507 states have internal predecessors, (2216), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-07 22:58:22,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1512 states to 1512 states and 2222 transitions. [2025-02-07 22:58:22,933 INFO L78 Accepts]: Start accepts. Automaton has 1512 states and 2222 transitions. Word has length 379 [2025-02-07 22:58:22,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:58:22,933 INFO L471 AbstractCegarLoop]: Abstraction has 1512 states and 2222 transitions. [2025-02-07 22:58:22,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 73.4) internal successors, (367), 5 states have internal predecessors, (367), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:58:22,934 INFO L276 IsEmpty]: Start isEmpty. Operand 1512 states and 2222 transitions. [2025-02-07 22:58:22,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 381 [2025-02-07 22:58:22,935 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:58:22,935 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-07 22:58:22,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-02-07 22:58:22,935 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:58:22,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:58:22,936 INFO L85 PathProgramCache]: Analyzing trace with hash -71159015, now seen corresponding path program 1 times [2025-02-07 22:58:22,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:58:22,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121916258] [2025-02-07 22:58:22,936 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:58:22,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:58:23,011 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 380 statements into 1 equivalence classes. [2025-02-07 22:58:23,101 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 380 of 380 statements. [2025-02-07 22:58:23,102 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:58:23,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:58:23,454 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-07 22:58:23,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:58:23,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121916258] [2025-02-07 22:58:23,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121916258] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:58:23,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:58:23,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 22:58:23,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022470085] [2025-02-07 22:58:23,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:58:23,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:58:23,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:58:23,456 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:58:23,457 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:58:23,457 INFO L87 Difference]: Start difference. First operand 1512 states and 2222 transitions. Second operand has 5 states, 5 states have (on average 73.6) internal successors, (368), 5 states have internal predecessors, (368), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:58:24,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:58:24,165 INFO L93 Difference]: Finished difference Result 2731 states and 4005 transitions. [2025-02-07 22:58:24,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:58:24,165 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 73.6) internal successors, (368), 5 states have internal predecessors, (368), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 380 [2025-02-07 22:58:24,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:58:24,167 INFO L225 Difference]: With dead ends: 2731 [2025-02-07 22:58:24,167 INFO L226 Difference]: Without dead ends: 1512 [2025-02-07 22:58:24,169 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-02-07 22:58:24,170 INFO L435 NwaCegarLoop]: 1720 mSDtfsCounter, 2198 mSDsluCounter, 1727 mSDsCounter, 0 mSdLazyCounter, 996 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2201 SdHoareTripleChecker+Valid, 3447 SdHoareTripleChecker+Invalid, 997 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 996 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-07 22:58:24,171 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2201 Valid, 3447 Invalid, 997 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 996 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-07 22:58:24,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1512 states. [2025-02-07 22:58:24,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1512 to 1512. [2025-02-07 22:58:24,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1512 states, 1507 states have (on average 1.4698075646980757) internal successors, (2215), 1507 states have internal predecessors, (2215), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-07 22:58:24,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1512 states to 1512 states and 2221 transitions. [2025-02-07 22:58:24,194 INFO L78 Accepts]: Start accepts. Automaton has 1512 states and 2221 transitions. Word has length 380 [2025-02-07 22:58:24,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:58:24,195 INFO L471 AbstractCegarLoop]: Abstraction has 1512 states and 2221 transitions. [2025-02-07 22:58:24,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 73.6) internal successors, (368), 5 states have internal predecessors, (368), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:58:24,195 INFO L276 IsEmpty]: Start isEmpty. Operand 1512 states and 2221 transitions. [2025-02-07 22:58:24,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 382 [2025-02-07 22:58:24,199 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:58:24,200 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-07 22:58:24,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2025-02-07 22:58:24,200 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:58:24,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:58:24,201 INFO L85 PathProgramCache]: Analyzing trace with hash 961141179, now seen corresponding path program 1 times [2025-02-07 22:58:24,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:58:24,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143657274] [2025-02-07 22:58:24,203 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:58:24,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:58:24,312 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 381 statements into 1 equivalence classes. [2025-02-07 22:58:24,456 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 381 of 381 statements. [2025-02-07 22:58:24,457 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:58:24,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:58:24,725 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-07 22:58:24,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:58:24,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143657274] [2025-02-07 22:58:24,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143657274] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:58:24,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:58:24,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 22:58:24,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316872358] [2025-02-07 22:58:24,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:58:24,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:58:24,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:58:24,726 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:58:24,726 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:58:24,727 INFO L87 Difference]: Start difference. First operand 1512 states and 2221 transitions. Second operand has 5 states, 5 states have (on average 73.8) internal successors, (369), 5 states have internal predecessors, (369), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:58:25,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:58:25,365 INFO L93 Difference]: Finished difference Result 2731 states and 4003 transitions. [2025-02-07 22:58:25,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:58:25,365 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 73.8) internal successors, (369), 5 states have internal predecessors, (369), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 381 [2025-02-07 22:58:25,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:58:25,367 INFO L225 Difference]: With dead ends: 2731 [2025-02-07 22:58:25,367 INFO L226 Difference]: Without dead ends: 1512 [2025-02-07 22:58:25,368 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-02-07 22:58:25,373 INFO L435 NwaCegarLoop]: 1720 mSDtfsCounter, 4167 mSDsluCounter, 1721 mSDsCounter, 0 mSdLazyCounter, 994 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4170 SdHoareTripleChecker+Valid, 3441 SdHoareTripleChecker+Invalid, 995 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 994 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-07 22:58:25,373 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4170 Valid, 3441 Invalid, 995 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 994 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-07 22:58:25,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1512 states. [2025-02-07 22:58:25,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1512 to 1512. [2025-02-07 22:58:25,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1512 states, 1507 states have (on average 1.46914399469144) internal successors, (2214), 1507 states have internal predecessors, (2214), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-07 22:58:25,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1512 states to 1512 states and 2220 transitions. [2025-02-07 22:58:25,397 INFO L78 Accepts]: Start accepts. Automaton has 1512 states and 2220 transitions. Word has length 381 [2025-02-07 22:58:25,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:58:25,397 INFO L471 AbstractCegarLoop]: Abstraction has 1512 states and 2220 transitions. [2025-02-07 22:58:25,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 73.8) internal successors, (369), 5 states have internal predecessors, (369), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:58:25,398 INFO L276 IsEmpty]: Start isEmpty. Operand 1512 states and 2220 transitions. [2025-02-07 22:58:25,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 383 [2025-02-07 22:58:25,399 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:58:25,399 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-07 22:58:25,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2025-02-07 22:58:25,400 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:58:25,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:58:25,400 INFO L85 PathProgramCache]: Analyzing trace with hash -281486178, now seen corresponding path program 1 times [2025-02-07 22:58:25,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:58:25,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102481945] [2025-02-07 22:58:25,403 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:58:25,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:58:25,493 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 382 statements into 1 equivalence classes. [2025-02-07 22:58:25,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 382 of 382 statements. [2025-02-07 22:58:25,586 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:58:25,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:58:25,852 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-07 22:58:25,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:58:25,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102481945] [2025-02-07 22:58:25,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102481945] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:58:25,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:58:25,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 22:58:25,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115011617] [2025-02-07 22:58:25,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:58:25,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:58:25,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:58:25,853 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:58:25,853 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:58:25,853 INFO L87 Difference]: Start difference. First operand 1512 states and 2220 transitions. Second operand has 5 states, 5 states have (on average 74.0) internal successors, (370), 5 states have internal predecessors, (370), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:58:26,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:58:26,532 INFO L93 Difference]: Finished difference Result 2731 states and 4001 transitions. [2025-02-07 22:58:26,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:58:26,533 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 74.0) internal successors, (370), 5 states have internal predecessors, (370), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 382 [2025-02-07 22:58:26,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:58:26,534 INFO L225 Difference]: With dead ends: 2731 [2025-02-07 22:58:26,534 INFO L226 Difference]: Without dead ends: 1512 [2025-02-07 22:58:26,535 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-02-07 22:58:26,535 INFO L435 NwaCegarLoop]: 1720 mSDtfsCounter, 4159 mSDsluCounter, 1721 mSDsCounter, 0 mSdLazyCounter, 992 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4162 SdHoareTripleChecker+Valid, 3441 SdHoareTripleChecker+Invalid, 993 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 992 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-07 22:58:26,536 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4162 Valid, 3441 Invalid, 993 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 992 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-07 22:58:26,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1512 states. [2025-02-07 22:58:26,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1512 to 1512. [2025-02-07 22:58:26,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1512 states, 1507 states have (on average 1.4684804246848042) internal successors, (2213), 1507 states have internal predecessors, (2213), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-07 22:58:26,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1512 states to 1512 states and 2219 transitions. [2025-02-07 22:58:26,545 INFO L78 Accepts]: Start accepts. Automaton has 1512 states and 2219 transitions. Word has length 382 [2025-02-07 22:58:26,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:58:26,546 INFO L471 AbstractCegarLoop]: Abstraction has 1512 states and 2219 transitions. [2025-02-07 22:58:26,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 74.0) internal successors, (370), 5 states have internal predecessors, (370), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:58:26,546 INFO L276 IsEmpty]: Start isEmpty. Operand 1512 states and 2219 transitions. [2025-02-07 22:58:26,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 384 [2025-02-07 22:58:26,547 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:58:26,547 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-07 22:58:26,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2025-02-07 22:58:26,547 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:58:26,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:58:26,548 INFO L85 PathProgramCache]: Analyzing trace with hash 1010473120, now seen corresponding path program 1 times [2025-02-07 22:58:26,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:58:26,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782468160] [2025-02-07 22:58:26,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:58:26,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:58:26,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 383 statements into 1 equivalence classes. [2025-02-07 22:58:26,714 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 383 of 383 statements. [2025-02-07 22:58:26,714 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:58:26,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:58:26,979 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-07 22:58:26,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:58:26,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782468160] [2025-02-07 22:58:26,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782468160] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:58:26,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:58:26,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 22:58:26,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033393250] [2025-02-07 22:58:26,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:58:26,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:58:26,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:58:26,980 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:58:26,980 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:58:26,981 INFO L87 Difference]: Start difference. First operand 1512 states and 2219 transitions. Second operand has 5 states, 5 states have (on average 74.2) internal successors, (371), 5 states have internal predecessors, (371), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:58:27,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:58:27,615 INFO L93 Difference]: Finished difference Result 2731 states and 3999 transitions. [2025-02-07 22:58:27,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:58:27,616 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 74.2) internal successors, (371), 5 states have internal predecessors, (371), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 383 [2025-02-07 22:58:27,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:58:27,617 INFO L225 Difference]: With dead ends: 2731 [2025-02-07 22:58:27,617 INFO L226 Difference]: Without dead ends: 1512 [2025-02-07 22:58:27,619 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-02-07 22:58:27,619 INFO L435 NwaCegarLoop]: 1720 mSDtfsCounter, 4151 mSDsluCounter, 1721 mSDsCounter, 0 mSdLazyCounter, 990 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4154 SdHoareTripleChecker+Valid, 3441 SdHoareTripleChecker+Invalid, 991 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 990 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-07 22:58:27,619 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4154 Valid, 3441 Invalid, 991 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 990 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-07 22:58:27,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1512 states. [2025-02-07 22:58:27,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1512 to 1512. [2025-02-07 22:58:27,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1512 states, 1507 states have (on average 1.4678168546781685) internal successors, (2212), 1507 states have internal predecessors, (2212), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-07 22:58:27,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1512 states to 1512 states and 2218 transitions. [2025-02-07 22:58:27,631 INFO L78 Accepts]: Start accepts. Automaton has 1512 states and 2218 transitions. Word has length 383 [2025-02-07 22:58:27,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:58:27,632 INFO L471 AbstractCegarLoop]: Abstraction has 1512 states and 2218 transitions. [2025-02-07 22:58:27,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 74.2) internal successors, (371), 5 states have internal predecessors, (371), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:58:27,632 INFO L276 IsEmpty]: Start isEmpty. Operand 1512 states and 2218 transitions. [2025-02-07 22:58:27,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 385 [2025-02-07 22:58:27,633 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:58:27,633 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-07 22:58:27,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2025-02-07 22:58:27,634 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:58:27,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:58:27,634 INFO L85 PathProgramCache]: Analyzing trace with hash 1741790371, now seen corresponding path program 1 times [2025-02-07 22:58:27,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:58:27,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756463918] [2025-02-07 22:58:27,634 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:58:27,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:58:27,732 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 384 statements into 1 equivalence classes. [2025-02-07 22:58:27,829 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 384 of 384 statements. [2025-02-07 22:58:27,829 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:58:27,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:58:28,104 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-07 22:58:28,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:58:28,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756463918] [2025-02-07 22:58:28,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756463918] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:58:28,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:58:28,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 22:58:28,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166905346] [2025-02-07 22:58:28,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:58:28,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:58:28,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:58:28,105 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:58:28,105 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:58:28,105 INFO L87 Difference]: Start difference. First operand 1512 states and 2218 transitions. Second operand has 5 states, 5 states have (on average 74.4) internal successors, (372), 5 states have internal predecessors, (372), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:58:28,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:58:28,792 INFO L93 Difference]: Finished difference Result 2731 states and 3997 transitions. [2025-02-07 22:58:28,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:58:28,793 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 74.4) internal successors, (372), 5 states have internal predecessors, (372), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 384 [2025-02-07 22:58:28,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:58:28,794 INFO L225 Difference]: With dead ends: 2731 [2025-02-07 22:58:28,794 INFO L226 Difference]: Without dead ends: 1512 [2025-02-07 22:58:28,795 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-02-07 22:58:28,796 INFO L435 NwaCegarLoop]: 1720 mSDtfsCounter, 2182 mSDsluCounter, 1727 mSDsCounter, 0 mSdLazyCounter, 988 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2185 SdHoareTripleChecker+Valid, 3447 SdHoareTripleChecker+Invalid, 989 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 988 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-07 22:58:28,796 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2185 Valid, 3447 Invalid, 989 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 988 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-07 22:58:28,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1512 states. [2025-02-07 22:58:28,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1512 to 1512. [2025-02-07 22:58:28,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1512 states, 1507 states have (on average 1.467153284671533) internal successors, (2211), 1507 states have internal predecessors, (2211), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-07 22:58:28,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1512 states to 1512 states and 2217 transitions. [2025-02-07 22:58:28,809 INFO L78 Accepts]: Start accepts. Automaton has 1512 states and 2217 transitions. Word has length 384 [2025-02-07 22:58:28,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:58:28,809 INFO L471 AbstractCegarLoop]: Abstraction has 1512 states and 2217 transitions. [2025-02-07 22:58:28,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 74.4) internal successors, (372), 5 states have internal predecessors, (372), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:58:28,809 INFO L276 IsEmpty]: Start isEmpty. Operand 1512 states and 2217 transitions. [2025-02-07 22:58:28,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 386 [2025-02-07 22:58:28,811 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:58:28,811 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-07 22:58:28,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2025-02-07 22:58:28,811 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:58:28,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:58:28,811 INFO L85 PathProgramCache]: Analyzing trace with hash -1746696699, now seen corresponding path program 1 times [2025-02-07 22:58:28,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:58:28,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843560288] [2025-02-07 22:58:28,812 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:58:28,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:58:28,956 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 385 statements into 1 equivalence classes. [2025-02-07 22:58:29,055 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 385 of 385 statements. [2025-02-07 22:58:29,055 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:58:29,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:58:29,313 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-07 22:58:29,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:58:29,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843560288] [2025-02-07 22:58:29,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [843560288] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:58:29,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:58:29,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 22:58:29,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007692125] [2025-02-07 22:58:29,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:58:29,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:58:29,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:58:29,314 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:58:29,314 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:58:29,314 INFO L87 Difference]: Start difference. First operand 1512 states and 2217 transitions. Second operand has 5 states, 5 states have (on average 74.6) internal successors, (373), 5 states have internal predecessors, (373), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:58:29,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:58:29,896 INFO L93 Difference]: Finished difference Result 2731 states and 3995 transitions. [2025-02-07 22:58:29,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:58:29,897 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 74.6) internal successors, (373), 5 states have internal predecessors, (373), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 385 [2025-02-07 22:58:29,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:58:29,898 INFO L225 Difference]: With dead ends: 2731 [2025-02-07 22:58:29,898 INFO L226 Difference]: Without dead ends: 1512 [2025-02-07 22:58:29,899 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-02-07 22:58:29,900 INFO L435 NwaCegarLoop]: 1720 mSDtfsCounter, 4135 mSDsluCounter, 1721 mSDsCounter, 0 mSdLazyCounter, 986 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4138 SdHoareTripleChecker+Valid, 3441 SdHoareTripleChecker+Invalid, 987 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 986 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-07 22:58:29,900 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4138 Valid, 3441 Invalid, 987 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 986 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-07 22:58:29,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1512 states. [2025-02-07 22:58:29,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1512 to 1512. [2025-02-07 22:58:29,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1512 states, 1507 states have (on average 1.4664897146648972) internal successors, (2210), 1507 states have internal predecessors, (2210), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-07 22:58:29,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1512 states to 1512 states and 2216 transitions. [2025-02-07 22:58:29,911 INFO L78 Accepts]: Start accepts. Automaton has 1512 states and 2216 transitions. Word has length 385 [2025-02-07 22:58:29,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:58:29,912 INFO L471 AbstractCegarLoop]: Abstraction has 1512 states and 2216 transitions. [2025-02-07 22:58:29,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 74.6) internal successors, (373), 5 states have internal predecessors, (373), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:58:29,912 INFO L276 IsEmpty]: Start isEmpty. Operand 1512 states and 2216 transitions. [2025-02-07 22:58:29,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 387 [2025-02-07 22:58:29,913 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:58:29,913 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-07 22:58:29,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2025-02-07 22:58:29,913 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:58:29,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:58:29,915 INFO L85 PathProgramCache]: Analyzing trace with hash -777473240, now seen corresponding path program 1 times [2025-02-07 22:58:29,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:58:29,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542393529] [2025-02-07 22:58:29,915 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:58:29,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:58:30,004 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 386 statements into 1 equivalence classes. [2025-02-07 22:58:30,099 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 386 of 386 statements. [2025-02-07 22:58:30,099 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:58:30,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:58:30,358 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-07 22:58:30,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:58:30,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542393529] [2025-02-07 22:58:30,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542393529] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:58:30,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:58:30,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 22:58:30,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910186396] [2025-02-07 22:58:30,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:58:30,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:58:30,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:58:30,359 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:58:30,359 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:58:30,359 INFO L87 Difference]: Start difference. First operand 1512 states and 2216 transitions. Second operand has 5 states, 5 states have (on average 74.8) internal successors, (374), 5 states have internal predecessors, (374), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:58:30,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:58:30,999 INFO L93 Difference]: Finished difference Result 2731 states and 3993 transitions. [2025-02-07 22:58:30,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:58:30,999 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 74.8) internal successors, (374), 5 states have internal predecessors, (374), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 386 [2025-02-07 22:58:30,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:58:31,000 INFO L225 Difference]: With dead ends: 2731 [2025-02-07 22:58:31,001 INFO L226 Difference]: Without dead ends: 1512 [2025-02-07 22:58:31,001 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-02-07 22:58:31,002 INFO L435 NwaCegarLoop]: 1720 mSDtfsCounter, 4127 mSDsluCounter, 1721 mSDsCounter, 0 mSdLazyCounter, 984 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4130 SdHoareTripleChecker+Valid, 3441 SdHoareTripleChecker+Invalid, 985 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 984 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-07 22:58:31,002 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4130 Valid, 3441 Invalid, 985 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 984 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-07 22:58:31,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1512 states. [2025-02-07 22:58:31,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1512 to 1512. [2025-02-07 22:58:31,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1512 states, 1507 states have (on average 1.4658261446582614) internal successors, (2209), 1507 states have internal predecessors, (2209), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-07 22:58:31,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1512 states to 1512 states and 2215 transitions. [2025-02-07 22:58:31,012 INFO L78 Accepts]: Start accepts. Automaton has 1512 states and 2215 transitions. Word has length 386 [2025-02-07 22:58:31,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:58:31,012 INFO L471 AbstractCegarLoop]: Abstraction has 1512 states and 2215 transitions. [2025-02-07 22:58:31,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 74.8) internal successors, (374), 5 states have internal predecessors, (374), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:58:31,012 INFO L276 IsEmpty]: Start isEmpty. Operand 1512 states and 2215 transitions. [2025-02-07 22:58:31,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 388 [2025-02-07 22:58:31,013 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:58:31,013 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-07 22:58:31,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2025-02-07 22:58:31,013 INFO L396 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:58:31,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:58:31,014 INFO L85 PathProgramCache]: Analyzing trace with hash 1538449898, now seen corresponding path program 1 times [2025-02-07 22:58:31,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:58:31,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647244987] [2025-02-07 22:58:31,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:58:31,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:58:31,087 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 387 statements into 1 equivalence classes. [2025-02-07 22:58:31,219 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 387 of 387 statements. [2025-02-07 22:58:31,219 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:58:31,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:58:31,456 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-07 22:58:31,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:58:31,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647244987] [2025-02-07 22:58:31,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647244987] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:58:31,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:58:31,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 22:58:31,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113535375] [2025-02-07 22:58:31,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:58:31,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:58:31,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:58:31,457 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:58:31,457 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:58:31,457 INFO L87 Difference]: Start difference. First operand 1512 states and 2215 transitions. Second operand has 5 states, 5 states have (on average 75.0) internal successors, (375), 5 states have internal predecessors, (375), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:58:32,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:58:32,071 INFO L93 Difference]: Finished difference Result 2731 states and 3991 transitions. [2025-02-07 22:58:32,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:58:32,071 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 75.0) internal successors, (375), 5 states have internal predecessors, (375), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 387 [2025-02-07 22:58:32,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:58:32,073 INFO L225 Difference]: With dead ends: 2731 [2025-02-07 22:58:32,073 INFO L226 Difference]: Without dead ends: 1512 [2025-02-07 22:58:32,074 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-02-07 22:58:32,074 INFO L435 NwaCegarLoop]: 1720 mSDtfsCounter, 2170 mSDsluCounter, 1727 mSDsCounter, 0 mSdLazyCounter, 982 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2173 SdHoareTripleChecker+Valid, 3447 SdHoareTripleChecker+Invalid, 983 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 982 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-07 22:58:32,074 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2173 Valid, 3447 Invalid, 983 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 982 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-07 22:58:32,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1512 states. [2025-02-07 22:58:32,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1512 to 1512. [2025-02-07 22:58:32,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1512 states, 1507 states have (on average 1.4651625746516257) internal successors, (2208), 1507 states have internal predecessors, (2208), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-07 22:58:32,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1512 states to 1512 states and 2214 transitions. [2025-02-07 22:58:32,086 INFO L78 Accepts]: Start accepts. Automaton has 1512 states and 2214 transitions. Word has length 387 [2025-02-07 22:58:32,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:58:32,086 INFO L471 AbstractCegarLoop]: Abstraction has 1512 states and 2214 transitions. [2025-02-07 22:58:32,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 75.0) internal successors, (375), 5 states have internal predecessors, (375), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:58:32,086 INFO L276 IsEmpty]: Start isEmpty. Operand 1512 states and 2214 transitions. [2025-02-07 22:58:32,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 389 [2025-02-07 22:58:32,088 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:58:32,088 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-07 22:58:32,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2025-02-07 22:58:32,088 INFO L396 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:58:32,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:58:32,088 INFO L85 PathProgramCache]: Analyzing trace with hash 565862445, now seen corresponding path program 1 times [2025-02-07 22:58:32,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:58:32,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456900612] [2025-02-07 22:58:32,089 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:58:32,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:58:32,168 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 388 statements into 1 equivalence classes. [2025-02-07 22:58:32,265 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 388 of 388 statements. [2025-02-07 22:58:32,265 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:58:32,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:58:32,536 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-07 22:58:32,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:58:32,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456900612] [2025-02-07 22:58:32,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456900612] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:58:32,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:58:32,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 22:58:32,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404370315] [2025-02-07 22:58:32,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:58:32,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:58:32,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:58:32,537 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:58:32,537 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:58:32,537 INFO L87 Difference]: Start difference. First operand 1512 states and 2214 transitions. Second operand has 5 states, 5 states have (on average 75.2) internal successors, (376), 5 states have internal predecessors, (376), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:58:33,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:58:33,075 INFO L93 Difference]: Finished difference Result 2731 states and 3989 transitions. [2025-02-07 22:58:33,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:58:33,075 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 75.2) internal successors, (376), 5 states have internal predecessors, (376), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 388 [2025-02-07 22:58:33,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:58:33,077 INFO L225 Difference]: With dead ends: 2731 [2025-02-07 22:58:33,077 INFO L226 Difference]: Without dead ends: 1512 [2025-02-07 22:58:33,079 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-02-07 22:58:33,079 INFO L435 NwaCegarLoop]: 1720 mSDtfsCounter, 2166 mSDsluCounter, 1727 mSDsCounter, 0 mSdLazyCounter, 980 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2169 SdHoareTripleChecker+Valid, 3447 SdHoareTripleChecker+Invalid, 981 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 980 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-07 22:58:33,080 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2169 Valid, 3447 Invalid, 981 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 980 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-07 22:58:33,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1512 states. [2025-02-07 22:58:33,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1512 to 1512. [2025-02-07 22:58:33,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1512 states, 1507 states have (on average 1.46449900464499) internal successors, (2207), 1507 states have internal predecessors, (2207), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-07 22:58:33,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1512 states to 1512 states and 2213 transitions. [2025-02-07 22:58:33,090 INFO L78 Accepts]: Start accepts. Automaton has 1512 states and 2213 transitions. Word has length 388 [2025-02-07 22:58:33,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:58:33,090 INFO L471 AbstractCegarLoop]: Abstraction has 1512 states and 2213 transitions. [2025-02-07 22:58:33,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 75.2) internal successors, (376), 5 states have internal predecessors, (376), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:58:33,091 INFO L276 IsEmpty]: Start isEmpty. Operand 1512 states and 2213 transitions. [2025-02-07 22:58:33,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 390 [2025-02-07 22:58:33,092 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:58:33,092 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-07 22:58:33,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2025-02-07 22:58:33,095 INFO L396 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:58:33,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:58:33,096 INFO L85 PathProgramCache]: Analyzing trace with hash -1888031665, now seen corresponding path program 1 times [2025-02-07 22:58:33,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:58:33,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324859120] [2025-02-07 22:58:33,096 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:58:33,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:58:33,174 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 389 statements into 1 equivalence classes. [2025-02-07 22:58:33,269 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 389 of 389 statements. [2025-02-07 22:58:33,269 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:58:33,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:58:33,563 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-07 22:58:33,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:58:33,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324859120] [2025-02-07 22:58:33,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324859120] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:58:33,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:58:33,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 22:58:33,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602219832] [2025-02-07 22:58:33,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:58:33,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:58:33,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:58:33,564 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:58:33,564 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:58:33,564 INFO L87 Difference]: Start difference. First operand 1512 states and 2213 transitions. Second operand has 5 states, 5 states have (on average 75.4) internal successors, (377), 5 states have internal predecessors, (377), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:58:34,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:58:34,083 INFO L93 Difference]: Finished difference Result 2731 states and 3987 transitions. [2025-02-07 22:58:34,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:58:34,084 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 75.4) internal successors, (377), 5 states have internal predecessors, (377), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 389 [2025-02-07 22:58:34,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:58:34,085 INFO L225 Difference]: With dead ends: 2731 [2025-02-07 22:58:34,087 INFO L226 Difference]: Without dead ends: 1512 [2025-02-07 22:58:34,088 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-02-07 22:58:34,088 INFO L435 NwaCegarLoop]: 1720 mSDtfsCounter, 2162 mSDsluCounter, 1727 mSDsCounter, 0 mSdLazyCounter, 978 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2165 SdHoareTripleChecker+Valid, 3447 SdHoareTripleChecker+Invalid, 979 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 978 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-07 22:58:34,090 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2165 Valid, 3447 Invalid, 979 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 978 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-07 22:58:34,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1512 states. [2025-02-07 22:58:34,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1512 to 1512. [2025-02-07 22:58:34,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1512 states, 1507 states have (on average 1.4638354346383544) internal successors, (2206), 1507 states have internal predecessors, (2206), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-07 22:58:34,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1512 states to 1512 states and 2212 transitions. [2025-02-07 22:58:34,103 INFO L78 Accepts]: Start accepts. Automaton has 1512 states and 2212 transitions. Word has length 389 [2025-02-07 22:58:34,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:58:34,104 INFO L471 AbstractCegarLoop]: Abstraction has 1512 states and 2212 transitions. [2025-02-07 22:58:34,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 75.4) internal successors, (377), 5 states have internal predecessors, (377), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:58:34,104 INFO L276 IsEmpty]: Start isEmpty. Operand 1512 states and 2212 transitions. [2025-02-07 22:58:34,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 391 [2025-02-07 22:58:34,105 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:58:34,105 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-07 22:58:34,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2025-02-07 22:58:34,105 INFO L396 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:58:34,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:58:34,108 INFO L85 PathProgramCache]: Analyzing trace with hash 367190962, now seen corresponding path program 1 times [2025-02-07 22:58:34,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:58:34,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257711674] [2025-02-07 22:58:34,109 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:58:34,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:58:34,186 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 390 statements into 1 equivalence classes. [2025-02-07 22:58:34,287 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 390 of 390 statements. [2025-02-07 22:58:34,287 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:58:34,287 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:58:34,554 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-07 22:58:34,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:58:34,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257711674] [2025-02-07 22:58:34,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257711674] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:58:34,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:58:34,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 22:58:34,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309307904] [2025-02-07 22:58:34,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:58:34,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:58:34,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:58:34,555 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:58:34,555 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:58:34,555 INFO L87 Difference]: Start difference. First operand 1512 states and 2212 transitions. Second operand has 5 states, 5 states have (on average 75.6) internal successors, (378), 5 states have internal predecessors, (378), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:58:35,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:58:35,072 INFO L93 Difference]: Finished difference Result 2731 states and 3985 transitions. [2025-02-07 22:58:35,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:58:35,072 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 75.6) internal successors, (378), 5 states have internal predecessors, (378), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 390 [2025-02-07 22:58:35,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:58:35,074 INFO L225 Difference]: With dead ends: 2731 [2025-02-07 22:58:35,074 INFO L226 Difference]: Without dead ends: 1512 [2025-02-07 22:58:35,075 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-02-07 22:58:35,075 INFO L435 NwaCegarLoop]: 1720 mSDtfsCounter, 4095 mSDsluCounter, 1721 mSDsCounter, 0 mSdLazyCounter, 976 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4098 SdHoareTripleChecker+Valid, 3441 SdHoareTripleChecker+Invalid, 977 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 976 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-07 22:58:35,075 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4098 Valid, 3441 Invalid, 977 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 976 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-07 22:58:35,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1512 states. [2025-02-07 22:58:35,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1512 to 1512. [2025-02-07 22:58:35,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1512 states, 1507 states have (on average 1.4631718646317187) internal successors, (2205), 1507 states have internal predecessors, (2205), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-07 22:58:35,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1512 states to 1512 states and 2211 transitions. [2025-02-07 22:58:35,093 INFO L78 Accepts]: Start accepts. Automaton has 1512 states and 2211 transitions. Word has length 390 [2025-02-07 22:58:35,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:58:35,093 INFO L471 AbstractCegarLoop]: Abstraction has 1512 states and 2211 transitions. [2025-02-07 22:58:35,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 75.6) internal successors, (378), 5 states have internal predecessors, (378), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:58:35,093 INFO L276 IsEmpty]: Start isEmpty. Operand 1512 states and 2211 transitions. [2025-02-07 22:58:35,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 392 [2025-02-07 22:58:35,095 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:58:35,095 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-07 22:58:35,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2025-02-07 22:58:35,095 INFO L396 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:58:35,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:58:35,095 INFO L85 PathProgramCache]: Analyzing trace with hash -1822563020, now seen corresponding path program 1 times [2025-02-07 22:58:35,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:58:35,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575992802] [2025-02-07 22:58:35,095 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:58:35,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:58:35,171 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 391 statements into 1 equivalence classes. [2025-02-07 22:58:35,367 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 391 of 391 statements. [2025-02-07 22:58:35,367 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:58:35,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:58:35,977 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-07 22:58:35,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:58:35,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575992802] [2025-02-07 22:58:35,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575992802] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:58:35,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:58:35,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 22:58:35,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683884293] [2025-02-07 22:58:35,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:58:35,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 22:58:35,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:58:35,978 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 22:58:35,978 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 22:58:35,978 INFO L87 Difference]: Start difference. First operand 1512 states and 2211 transitions. Second operand has 4 states, 4 states have (on average 94.75) internal successors, (379), 4 states have internal predecessors, (379), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:58:36,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:58:36,544 INFO L93 Difference]: Finished difference Result 2731 states and 3983 transitions. [2025-02-07 22:58:36,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:58:36,544 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 94.75) internal successors, (379), 4 states have internal predecessors, (379), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 391 [2025-02-07 22:58:36,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:58:36,546 INFO L225 Difference]: With dead ends: 2731 [2025-02-07 22:58:36,546 INFO L226 Difference]: Without dead ends: 1512 [2025-02-07 22:58:36,547 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:58:36,547 INFO L435 NwaCegarLoop]: 1768 mSDtfsCounter, 1986 mSDsluCounter, 1769 mSDsCounter, 0 mSdLazyCounter, 878 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1986 SdHoareTripleChecker+Valid, 3537 SdHoareTripleChecker+Invalid, 878 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 878 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-07 22:58:36,547 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1986 Valid, 3537 Invalid, 878 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 878 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-07 22:58:36,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1512 states. [2025-02-07 22:58:36,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1512 to 1512. [2025-02-07 22:58:36,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1512 states, 1507 states have (on average 1.462508294625083) internal successors, (2204), 1507 states have internal predecessors, (2204), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-07 22:58:36,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1512 states to 1512 states and 2210 transitions. [2025-02-07 22:58:36,557 INFO L78 Accepts]: Start accepts. Automaton has 1512 states and 2210 transitions. Word has length 391 [2025-02-07 22:58:36,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:58:36,557 INFO L471 AbstractCegarLoop]: Abstraction has 1512 states and 2210 transitions. [2025-02-07 22:58:36,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 94.75) internal successors, (379), 4 states have internal predecessors, (379), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:58:36,558 INFO L276 IsEmpty]: Start isEmpty. Operand 1512 states and 2210 transitions. [2025-02-07 22:58:36,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 393 [2025-02-07 22:58:36,559 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:58:36,559 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-07 22:58:36,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2025-02-07 22:58:36,559 INFO L396 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:58:36,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:58:36,560 INFO L85 PathProgramCache]: Analyzing trace with hash -540026303, now seen corresponding path program 1 times [2025-02-07 22:58:36,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:58:36,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601013221] [2025-02-07 22:58:36,560 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:58:36,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:58:36,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 392 statements into 1 equivalence classes. [2025-02-07 22:58:36,739 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 392 of 392 statements. [2025-02-07 22:58:36,739 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:58:36,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:58:36,988 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-07 22:58:36,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:58:36,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601013221] [2025-02-07 22:58:36,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601013221] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:58:36,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:58:36,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 22:58:36,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541717301] [2025-02-07 22:58:36,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:58:36,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:58:36,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:58:36,990 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:58:36,990 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:58:36,990 INFO L87 Difference]: Start difference. First operand 1512 states and 2210 transitions. Second operand has 5 states, 5 states have (on average 76.0) internal successors, (380), 5 states have internal predecessors, (380), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:58:37,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:58:37,644 INFO L93 Difference]: Finished difference Result 2741 states and 3995 transitions. [2025-02-07 22:58:37,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 22:58:37,644 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 76.0) internal successors, (380), 5 states have internal predecessors, (380), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 392 [2025-02-07 22:58:37,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:58:37,646 INFO L225 Difference]: With dead ends: 2741 [2025-02-07 22:58:37,646 INFO L226 Difference]: Without dead ends: 1512 [2025-02-07 22:58:37,646 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-07 22:58:37,647 INFO L435 NwaCegarLoop]: 1823 mSDtfsCounter, 2005 mSDsluCounter, 3594 mSDsCounter, 0 mSdLazyCounter, 1203 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2005 SdHoareTripleChecker+Valid, 5417 SdHoareTripleChecker+Invalid, 1207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-07 22:58:37,647 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2005 Valid, 5417 Invalid, 1207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1203 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-07 22:58:37,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1512 states. [2025-02-07 22:58:37,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1512 to 1512. [2025-02-07 22:58:37,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1512 states, 1507 states have (on average 1.4618447246184472) internal successors, (2203), 1507 states have internal predecessors, (2203), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-07 22:58:37,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1512 states to 1512 states and 2209 transitions. [2025-02-07 22:58:37,657 INFO L78 Accepts]: Start accepts. Automaton has 1512 states and 2209 transitions. Word has length 392 [2025-02-07 22:58:37,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:58:37,657 INFO L471 AbstractCegarLoop]: Abstraction has 1512 states and 2209 transitions. [2025-02-07 22:58:37,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 76.0) internal successors, (380), 5 states have internal predecessors, (380), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:58:37,657 INFO L276 IsEmpty]: Start isEmpty. Operand 1512 states and 2209 transitions. [2025-02-07 22:58:37,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 394 [2025-02-07 22:58:37,658 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:58:37,659 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-07 22:58:37,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2025-02-07 22:58:37,659 INFO L396 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:58:37,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:58:37,659 INFO L85 PathProgramCache]: Analyzing trace with hash 333989115, now seen corresponding path program 1 times [2025-02-07 22:58:37,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:58:37,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596256799] [2025-02-07 22:58:37,659 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:58:37,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:58:37,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 393 statements into 1 equivalence classes. [2025-02-07 22:58:37,835 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 393 of 393 statements. [2025-02-07 22:58:37,836 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:58:37,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:58:38,135 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-07 22:58:38,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:58:38,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596256799] [2025-02-07 22:58:38,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596256799] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:58:38,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:58:38,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 22:58:38,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920501999] [2025-02-07 22:58:38,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:58:38,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:58:38,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:58:38,138 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:58:38,138 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:58:38,138 INFO L87 Difference]: Start difference. First operand 1512 states and 2209 transitions. Second operand has 5 states, 5 states have (on average 76.2) internal successors, (381), 5 states have internal predecessors, (381), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:58:38,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:58:38,644 INFO L93 Difference]: Finished difference Result 2731 states and 3979 transitions. [2025-02-07 22:58:38,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:58:38,644 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 76.2) internal successors, (381), 5 states have internal predecessors, (381), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 393 [2025-02-07 22:58:38,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:58:38,646 INFO L225 Difference]: With dead ends: 2731 [2025-02-07 22:58:38,646 INFO L226 Difference]: Without dead ends: 1512 [2025-02-07 22:58:38,647 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-02-07 22:58:38,650 INFO L435 NwaCegarLoop]: 1768 mSDtfsCounter, 2194 mSDsluCounter, 1775 mSDsCounter, 0 mSdLazyCounter, 874 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2197 SdHoareTripleChecker+Valid, 3543 SdHoareTripleChecker+Invalid, 875 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 874 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-07 22:58:38,652 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2197 Valid, 3543 Invalid, 875 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 874 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-07 22:58:38,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1512 states. [2025-02-07 22:58:38,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1512 to 1512. [2025-02-07 22:58:38,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1512 states, 1507 states have (on average 1.4611811546118116) internal successors, (2202), 1507 states have internal predecessors, (2202), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-07 22:58:38,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1512 states to 1512 states and 2208 transitions. [2025-02-07 22:58:38,663 INFO L78 Accepts]: Start accepts. Automaton has 1512 states and 2208 transitions. Word has length 393 [2025-02-07 22:58:38,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:58:38,663 INFO L471 AbstractCegarLoop]: Abstraction has 1512 states and 2208 transitions. [2025-02-07 22:58:38,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 76.2) internal successors, (381), 5 states have internal predecessors, (381), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:58:38,663 INFO L276 IsEmpty]: Start isEmpty. Operand 1512 states and 2208 transitions. [2025-02-07 22:58:38,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 395 [2025-02-07 22:58:38,665 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:58:38,665 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-07 22:58:38,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2025-02-07 22:58:38,665 INFO L396 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:58:38,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:58:38,666 INFO L85 PathProgramCache]: Analyzing trace with hash 2068946374, now seen corresponding path program 1 times [2025-02-07 22:58:38,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:58:38,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547302557] [2025-02-07 22:58:38,666 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:58:38,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:58:38,738 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 394 statements into 1 equivalence classes. [2025-02-07 22:58:38,844 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 394 of 394 statements. [2025-02-07 22:58:38,844 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:58:38,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:58:39,104 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-07 22:58:39,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:58:39,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547302557] [2025-02-07 22:58:39,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547302557] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:58:39,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:58:39,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 22:58:39,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937943665] [2025-02-07 22:58:39,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:58:39,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:58:39,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:58:39,106 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:58:39,108 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:58:39,108 INFO L87 Difference]: Start difference. First operand 1512 states and 2208 transitions. Second operand has 5 states, 5 states have (on average 76.4) internal successors, (382), 5 states have internal predecessors, (382), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:58:39,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:58:39,655 INFO L93 Difference]: Finished difference Result 2731 states and 3977 transitions. [2025-02-07 22:58:39,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:58:39,656 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 76.4) internal successors, (382), 5 states have internal predecessors, (382), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 394 [2025-02-07 22:58:39,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:58:39,657 INFO L225 Difference]: With dead ends: 2731 [2025-02-07 22:58:39,657 INFO L226 Difference]: Without dead ends: 1512 [2025-02-07 22:58:39,658 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-02-07 22:58:39,658 INFO L435 NwaCegarLoop]: 1768 mSDtfsCounter, 4175 mSDsluCounter, 1769 mSDsCounter, 0 mSdLazyCounter, 872 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4178 SdHoareTripleChecker+Valid, 3537 SdHoareTripleChecker+Invalid, 873 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 872 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-07 22:58:39,658 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4178 Valid, 3537 Invalid, 873 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 872 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-07 22:58:39,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1512 states. [2025-02-07 22:58:39,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1512 to 1512. [2025-02-07 22:58:39,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1512 states, 1507 states have (on average 1.460517584605176) internal successors, (2201), 1507 states have internal predecessors, (2201), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-07 22:58:39,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1512 states to 1512 states and 2207 transitions. [2025-02-07 22:58:39,667 INFO L78 Accepts]: Start accepts. Automaton has 1512 states and 2207 transitions. Word has length 394 [2025-02-07 22:58:39,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:58:39,668 INFO L471 AbstractCegarLoop]: Abstraction has 1512 states and 2207 transitions. [2025-02-07 22:58:39,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 76.4) internal successors, (382), 5 states have internal predecessors, (382), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:58:39,668 INFO L276 IsEmpty]: Start isEmpty. Operand 1512 states and 2207 transitions. [2025-02-07 22:58:39,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 396 [2025-02-07 22:58:39,669 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:58:39,669 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-07 22:58:39,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2025-02-07 22:58:39,670 INFO L396 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:58:39,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:58:39,670 INFO L85 PathProgramCache]: Analyzing trace with hash 1439700960, now seen corresponding path program 1 times [2025-02-07 22:58:39,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:58:39,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835439260] [2025-02-07 22:58:39,670 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:58:39,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:58:39,740 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 395 statements into 1 equivalence classes. [2025-02-07 22:58:39,846 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 395 of 395 statements. [2025-02-07 22:58:39,846 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:58:39,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:58:40,128 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-07 22:58:40,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:58:40,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835439260] [2025-02-07 22:58:40,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835439260] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:58:40,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:58:40,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 22:58:40,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237840199] [2025-02-07 22:58:40,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:58:40,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:58:40,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:58:40,130 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:58:40,130 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:58:40,130 INFO L87 Difference]: Start difference. First operand 1512 states and 2207 transitions. Second operand has 5 states, 5 states have (on average 76.6) internal successors, (383), 5 states have internal predecessors, (383), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:58:40,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:58:40,691 INFO L93 Difference]: Finished difference Result 2731 states and 3975 transitions. [2025-02-07 22:58:40,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:58:40,691 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 76.6) internal successors, (383), 5 states have internal predecessors, (383), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 395 [2025-02-07 22:58:40,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:58:40,693 INFO L225 Difference]: With dead ends: 2731 [2025-02-07 22:58:40,693 INFO L226 Difference]: Without dead ends: 1512 [2025-02-07 22:58:40,693 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-02-07 22:58:40,694 INFO L435 NwaCegarLoop]: 1768 mSDtfsCounter, 2186 mSDsluCounter, 1775 mSDsCounter, 0 mSdLazyCounter, 870 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2189 SdHoareTripleChecker+Valid, 3543 SdHoareTripleChecker+Invalid, 871 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 870 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-07 22:58:40,694 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2189 Valid, 3543 Invalid, 871 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 870 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-07 22:58:40,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1512 states. [2025-02-07 22:58:40,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1512 to 1512. [2025-02-07 22:58:40,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1512 states, 1507 states have (on average 1.4598540145985401) internal successors, (2200), 1507 states have internal predecessors, (2200), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-07 22:58:40,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1512 states to 1512 states and 2206 transitions. [2025-02-07 22:58:40,704 INFO L78 Accepts]: Start accepts. Automaton has 1512 states and 2206 transitions. Word has length 395 [2025-02-07 22:58:40,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:58:40,704 INFO L471 AbstractCegarLoop]: Abstraction has 1512 states and 2206 transitions. [2025-02-07 22:58:40,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 76.6) internal successors, (383), 5 states have internal predecessors, (383), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:58:40,704 INFO L276 IsEmpty]: Start isEmpty. Operand 1512 states and 2206 transitions. [2025-02-07 22:58:40,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 397 [2025-02-07 22:58:40,705 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:58:40,705 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-07 22:58:40,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2025-02-07 22:58:40,706 INFO L396 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:58:40,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:58:40,706 INFO L85 PathProgramCache]: Analyzing trace with hash -1873266741, now seen corresponding path program 1 times [2025-02-07 22:58:40,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:58:40,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799249283] [2025-02-07 22:58:40,706 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:58:40,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:58:40,779 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 396 statements into 1 equivalence classes. [2025-02-07 22:58:40,884 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 396 of 396 statements. [2025-02-07 22:58:40,884 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:58:40,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:58:41,136 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-07 22:58:41,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:58:41,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799249283] [2025-02-07 22:58:41,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799249283] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:58:41,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:58:41,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 22:58:41,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593016607] [2025-02-07 22:58:41,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:58:41,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:58:41,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:58:41,137 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:58:41,137 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:58:41,138 INFO L87 Difference]: Start difference. First operand 1512 states and 2206 transitions. Second operand has 5 states, 5 states have (on average 76.8) internal successors, (384), 5 states have internal predecessors, (384), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:58:41,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:58:41,599 INFO L93 Difference]: Finished difference Result 2731 states and 3973 transitions. [2025-02-07 22:58:41,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:58:41,600 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 76.8) internal successors, (384), 5 states have internal predecessors, (384), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 396 [2025-02-07 22:58:41,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:58:41,601 INFO L225 Difference]: With dead ends: 2731 [2025-02-07 22:58:41,601 INFO L226 Difference]: Without dead ends: 1512 [2025-02-07 22:58:41,602 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-02-07 22:58:41,602 INFO L435 NwaCegarLoop]: 1768 mSDtfsCounter, 4159 mSDsluCounter, 1769 mSDsCounter, 0 mSdLazyCounter, 868 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4162 SdHoareTripleChecker+Valid, 3537 SdHoareTripleChecker+Invalid, 869 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 868 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-07 22:58:41,602 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4162 Valid, 3537 Invalid, 869 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 868 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-07 22:58:41,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1512 states. [2025-02-07 22:58:41,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1512 to 1512. [2025-02-07 22:58:41,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1512 states, 1507 states have (on average 1.4591904445919044) internal successors, (2199), 1507 states have internal predecessors, (2199), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-07 22:58:41,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1512 states to 1512 states and 2205 transitions. [2025-02-07 22:58:41,612 INFO L78 Accepts]: Start accepts. Automaton has 1512 states and 2205 transitions. Word has length 396 [2025-02-07 22:58:41,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:58:41,612 INFO L471 AbstractCegarLoop]: Abstraction has 1512 states and 2205 transitions. [2025-02-07 22:58:41,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 76.8) internal successors, (384), 5 states have internal predecessors, (384), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:58:41,612 INFO L276 IsEmpty]: Start isEmpty. Operand 1512 states and 2205 transitions. [2025-02-07 22:58:41,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 398 [2025-02-07 22:58:41,613 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:58:41,614 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-07 22:58:41,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2025-02-07 22:58:41,615 INFO L396 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:58:41,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:58:41,615 INFO L85 PathProgramCache]: Analyzing trace with hash 420239685, now seen corresponding path program 1 times [2025-02-07 22:58:41,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:58:41,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626126545] [2025-02-07 22:58:41,615 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:58:41,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:58:41,692 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 397 statements into 1 equivalence classes. [2025-02-07 22:58:41,800 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 397 of 397 statements. [2025-02-07 22:58:41,800 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:58:41,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:58:42,088 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-07 22:58:42,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:58:42,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626126545] [2025-02-07 22:58:42,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626126545] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:58:42,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:58:42,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 22:58:42,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664257380] [2025-02-07 22:58:42,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:58:42,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:58:42,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:58:42,090 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:58:42,090 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:58:42,090 INFO L87 Difference]: Start difference. First operand 1512 states and 2205 transitions. Second operand has 5 states, 5 states have (on average 77.0) internal successors, (385), 5 states have internal predecessors, (385), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:58:42,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:58:42,527 INFO L93 Difference]: Finished difference Result 2731 states and 3971 transitions. [2025-02-07 22:58:42,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:58:42,527 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 77.0) internal successors, (385), 5 states have internal predecessors, (385), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 397 [2025-02-07 22:58:42,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:58:42,529 INFO L225 Difference]: With dead ends: 2731 [2025-02-07 22:58:42,529 INFO L226 Difference]: Without dead ends: 1512 [2025-02-07 22:58:42,529 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-02-07 22:58:42,529 INFO L435 NwaCegarLoop]: 1768 mSDtfsCounter, 2175 mSDsluCounter, 1775 mSDsCounter, 0 mSdLazyCounter, 866 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2178 SdHoareTripleChecker+Valid, 3543 SdHoareTripleChecker+Invalid, 867 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 866 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-07 22:58:42,530 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2178 Valid, 3543 Invalid, 867 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 866 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-07 22:58:42,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1512 states. [2025-02-07 22:58:42,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1512 to 1512. [2025-02-07 22:58:42,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1512 states, 1507 states have (on average 1.4585268745852686) internal successors, (2198), 1507 states have internal predecessors, (2198), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-07 22:58:42,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1512 states to 1512 states and 2204 transitions. [2025-02-07 22:58:42,540 INFO L78 Accepts]: Start accepts. Automaton has 1512 states and 2204 transitions. Word has length 397 [2025-02-07 22:58:42,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:58:42,540 INFO L471 AbstractCegarLoop]: Abstraction has 1512 states and 2204 transitions. [2025-02-07 22:58:42,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 77.0) internal successors, (385), 5 states have internal predecessors, (385), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:58:42,540 INFO L276 IsEmpty]: Start isEmpty. Operand 1512 states and 2204 transitions. [2025-02-07 22:58:42,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 399 [2025-02-07 22:58:42,541 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:58:42,541 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-07 22:58:42,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2025-02-07 22:58:42,541 INFO L396 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:58:42,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:58:42,542 INFO L85 PathProgramCache]: Analyzing trace with hash 1650750763, now seen corresponding path program 1 times [2025-02-07 22:58:42,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:58:42,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279869636] [2025-02-07 22:58:42,542 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:58:42,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:58:42,614 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 398 statements into 1 equivalence classes. [2025-02-07 22:58:42,722 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 398 of 398 statements. [2025-02-07 22:58:42,722 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:58:42,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:58:42,999 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-07 22:58:42,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:58:42,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279869636] [2025-02-07 22:58:42,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279869636] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:58:42,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:58:42,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 22:58:42,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797858705] [2025-02-07 22:58:42,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:58:43,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:58:43,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:58:43,000 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:58:43,000 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:58:43,000 INFO L87 Difference]: Start difference. First operand 1512 states and 2204 transitions. Second operand has 5 states, 5 states have (on average 77.2) internal successors, (386), 5 states have internal predecessors, (386), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:58:43,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:58:43,539 INFO L93 Difference]: Finished difference Result 2731 states and 3969 transitions. [2025-02-07 22:58:43,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:58:43,539 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 77.2) internal successors, (386), 5 states have internal predecessors, (386), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 398 [2025-02-07 22:58:43,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:58:43,541 INFO L225 Difference]: With dead ends: 2731 [2025-02-07 22:58:43,541 INFO L226 Difference]: Without dead ends: 1512 [2025-02-07 22:58:43,542 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-02-07 22:58:43,542 INFO L435 NwaCegarLoop]: 1768 mSDtfsCounter, 4137 mSDsluCounter, 1769 mSDsCounter, 0 mSdLazyCounter, 864 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4140 SdHoareTripleChecker+Valid, 3537 SdHoareTripleChecker+Invalid, 865 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 864 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-07 22:58:43,542 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4140 Valid, 3537 Invalid, 865 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 864 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-07 22:58:43,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1512 states. [2025-02-07 22:58:43,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1512 to 1512. [2025-02-07 22:58:43,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1512 states, 1507 states have (on average 1.4578633045786331) internal successors, (2197), 1507 states have internal predecessors, (2197), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-07 22:58:43,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1512 states to 1512 states and 2203 transitions. [2025-02-07 22:58:43,553 INFO L78 Accepts]: Start accepts. Automaton has 1512 states and 2203 transitions. Word has length 398 [2025-02-07 22:58:43,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:58:43,553 INFO L471 AbstractCegarLoop]: Abstraction has 1512 states and 2203 transitions. [2025-02-07 22:58:43,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 77.2) internal successors, (386), 5 states have internal predecessors, (386), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:58:43,554 INFO L276 IsEmpty]: Start isEmpty. Operand 1512 states and 2203 transitions. [2025-02-07 22:58:43,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 400 [2025-02-07 22:58:43,555 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:58:43,555 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-07 22:58:43,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2025-02-07 22:58:43,555 INFO L396 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:58:43,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:58:43,555 INFO L85 PathProgramCache]: Analyzing trace with hash 1281875360, now seen corresponding path program 1 times [2025-02-07 22:58:43,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:58:43,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488731529] [2025-02-07 22:58:43,556 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:58:43,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:58:43,629 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 399 statements into 1 equivalence classes. [2025-02-07 22:58:43,768 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 399 of 399 statements. [2025-02-07 22:58:43,768 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:58:43,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:58:44,286 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-07 22:58:44,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:58:44,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488731529] [2025-02-07 22:58:44,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488731529] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:58:44,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:58:44,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 22:58:44,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388762932] [2025-02-07 22:58:44,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:58:44,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 22:58:44,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:58:44,288 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 22:58:44,288 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 22:58:44,288 INFO L87 Difference]: Start difference. First operand 1512 states and 2203 transitions. Second operand has 4 states, 4 states have (on average 96.75) internal successors, (387), 4 states have internal predecessors, (387), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:58:44,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:58:44,841 INFO L93 Difference]: Finished difference Result 2731 states and 3967 transitions. [2025-02-07 22:58:44,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:58:44,841 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 96.75) internal successors, (387), 4 states have internal predecessors, (387), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 399 [2025-02-07 22:58:44,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:58:44,843 INFO L225 Difference]: With dead ends: 2731 [2025-02-07 22:58:44,843 INFO L226 Difference]: Without dead ends: 1512 [2025-02-07 22:58:44,844 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:58:44,844 INFO L435 NwaCegarLoop]: 1792 mSDtfsCounter, 1994 mSDsluCounter, 1793 mSDsCounter, 0 mSdLazyCounter, 814 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1994 SdHoareTripleChecker+Valid, 3585 SdHoareTripleChecker+Invalid, 814 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 814 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-07 22:58:44,844 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1994 Valid, 3585 Invalid, 814 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 814 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-07 22:58:44,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1512 states. [2025-02-07 22:58:44,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1512 to 1512. [2025-02-07 22:58:44,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1512 states, 1507 states have (on average 1.4571997345719974) internal successors, (2196), 1507 states have internal predecessors, (2196), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-07 22:58:44,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1512 states to 1512 states and 2202 transitions. [2025-02-07 22:58:44,863 INFO L78 Accepts]: Start accepts. Automaton has 1512 states and 2202 transitions. Word has length 399 [2025-02-07 22:58:44,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:58:44,863 INFO L471 AbstractCegarLoop]: Abstraction has 1512 states and 2202 transitions. [2025-02-07 22:58:44,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 96.75) internal successors, (387), 4 states have internal predecessors, (387), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:58:44,863 INFO L276 IsEmpty]: Start isEmpty. Operand 1512 states and 2202 transitions. [2025-02-07 22:58:44,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 401 [2025-02-07 22:58:44,865 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:58:44,866 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-07 22:58:44,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2025-02-07 22:58:44,866 INFO L396 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:58:44,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:58:44,867 INFO L85 PathProgramCache]: Analyzing trace with hash -195417643, now seen corresponding path program 1 times [2025-02-07 22:58:44,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:58:44,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813571312] [2025-02-07 22:58:44,867 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:58:44,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:58:44,972 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 400 statements into 1 equivalence classes. [2025-02-07 22:58:45,113 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 400 of 400 statements. [2025-02-07 22:58:45,114 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:58:45,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:58:45,363 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-07 22:58:45,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:58:45,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813571312] [2025-02-07 22:58:45,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813571312] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:58:45,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:58:45,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 22:58:45,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255921023] [2025-02-07 22:58:45,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:58:45,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:58:45,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:58:45,365 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:58:45,365 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:58:45,365 INFO L87 Difference]: Start difference. First operand 1512 states and 2202 transitions. Second operand has 5 states, 5 states have (on average 77.6) internal successors, (388), 5 states have internal predecessors, (388), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:58:45,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:58:45,966 INFO L93 Difference]: Finished difference Result 2733 states and 3967 transitions. [2025-02-07 22:58:45,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 22:58:45,967 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 77.6) internal successors, (388), 5 states have internal predecessors, (388), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 400 [2025-02-07 22:58:45,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:58:45,969 INFO L225 Difference]: With dead ends: 2733 [2025-02-07 22:58:45,969 INFO L226 Difference]: Without dead ends: 1512 [2025-02-07 22:58:45,970 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-07 22:58:45,970 INFO L435 NwaCegarLoop]: 1819 mSDtfsCounter, 1997 mSDsluCounter, 3614 mSDsCounter, 0 mSdLazyCounter, 1163 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1997 SdHoareTripleChecker+Valid, 5433 SdHoareTripleChecker+Invalid, 1163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-07 22:58:45,970 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1997 Valid, 5433 Invalid, 1163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1163 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-07 22:58:45,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1512 states. [2025-02-07 22:58:45,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1512 to 1512. [2025-02-07 22:58:45,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1512 states, 1507 states have (on average 1.4565361645653616) internal successors, (2195), 1507 states have internal predecessors, (2195), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-07 22:58:45,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1512 states to 1512 states and 2201 transitions. [2025-02-07 22:58:45,983 INFO L78 Accepts]: Start accepts. Automaton has 1512 states and 2201 transitions. Word has length 400 [2025-02-07 22:58:45,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:58:45,983 INFO L471 AbstractCegarLoop]: Abstraction has 1512 states and 2201 transitions. [2025-02-07 22:58:45,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 77.6) internal successors, (388), 5 states have internal predecessors, (388), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:58:45,984 INFO L276 IsEmpty]: Start isEmpty. Operand 1512 states and 2201 transitions. [2025-02-07 22:58:45,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 402 [2025-02-07 22:58:45,985 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:58:45,988 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-07 22:58:45,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2025-02-07 22:58:45,988 INFO L396 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:58:45,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:58:45,989 INFO L85 PathProgramCache]: Analyzing trace with hash 852238843, now seen corresponding path program 1 times [2025-02-07 22:58:45,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:58:45,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470425787] [2025-02-07 22:58:45,989 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:58:45,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:58:46,071 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 401 statements into 1 equivalence classes. [2025-02-07 22:58:46,191 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 401 of 401 statements. [2025-02-07 22:58:46,193 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:58:46,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:58:46,470 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-07 22:58:46,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:58:46,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470425787] [2025-02-07 22:58:46,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470425787] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:58:46,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:58:46,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 22:58:46,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222130857] [2025-02-07 22:58:46,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:58:46,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:58:46,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:58:46,473 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:58:46,473 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:58:46,473 INFO L87 Difference]: Start difference. First operand 1512 states and 2201 transitions. Second operand has 5 states, 5 states have (on average 77.8) internal successors, (389), 5 states have internal predecessors, (389), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:58:47,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:58:47,016 INFO L93 Difference]: Finished difference Result 2731 states and 3963 transitions. [2025-02-07 22:58:47,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:58:47,016 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 77.8) internal successors, (389), 5 states have internal predecessors, (389), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 401 [2025-02-07 22:58:47,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:58:47,018 INFO L225 Difference]: With dead ends: 2731 [2025-02-07 22:58:47,018 INFO L226 Difference]: Without dead ends: 1512 [2025-02-07 22:58:47,019 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-02-07 22:58:47,019 INFO L435 NwaCegarLoop]: 1792 mSDtfsCounter, 4169 mSDsluCounter, 1793 mSDsCounter, 0 mSdLazyCounter, 810 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4172 SdHoareTripleChecker+Valid, 3585 SdHoareTripleChecker+Invalid, 811 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 810 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-07 22:58:47,019 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4172 Valid, 3585 Invalid, 811 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 810 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-07 22:58:47,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1512 states. [2025-02-07 22:58:47,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1512 to 1512. [2025-02-07 22:58:47,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1512 states, 1507 states have (on average 1.4558725945587259) internal successors, (2194), 1507 states have internal predecessors, (2194), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-07 22:58:47,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1512 states to 1512 states and 2200 transitions. [2025-02-07 22:58:47,076 INFO L78 Accepts]: Start accepts. Automaton has 1512 states and 2200 transitions. Word has length 401 [2025-02-07 22:58:47,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:58:47,077 INFO L471 AbstractCegarLoop]: Abstraction has 1512 states and 2200 transitions. [2025-02-07 22:58:47,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 77.8) internal successors, (389), 5 states have internal predecessors, (389), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:58:47,077 INFO L276 IsEmpty]: Start isEmpty. Operand 1512 states and 2200 transitions. [2025-02-07 22:58:47,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 403 [2025-02-07 22:58:47,078 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:58:47,078 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-07 22:58:47,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2025-02-07 22:58:47,078 INFO L396 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:58:47,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:58:47,079 INFO L85 PathProgramCache]: Analyzing trace with hash -1872700235, now seen corresponding path program 1 times [2025-02-07 22:58:47,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:58:47,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204408535] [2025-02-07 22:58:47,079 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:58:47,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:58:47,160 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 402 statements into 1 equivalence classes. [2025-02-07 22:58:47,276 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 402 of 402 statements. [2025-02-07 22:58:47,276 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:58:47,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:58:47,571 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-07 22:58:47,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:58:47,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204408535] [2025-02-07 22:58:47,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204408535] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:58:47,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:58:47,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 22:58:47,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765739265] [2025-02-07 22:58:47,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:58:47,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:58:47,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:58:47,575 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:58:47,575 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:58:47,575 INFO L87 Difference]: Start difference. First operand 1512 states and 2200 transitions. Second operand has 5 states, 5 states have (on average 78.0) internal successors, (390), 5 states have internal predecessors, (390), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:58:48,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:58:48,101 INFO L93 Difference]: Finished difference Result 2731 states and 3961 transitions. [2025-02-07 22:58:48,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:58:48,102 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 78.0) internal successors, (390), 5 states have internal predecessors, (390), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 402 [2025-02-07 22:58:48,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:58:48,103 INFO L225 Difference]: With dead ends: 2731 [2025-02-07 22:58:48,103 INFO L226 Difference]: Without dead ends: 1512 [2025-02-07 22:58:48,104 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-02-07 22:58:48,104 INFO L435 NwaCegarLoop]: 1792 mSDtfsCounter, 4161 mSDsluCounter, 1793 mSDsCounter, 0 mSdLazyCounter, 808 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4164 SdHoareTripleChecker+Valid, 3585 SdHoareTripleChecker+Invalid, 809 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 808 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-07 22:58:48,104 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4164 Valid, 3585 Invalid, 809 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 808 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-07 22:58:48,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1512 states. [2025-02-07 22:58:48,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1512 to 1512. [2025-02-07 22:58:48,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1512 states, 1507 states have (on average 1.4552090245520903) internal successors, (2193), 1507 states have internal predecessors, (2193), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-07 22:58:48,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1512 states to 1512 states and 2199 transitions. [2025-02-07 22:58:48,114 INFO L78 Accepts]: Start accepts. Automaton has 1512 states and 2199 transitions. Word has length 402 [2025-02-07 22:58:48,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:58:48,115 INFO L471 AbstractCegarLoop]: Abstraction has 1512 states and 2199 transitions. [2025-02-07 22:58:48,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 78.0) internal successors, (390), 5 states have internal predecessors, (390), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:58:48,115 INFO L276 IsEmpty]: Start isEmpty. Operand 1512 states and 2199 transitions. [2025-02-07 22:58:48,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 404 [2025-02-07 22:58:48,116 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:58:48,116 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-07 22:58:48,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2025-02-07 22:58:48,116 INFO L396 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:58:48,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:58:48,117 INFO L85 PathProgramCache]: Analyzing trace with hash -1055580202, now seen corresponding path program 1 times [2025-02-07 22:58:48,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:58:48,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388694225] [2025-02-07 22:58:48,117 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:58:48,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:58:48,195 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 403 statements into 1 equivalence classes. [2025-02-07 22:58:48,344 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 403 of 403 statements. [2025-02-07 22:58:48,344 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:58:48,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:58:48,761 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-07 22:58:48,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:58:48,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388694225] [2025-02-07 22:58:48,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388694225] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:58:48,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:58:48,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 22:58:48,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683296296] [2025-02-07 22:58:48,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:58:48,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 22:58:48,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:58:48,762 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 22:58:48,762 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 22:58:48,762 INFO L87 Difference]: Start difference. First operand 1512 states and 2199 transitions. Second operand has 4 states, 4 states have (on average 97.75) internal successors, (391), 4 states have internal predecessors, (391), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:58:49,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:58:49,157 INFO L93 Difference]: Finished difference Result 2731 states and 3959 transitions. [2025-02-07 22:58:49,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:58:49,158 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 97.75) internal successors, (391), 4 states have internal predecessors, (391), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 403 [2025-02-07 22:58:49,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:58:49,159 INFO L225 Difference]: With dead ends: 2731 [2025-02-07 22:58:49,159 INFO L226 Difference]: Without dead ends: 1512 [2025-02-07 22:58:49,160 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-02-07 22:58:49,161 INFO L435 NwaCegarLoop]: 1804 mSDtfsCounter, 1995 mSDsluCounter, 1805 mSDsCounter, 0 mSdLazyCounter, 780 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1995 SdHoareTripleChecker+Valid, 3609 SdHoareTripleChecker+Invalid, 781 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 780 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-07 22:58:49,161 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1995 Valid, 3609 Invalid, 781 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 780 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-07 22:58:49,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1512 states. [2025-02-07 22:58:49,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1512 to 1512. [2025-02-07 22:58:49,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1512 states, 1507 states have (on average 1.4538818845388188) internal successors, (2191), 1507 states have internal predecessors, (2191), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-07 22:58:49,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1512 states to 1512 states and 2197 transitions. [2025-02-07 22:58:49,173 INFO L78 Accepts]: Start accepts. Automaton has 1512 states and 2197 transitions. Word has length 403 [2025-02-07 22:58:49,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:58:49,173 INFO L471 AbstractCegarLoop]: Abstraction has 1512 states and 2197 transitions. [2025-02-07 22:58:49,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 97.75) internal successors, (391), 4 states have internal predecessors, (391), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:58:49,173 INFO L276 IsEmpty]: Start isEmpty. Operand 1512 states and 2197 transitions. [2025-02-07 22:58:49,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 406 [2025-02-07 22:58:49,175 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:58:49,175 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-07 22:58:49,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2025-02-07 22:58:49,175 INFO L396 AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:58:49,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:58:49,176 INFO L85 PathProgramCache]: Analyzing trace with hash -1581104009, now seen corresponding path program 1 times [2025-02-07 22:58:49,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:58:49,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108550105] [2025-02-07 22:58:49,176 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:58:49,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:58:49,291 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 405 statements into 1 equivalence classes. [2025-02-07 22:58:49,434 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 405 of 405 statements. [2025-02-07 22:58:49,434 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:58:49,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:58:49,896 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-07 22:58:49,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:58:49,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108550105] [2025-02-07 22:58:49,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108550105] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:58:49,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:58:49,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 22:58:49,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812970818] [2025-02-07 22:58:49,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:58:49,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:58:49,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:58:49,897 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:58:49,897 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:58:49,897 INFO L87 Difference]: Start difference. First operand 1512 states and 2197 transitions. Second operand has 5 states, 5 states have (on average 78.6) internal successors, (393), 5 states have internal predecessors, (393), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:58:50,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:58:50,297 INFO L93 Difference]: Finished difference Result 2731 states and 3955 transitions. [2025-02-07 22:58:50,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:58:50,298 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 78.6) internal successors, (393), 5 states have internal predecessors, (393), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 405 [2025-02-07 22:58:50,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:58:50,299 INFO L225 Difference]: With dead ends: 2731 [2025-02-07 22:58:50,299 INFO L226 Difference]: Without dead ends: 1512 [2025-02-07 22:58:50,300 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-02-07 22:58:50,300 INFO L435 NwaCegarLoop]: 1804 mSDtfsCounter, 4169 mSDsluCounter, 1805 mSDsCounter, 0 mSdLazyCounter, 778 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4172 SdHoareTripleChecker+Valid, 3609 SdHoareTripleChecker+Invalid, 779 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 778 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-07 22:58:50,300 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4172 Valid, 3609 Invalid, 779 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 778 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-07 22:58:50,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1512 states. [2025-02-07 22:58:50,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1512 to 1512. [2025-02-07 22:58:50,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1512 states, 1507 states have (on average 1.453218314532183) internal successors, (2190), 1507 states have internal predecessors, (2190), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-07 22:58:50,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1512 states to 1512 states and 2196 transitions. [2025-02-07 22:58:50,313 INFO L78 Accepts]: Start accepts. Automaton has 1512 states and 2196 transitions. Word has length 405 [2025-02-07 22:58:50,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:58:50,313 INFO L471 AbstractCegarLoop]: Abstraction has 1512 states and 2196 transitions. [2025-02-07 22:58:50,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 78.6) internal successors, (393), 5 states have internal predecessors, (393), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:58:50,313 INFO L276 IsEmpty]: Start isEmpty. Operand 1512 states and 2196 transitions. [2025-02-07 22:58:50,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 407 [2025-02-07 22:58:50,315 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:58:50,315 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-07 22:58:50,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2025-02-07 22:58:50,315 INFO L396 AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:58:50,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:58:50,315 INFO L85 PathProgramCache]: Analyzing trace with hash -1577681772, now seen corresponding path program 1 times [2025-02-07 22:58:50,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:58:50,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207256942] [2025-02-07 22:58:50,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:58:50,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:58:50,392 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 406 statements into 1 equivalence classes. [2025-02-07 22:58:50,559 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 406 of 406 statements. [2025-02-07 22:58:50,559 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:58:50,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat