./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_usb_phy_1.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc 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.vcegar_QF_BV_usb_phy_1.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 d1b32aaddfcc4461b9b835c36b224846d44f13a8bf0904556358f96663c9ebca --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 20:10:33,269 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 20:10:33,324 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-02-05 20:10:33,330 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 20:10:33,333 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 20:10:33,355 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 20:10:33,356 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 20:10:33,356 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 20:10:33,356 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 20:10:33,356 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 20:10:33,357 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 20:10:33,357 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 20:10:33,357 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 20:10:33,358 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 20:10:33,358 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 20:10:33,358 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 20:10:33,358 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 20:10:33,358 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 20:10:33,358 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 20:10:33,359 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 20:10:33,359 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 20:10:33,359 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 20:10:33,359 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 20:10:33,359 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 20:10:33,359 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 20:10:33,359 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 20:10:33,359 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 20:10:33,359 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 20:10:33,359 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 20:10:33,360 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 20:10:33,360 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 20:10:33,360 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 20:10:33,360 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 20:10:33,360 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 20:10:33,360 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 20:10:33,361 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 20:10:33,361 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 20:10:33,361 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 20:10:33,361 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 20:10:33,361 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 20:10:33,361 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 -> d1b32aaddfcc4461b9b835c36b224846d44f13a8bf0904556358f96663c9ebca [2025-02-05 20:10:33,595 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 20:10:33,603 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 20:10:33,607 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 20:10:33,608 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 20:10:33,608 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 20:10:33,609 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.vcegar_QF_BV_usb_phy_1.c [2025-02-05 20:10:34,732 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a7abd3f22/fa8d25b087fb4292a3f132d1cfca2004/FLAGddbcc7dbc [2025-02-05 20:10:35,076 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 20:10:35,077 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_usb_phy_1.c [2025-02-05 20:10:35,091 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a7abd3f22/fa8d25b087fb4292a3f132d1cfca2004/FLAGddbcc7dbc [2025-02-05 20:10:35,325 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a7abd3f22/fa8d25b087fb4292a3f132d1cfca2004 [2025-02-05 20:10:35,327 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 20:10:35,328 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 20:10:35,329 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 20:10:35,329 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 20:10:35,332 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 20:10:35,337 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 08:10:35" (1/1) ... [2025-02-05 20:10:35,338 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b837b4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:10:35, skipping insertion in model container [2025-02-05 20:10:35,338 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 08:10:35" (1/1) ... [2025-02-05 20:10:35,370 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 20:10:35,498 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.vcegar_QF_BV_usb_phy_1.c[1262,1275] [2025-02-05 20:10:35,795 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 20:10:35,801 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 20:10:35,812 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.vcegar_QF_BV_usb_phy_1.c[1262,1275] [2025-02-05 20:10:35,953 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 20:10:35,963 INFO L204 MainTranslator]: Completed translation [2025-02-05 20:10:35,964 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:10:35 WrapperNode [2025-02-05 20:10:35,964 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 20:10:35,965 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 20:10:35,965 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 20:10:35,965 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 20:10:35,970 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:10:35" (1/1) ... [2025-02-05 20:10:36,014 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:10:35" (1/1) ... [2025-02-05 20:10:36,279 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 4142 [2025-02-05 20:10:36,280 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 20:10:36,281 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 20:10:36,281 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 20:10:36,281 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 20:10:36,287 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:10:35" (1/1) ... [2025-02-05 20:10:36,287 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:10:35" (1/1) ... [2025-02-05 20:10:36,317 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:10:35" (1/1) ... [2025-02-05 20:10:36,444 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-05 20:10:36,445 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:10:35" (1/1) ... [2025-02-05 20:10:36,445 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:10:35" (1/1) ... [2025-02-05 20:10:36,508 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:10:35" (1/1) ... [2025-02-05 20:10:36,517 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:10:35" (1/1) ... [2025-02-05 20:10:36,533 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:10:35" (1/1) ... [2025-02-05 20:10:36,551 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:10:35" (1/1) ... [2025-02-05 20:10:36,661 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 20:10:36,662 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 20:10:36,663 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 20:10:36,663 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 20:10:36,668 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:10:35" (1/1) ... [2025-02-05 20:10:36,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 20:10:36,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:10:36,735 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-05 20:10:36,744 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-05 20:10:36,760 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 20:10:36,761 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 20:10:36,761 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 20:10:36,761 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 20:10:37,089 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 20:10:37,094 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 20:10:39,598 INFO L? ?]: Removed 2449 outVars from TransFormulas that were not future-live. [2025-02-05 20:10:39,598 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 20:10:39,733 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 20:10:39,737 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 20:10:39,738 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 08:10:39 BoogieIcfgContainer [2025-02-05 20:10:39,738 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 20:10:39,740 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 20:10:39,740 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 20:10:39,743 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 20:10:39,744 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 08:10:35" (1/3) ... [2025-02-05 20:10:39,744 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@647a3cb1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 08:10:39, skipping insertion in model container [2025-02-05 20:10:39,744 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:10:35" (2/3) ... [2025-02-05 20:10:39,744 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@647a3cb1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 08:10:39, skipping insertion in model container [2025-02-05 20:10:39,744 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 08:10:39" (3/3) ... [2025-02-05 20:10:39,745 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vcegar_QF_BV_usb_phy_1.c [2025-02-05 20:10:39,757 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 20:10:39,760 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.vcegar_QF_BV_usb_phy_1.c that has 1 procedures, 823 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 20:10:39,820 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 20:10:39,830 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;@6ffa6803, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 20:10:39,830 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 20:10:39,836 INFO L276 IsEmpty]: Start isEmpty. Operand has 823 states, 821 states have (on average 1.4993909866017052) internal successors, (1231), 822 states have internal predecessors, (1231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:10:39,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-02-05 20:10:39,846 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:10:39,846 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 20:10:39,847 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:10:39,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:10:39,851 INFO L85 PathProgramCache]: Analyzing trace with hash -1406927722, now seen corresponding path program 1 times [2025-02-05 20:10:39,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:10:39,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229288268] [2025-02-05 20:10:39,857 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:10:39,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:10:39,988 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-02-05 20:10:40,114 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-02-05 20:10:40,115 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:10:40,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:10:40,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:10:40,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:10:40,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229288268] [2025-02-05 20:10:40,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229288268] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:10:40,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:10:40,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 20:10:40,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923405655] [2025-02-05 20:10:40,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:10:40,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 20:10:40,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:10:40,650 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 20:10:40,655 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 20:10:40,657 INFO L87 Difference]: Start difference. First operand has 823 states, 821 states have (on average 1.4993909866017052) internal successors, (1231), 822 states have internal predecessors, (1231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 31.25) internal successors, (125), 4 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:10:41,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:10:41,163 INFO L93 Difference]: Finished difference Result 1435 states and 2149 transitions. [2025-02-05 20:10:41,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 20:10:41,165 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.25) internal successors, (125), 4 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 125 [2025-02-05 20:10:41,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:10:41,180 INFO L225 Difference]: With dead ends: 1435 [2025-02-05 20:10:41,183 INFO L226 Difference]: Without dead ends: 822 [2025-02-05 20:10:41,186 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-05 20:10:41,190 INFO L435 NwaCegarLoop]: 1022 mSDtfsCounter, 0 mSDsluCounter, 2039 mSDsCounter, 0 mSdLazyCounter, 619 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3061 SdHoareTripleChecker+Invalid, 619 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 619 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 20:10:41,192 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3061 Invalid, 619 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 619 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 20:10:41,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 822 states. [2025-02-05 20:10:41,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 822 to 822. [2025-02-05 20:10:41,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 822 states, 821 states have (on average 1.4969549330085261) internal successors, (1229), 821 states have internal predecessors, (1229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:10:41,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 822 states to 822 states and 1229 transitions. [2025-02-05 20:10:41,266 INFO L78 Accepts]: Start accepts. Automaton has 822 states and 1229 transitions. Word has length 125 [2025-02-05 20:10:41,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:10:41,267 INFO L471 AbstractCegarLoop]: Abstraction has 822 states and 1229 transitions. [2025-02-05 20:10:41,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.25) internal successors, (125), 4 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:10:41,267 INFO L276 IsEmpty]: Start isEmpty. Operand 822 states and 1229 transitions. [2025-02-05 20:10:41,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-02-05 20:10:41,268 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:10:41,268 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 20:10:41,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 20:10:41,269 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:10:41,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:10:41,269 INFO L85 PathProgramCache]: Analyzing trace with hash -660406274, now seen corresponding path program 1 times [2025-02-05 20:10:41,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:10:41,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412246669] [2025-02-05 20:10:41,270 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:10:41,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:10:41,316 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-02-05 20:10:41,335 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-02-05 20:10:41,336 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:10:41,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:10:41,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:10:41,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:10:41,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412246669] [2025-02-05 20:10:41,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412246669] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:10:41,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:10:41,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 20:10:41,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416954027] [2025-02-05 20:10:41,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:10:41,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 20:10:41,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:10:41,573 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 20:10:41,573 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 20:10:41,573 INFO L87 Difference]: Start difference. First operand 822 states and 1229 transitions. Second operand has 4 states, 4 states have (on average 31.5) internal successors, (126), 4 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:10:41,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:10:41,890 INFO L93 Difference]: Finished difference Result 1436 states and 2147 transitions. [2025-02-05 20:10:41,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 20:10:41,890 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.5) internal successors, (126), 4 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 126 [2025-02-05 20:10:41,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:10:41,893 INFO L225 Difference]: With dead ends: 1436 [2025-02-05 20:10:41,893 INFO L226 Difference]: Without dead ends: 824 [2025-02-05 20:10:41,894 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-05 20:10:41,895 INFO L435 NwaCegarLoop]: 1022 mSDtfsCounter, 0 mSDsluCounter, 2036 mSDsCounter, 0 mSdLazyCounter, 622 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3058 SdHoareTripleChecker+Invalid, 622 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 622 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 20:10:41,895 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3058 Invalid, 622 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 622 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 20:10:41,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 824 states. [2025-02-05 20:10:41,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 824 to 824. [2025-02-05 20:10:41,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 824 states, 823 states have (on average 1.4957472660996354) internal successors, (1231), 823 states have internal predecessors, (1231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:10:41,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 824 states to 824 states and 1231 transitions. [2025-02-05 20:10:41,913 INFO L78 Accepts]: Start accepts. Automaton has 824 states and 1231 transitions. Word has length 126 [2025-02-05 20:10:41,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:10:41,913 INFO L471 AbstractCegarLoop]: Abstraction has 824 states and 1231 transitions. [2025-02-05 20:10:41,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.5) internal successors, (126), 4 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:10:41,913 INFO L276 IsEmpty]: Start isEmpty. Operand 824 states and 1231 transitions. [2025-02-05 20:10:41,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-02-05 20:10:41,917 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:10:41,917 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 20:10:41,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 20:10:41,917 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:10:41,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:10:41,918 INFO L85 PathProgramCache]: Analyzing trace with hash -1361215087, now seen corresponding path program 1 times [2025-02-05 20:10:41,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:10:41,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779035245] [2025-02-05 20:10:41,918 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:10:41,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:10:41,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-02-05 20:10:42,019 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-02-05 20:10:42,023 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:10:42,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:10:42,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:10:42,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:10:42,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779035245] [2025-02-05 20:10:42,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779035245] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:10:42,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:10:42,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 20:10:42,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994684125] [2025-02-05 20:10:42,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:10:42,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 20:10:42,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:10:42,603 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 20:10:42,604 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 20:10:42,604 INFO L87 Difference]: Start difference. First operand 824 states and 1231 transitions. Second operand has 4 states, 4 states have (on average 31.75) internal successors, (127), 4 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:10:42,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:10:42,974 INFO L93 Difference]: Finished difference Result 1438 states and 2148 transitions. [2025-02-05 20:10:42,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 20:10:42,976 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.75) internal successors, (127), 4 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 127 [2025-02-05 20:10:42,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:10:42,979 INFO L225 Difference]: With dead ends: 1438 [2025-02-05 20:10:42,979 INFO L226 Difference]: Without dead ends: 824 [2025-02-05 20:10:42,981 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-05 20:10:42,982 INFO L435 NwaCegarLoop]: 1019 mSDtfsCounter, 6 mSDsluCounter, 2029 mSDsCounter, 0 mSdLazyCounter, 621 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 3048 SdHoareTripleChecker+Invalid, 621 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 621 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 20:10:42,982 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 3048 Invalid, 621 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 621 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 20:10:42,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 824 states. [2025-02-05 20:10:42,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 824 to 824. [2025-02-05 20:10:42,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 824 states, 823 states have (on average 1.49453219927096) internal successors, (1230), 823 states have internal predecessors, (1230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:10:43,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 824 states to 824 states and 1230 transitions. [2025-02-05 20:10:43,000 INFO L78 Accepts]: Start accepts. Automaton has 824 states and 1230 transitions. Word has length 127 [2025-02-05 20:10:43,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:10:43,001 INFO L471 AbstractCegarLoop]: Abstraction has 824 states and 1230 transitions. [2025-02-05 20:10:43,001 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.75) internal successors, (127), 4 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:10:43,002 INFO L276 IsEmpty]: Start isEmpty. Operand 824 states and 1230 transitions. [2025-02-05 20:10:43,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-02-05 20:10:43,003 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:10:43,003 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 20:10:43,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 20:10:43,003 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:10:43,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:10:43,004 INFO L85 PathProgramCache]: Analyzing trace with hash -1654598525, now seen corresponding path program 1 times [2025-02-05 20:10:43,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:10:43,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277145552] [2025-02-05 20:10:43,005 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:10:43,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:10:43,048 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-02-05 20:10:43,088 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-02-05 20:10:43,089 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:10:43,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:10:43,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:10:43,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:10:43,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277145552] [2025-02-05 20:10:43,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277145552] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:10:43,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:10:43,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 20:10:43,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910367171] [2025-02-05 20:10:43,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:10:43,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 20:10:43,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:10:43,654 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 20:10:43,654 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-05 20:10:43,654 INFO L87 Difference]: Start difference. First operand 824 states and 1230 transitions. Second operand has 8 states, 8 states have (on average 16.0) internal successors, (128), 8 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:10:44,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:10:44,273 INFO L93 Difference]: Finished difference Result 1448 states and 2160 transitions. [2025-02-05 20:10:44,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 20:10:44,274 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 16.0) internal successors, (128), 8 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 128 [2025-02-05 20:10:44,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:10:44,276 INFO L225 Difference]: With dead ends: 1448 [2025-02-05 20:10:44,277 INFO L226 Difference]: Without dead ends: 834 [2025-02-05 20:10:44,278 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-02-05 20:10:44,278 INFO L435 NwaCegarLoop]: 1017 mSDtfsCounter, 1130 mSDsluCounter, 5073 mSDsCounter, 0 mSdLazyCounter, 1266 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1130 SdHoareTripleChecker+Valid, 6090 SdHoareTripleChecker+Invalid, 1266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 20:10:44,278 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1130 Valid, 6090 Invalid, 1266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1266 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 20:10:44,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 834 states. [2025-02-05 20:10:44,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 834 to 833. [2025-02-05 20:10:44,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 833 states, 832 states have (on average 1.4927884615384615) internal successors, (1242), 832 states have internal predecessors, (1242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:10:44,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 833 states to 833 states and 1242 transitions. [2025-02-05 20:10:44,291 INFO L78 Accepts]: Start accepts. Automaton has 833 states and 1242 transitions. Word has length 128 [2025-02-05 20:10:44,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:10:44,291 INFO L471 AbstractCegarLoop]: Abstraction has 833 states and 1242 transitions. [2025-02-05 20:10:44,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 16.0) internal successors, (128), 8 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:10:44,292 INFO L276 IsEmpty]: Start isEmpty. Operand 833 states and 1242 transitions. [2025-02-05 20:10:44,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-02-05 20:10:44,292 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:10:44,292 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 20:10:44,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 20:10:44,293 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:10:44,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:10:44,293 INFO L85 PathProgramCache]: Analyzing trace with hash 2046836957, now seen corresponding path program 1 times [2025-02-05 20:10:44,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:10:44,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055580740] [2025-02-05 20:10:44,293 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:10:44,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:10:44,326 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-02-05 20:10:44,347 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-02-05 20:10:44,348 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:10:44,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:10:44,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:10:44,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:10:44,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055580740] [2025-02-05 20:10:44,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055580740] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:10:44,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:10:44,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 20:10:44,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110135068] [2025-02-05 20:10:44,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:10:44,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 20:10:44,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:10:44,726 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 20:10:44,726 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 20:10:44,726 INFO L87 Difference]: Start difference. First operand 833 states and 1242 transitions. Second operand has 5 states, 5 states have (on average 25.8) internal successors, (129), 5 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:10:45,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:10:45,065 INFO L93 Difference]: Finished difference Result 1462 states and 2178 transitions. [2025-02-05 20:10:45,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 20:10:45,066 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 25.8) internal successors, (129), 5 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 129 [2025-02-05 20:10:45,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:10:45,069 INFO L225 Difference]: With dead ends: 1462 [2025-02-05 20:10:45,069 INFO L226 Difference]: Without dead ends: 839 [2025-02-05 20:10:45,069 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-05 20:10:45,070 INFO L435 NwaCegarLoop]: 1019 mSDtfsCounter, 1113 mSDsluCounter, 2032 mSDsCounter, 0 mSdLazyCounter, 626 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1113 SdHoareTripleChecker+Valid, 3051 SdHoareTripleChecker+Invalid, 626 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 626 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 20:10:45,070 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1113 Valid, 3051 Invalid, 626 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 626 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 20:10:45,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 839 states. [2025-02-05 20:10:45,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 839 to 839. [2025-02-05 20:10:45,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 839 states, 838 states have (on average 1.4892601431980907) internal successors, (1248), 838 states have internal predecessors, (1248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:10:45,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 839 states to 839 states and 1248 transitions. [2025-02-05 20:10:45,081 INFO L78 Accepts]: Start accepts. Automaton has 839 states and 1248 transitions. Word has length 129 [2025-02-05 20:10:45,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:10:45,082 INFO L471 AbstractCegarLoop]: Abstraction has 839 states and 1248 transitions. [2025-02-05 20:10:45,082 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.8) internal successors, (129), 5 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:10:45,082 INFO L276 IsEmpty]: Start isEmpty. Operand 839 states and 1248 transitions. [2025-02-05 20:10:45,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-02-05 20:10:45,083 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:10:45,083 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 20:10:45,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 20:10:45,083 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:10:45,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:10:45,083 INFO L85 PathProgramCache]: Analyzing trace with hash 1197128839, now seen corresponding path program 1 times [2025-02-05 20:10:45,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:10:45,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334667674] [2025-02-05 20:10:45,084 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:10:45,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:10:45,114 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-02-05 20:10:45,125 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-02-05 20:10:45,125 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:10:45,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:10:45,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:10:45,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:10:45,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334667674] [2025-02-05 20:10:45,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334667674] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:10:45,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:10:45,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 20:10:45,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278849831] [2025-02-05 20:10:45,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:10:45,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 20:10:45,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:10:45,341 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 20:10:45,341 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 20:10:45,341 INFO L87 Difference]: Start difference. First operand 839 states and 1248 transitions. Second operand has 6 states, 6 states have (on average 21.5) internal successors, (129), 6 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:10:46,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:10:46,259 INFO L93 Difference]: Finished difference Result 1788 states and 2654 transitions. [2025-02-05 20:10:46,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 20:10:46,259 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 21.5) internal successors, (129), 6 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 129 [2025-02-05 20:10:46,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:10:46,263 INFO L225 Difference]: With dead ends: 1788 [2025-02-05 20:10:46,263 INFO L226 Difference]: Without dead ends: 1159 [2025-02-05 20:10:46,264 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-02-05 20:10:46,264 INFO L435 NwaCegarLoop]: 1001 mSDtfsCounter, 2038 mSDsluCounter, 2525 mSDsCounter, 0 mSdLazyCounter, 1378 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2038 SdHoareTripleChecker+Valid, 3526 SdHoareTripleChecker+Invalid, 1379 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-05 20:10:46,264 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2038 Valid, 3526 Invalid, 1379 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1378 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-05 20:10:46,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1159 states. [2025-02-05 20:10:46,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1159 to 853. [2025-02-05 20:10:46,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 853 states, 852 states have (on average 1.488262910798122) internal successors, (1268), 852 states have internal predecessors, (1268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:10:46,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 853 states to 853 states and 1268 transitions. [2025-02-05 20:10:46,277 INFO L78 Accepts]: Start accepts. Automaton has 853 states and 1268 transitions. Word has length 129 [2025-02-05 20:10:46,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:10:46,278 INFO L471 AbstractCegarLoop]: Abstraction has 853 states and 1268 transitions. [2025-02-05 20:10:46,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.5) internal successors, (129), 6 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:10:46,278 INFO L276 IsEmpty]: Start isEmpty. Operand 853 states and 1268 transitions. [2025-02-05 20:10:46,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-02-05 20:10:46,279 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:10:46,279 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 20:10:46,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 20:10:46,279 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:10:46,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:10:46,279 INFO L85 PathProgramCache]: Analyzing trace with hash 1087416052, now seen corresponding path program 1 times [2025-02-05 20:10:46,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:10:46,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504614476] [2025-02-05 20:10:46,280 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:10:46,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:10:46,309 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-02-05 20:10:46,327 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-02-05 20:10:46,327 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:10:46,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:10:46,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:10:46,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:10:46,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504614476] [2025-02-05 20:10:46,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504614476] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:10:46,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:10:46,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 20:10:46,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101580504] [2025-02-05 20:10:46,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:10:46,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 20:10:46,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:10:46,591 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 20:10:46,591 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 20:10:46,591 INFO L87 Difference]: Start difference. First operand 853 states and 1268 transitions. Second operand has 6 states, 6 states have (on average 21.666666666666668) internal successors, (130), 6 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:10:47,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:10:47,229 INFO L93 Difference]: Finished difference Result 1787 states and 2655 transitions. [2025-02-05 20:10:47,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 20:10:47,232 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 21.666666666666668) internal successors, (130), 6 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 130 [2025-02-05 20:10:47,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:10:47,235 INFO L225 Difference]: With dead ends: 1787 [2025-02-05 20:10:47,235 INFO L226 Difference]: Without dead ends: 1158 [2025-02-05 20:10:47,236 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-02-05 20:10:47,236 INFO L435 NwaCegarLoop]: 1000 mSDtfsCounter, 2056 mSDsluCounter, 1995 mSDsCounter, 0 mSdLazyCounter, 684 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2056 SdHoareTripleChecker+Valid, 2995 SdHoareTripleChecker+Invalid, 685 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 684 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 20:10:47,237 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2056 Valid, 2995 Invalid, 685 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 684 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 20:10:47,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1158 states. [2025-02-05 20:10:47,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1158 to 855. [2025-02-05 20:10:47,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 855 states, 854 states have (on average 1.4871194379391102) internal successors, (1270), 854 states have internal predecessors, (1270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:10:47,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 855 states to 855 states and 1270 transitions. [2025-02-05 20:10:47,251 INFO L78 Accepts]: Start accepts. Automaton has 855 states and 1270 transitions. Word has length 130 [2025-02-05 20:10:47,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:10:47,252 INFO L471 AbstractCegarLoop]: Abstraction has 855 states and 1270 transitions. [2025-02-05 20:10:47,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.666666666666668) internal successors, (130), 6 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:10:47,252 INFO L276 IsEmpty]: Start isEmpty. Operand 855 states and 1270 transitions. [2025-02-05 20:10:47,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 436 [2025-02-05 20:10:47,260 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:10:47,260 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 20:10:47,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 20:10:47,260 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:10:47,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:10:47,261 INFO L85 PathProgramCache]: Analyzing trace with hash -1649817667, now seen corresponding path program 1 times [2025-02-05 20:10:47,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:10:47,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764227639] [2025-02-05 20:10:47,262 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:10:47,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:10:47,450 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 435 statements into 1 equivalence classes. [2025-02-05 20:10:47,805 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 435 of 435 statements. [2025-02-05 20:10:47,806 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:10:47,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:10:49,301 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:10:49,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:10:49,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764227639] [2025-02-05 20:10:49,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764227639] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:10:49,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:10:49,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 20:10:49,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506433440] [2025-02-05 20:10:49,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:10:49,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 20:10:49,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:10:49,304 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 20:10:49,304 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-05 20:10:49,305 INFO L87 Difference]: Start difference. First operand 855 states and 1270 transitions. Second operand has 7 states, 7 states have (on average 62.142857142857146) internal successors, (435), 7 states have internal predecessors, (435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:10:49,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:10:49,985 INFO L93 Difference]: Finished difference Result 2631 states and 3916 transitions. [2025-02-05 20:10:49,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 20:10:49,986 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 62.142857142857146) internal successors, (435), 7 states have internal predecessors, (435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 435 [2025-02-05 20:10:49,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:10:49,993 INFO L225 Difference]: With dead ends: 2631 [2025-02-05 20:10:49,993 INFO L226 Difference]: Without dead ends: 2002 [2025-02-05 20:10:49,994 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-02-05 20:10:49,995 INFO L435 NwaCegarLoop]: 1391 mSDtfsCounter, 1413 mSDsluCounter, 5178 mSDsCounter, 0 mSdLazyCounter, 1344 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1413 SdHoareTripleChecker+Valid, 6569 SdHoareTripleChecker+Invalid, 1345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 20:10:49,996 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1413 Valid, 6569 Invalid, 1345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1344 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 20:10:49,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2002 states. [2025-02-05 20:10:50,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2002 to 1431. [2025-02-05 20:10:50,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1431 states, 1430 states have (on average 1.4916083916083915) internal successors, (2133), 1430 states have internal predecessors, (2133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:10:50,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1431 states to 1431 states and 2133 transitions. [2025-02-05 20:10:50,032 INFO L78 Accepts]: Start accepts. Automaton has 1431 states and 2133 transitions. Word has length 435 [2025-02-05 20:10:50,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:10:50,033 INFO L471 AbstractCegarLoop]: Abstraction has 1431 states and 2133 transitions. [2025-02-05 20:10:50,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 62.142857142857146) internal successors, (435), 7 states have internal predecessors, (435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:10:50,033 INFO L276 IsEmpty]: Start isEmpty. Operand 1431 states and 2133 transitions. [2025-02-05 20:10:50,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 437 [2025-02-05 20:10:50,038 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:10:50,039 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 20:10:50,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 20:10:50,039 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:10:50,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:10:50,039 INFO L85 PathProgramCache]: Analyzing trace with hash -1268579714, now seen corresponding path program 1 times [2025-02-05 20:10:50,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:10:50,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239975297] [2025-02-05 20:10:50,039 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:10:50,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:10:50,191 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 436 statements into 1 equivalence classes. [2025-02-05 20:10:54,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 436 of 436 statements. [2025-02-05 20:10:54,175 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:10:54,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:10:55,246 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:10:55,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:10:55,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239975297] [2025-02-05 20:10:55,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239975297] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:10:55,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:10:55,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 20:10:55,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020156778] [2025-02-05 20:10:55,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:10:55,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 20:10:55,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:10:55,249 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 20:10:55,249 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 20:10:55,249 INFO L87 Difference]: Start difference. First operand 1431 states and 2133 transitions. Second operand has 5 states, 5 states have (on average 87.2) internal successors, (436), 5 states have internal predecessors, (436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:10:56,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:10:56,230 INFO L93 Difference]: Finished difference Result 3529 states and 5264 transitions. [2025-02-05 20:10:56,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 20:10:56,231 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 87.2) internal successors, (436), 5 states have internal predecessors, (436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 436 [2025-02-05 20:10:56,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:10:56,235 INFO L225 Difference]: With dead ends: 3529 [2025-02-05 20:10:56,235 INFO L226 Difference]: Without dead ends: 1439 [2025-02-05 20:10:56,237 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-05 20:10:56,240 INFO L435 NwaCegarLoop]: 980 mSDtfsCounter, 321 mSDsluCounter, 2500 mSDsCounter, 0 mSdLazyCounter, 1545 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 321 SdHoareTripleChecker+Valid, 3480 SdHoareTripleChecker+Invalid, 1619 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 1545 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-05 20:10:56,240 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [321 Valid, 3480 Invalid, 1619 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 1545 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-05 20:10:56,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1439 states. [2025-02-05 20:10:56,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1439 to 1435. [2025-02-05 20:10:56,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1435 states, 1434 states have (on average 1.49023709902371) internal successors, (2137), 1434 states have internal predecessors, (2137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:10:56,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1435 states to 1435 states and 2137 transitions. [2025-02-05 20:10:56,259 INFO L78 Accepts]: Start accepts. Automaton has 1435 states and 2137 transitions. Word has length 436 [2025-02-05 20:10:56,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:10:56,259 INFO L471 AbstractCegarLoop]: Abstraction has 1435 states and 2137 transitions. [2025-02-05 20:10:56,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 87.2) internal successors, (436), 5 states have internal predecessors, (436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:10:56,260 INFO L276 IsEmpty]: Start isEmpty. Operand 1435 states and 2137 transitions. [2025-02-05 20:10:56,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 438 [2025-02-05 20:10:56,264 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:10:56,264 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 20:10:56,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 20:10:56,265 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:10:56,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:10:56,267 INFO L85 PathProgramCache]: Analyzing trace with hash 162543372, now seen corresponding path program 1 times [2025-02-05 20:10:56,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:10:56,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179101481] [2025-02-05 20:10:56,268 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:10:56,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:10:56,430 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 437 statements into 1 equivalence classes. [2025-02-05 20:10:59,577 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 437 of 437 statements. [2025-02-05 20:10:59,577 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:10:59,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:11:00,575 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:11:00,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:11:00,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179101481] [2025-02-05 20:11:00,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179101481] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:11:00,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:11:00,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 20:11:00,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150154272] [2025-02-05 20:11:00,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:11:00,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 20:11:00,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:11:00,577 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 20:11:00,577 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 20:11:00,577 INFO L87 Difference]: Start difference. First operand 1435 states and 2137 transitions. Second operand has 6 states, 6 states have (on average 72.83333333333333) internal successors, (437), 6 states have internal predecessors, (437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:11:02,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:11:02,325 INFO L93 Difference]: Finished difference Result 3700 states and 5522 transitions. [2025-02-05 20:11:02,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 20:11:02,326 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 72.83333333333333) internal successors, (437), 6 states have internal predecessors, (437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 437 [2025-02-05 20:11:02,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:11:02,332 INFO L225 Difference]: With dead ends: 3700 [2025-02-05 20:11:02,332 INFO L226 Difference]: Without dead ends: 2491 [2025-02-05 20:11:02,334 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-05 20:11:02,334 INFO L435 NwaCegarLoop]: 1374 mSDtfsCounter, 781 mSDsluCounter, 3810 mSDsCounter, 0 mSdLazyCounter, 3206 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 781 SdHoareTripleChecker+Valid, 5184 SdHoareTripleChecker+Invalid, 3206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-02-05 20:11:02,334 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [781 Valid, 5184 Invalid, 3206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3206 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-02-05 20:11:02,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2491 states. [2025-02-05 20:11:02,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2491 to 1483. [2025-02-05 20:11:02,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1483 states, 1482 states have (on average 1.4892037786774628) internal successors, (2207), 1482 states have internal predecessors, (2207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:11:02,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1483 states to 1483 states and 2207 transitions. [2025-02-05 20:11:02,366 INFO L78 Accepts]: Start accepts. Automaton has 1483 states and 2207 transitions. Word has length 437 [2025-02-05 20:11:02,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:11:02,366 INFO L471 AbstractCegarLoop]: Abstraction has 1483 states and 2207 transitions. [2025-02-05 20:11:02,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 72.83333333333333) internal successors, (437), 6 states have internal predecessors, (437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:11:02,366 INFO L276 IsEmpty]: Start isEmpty. Operand 1483 states and 2207 transitions. [2025-02-05 20:11:02,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 438 [2025-02-05 20:11:02,372 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:11:02,372 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 20:11:02,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 20:11:02,373 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:11:02,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:11:02,373 INFO L85 PathProgramCache]: Analyzing trace with hash 954299761, now seen corresponding path program 1 times [2025-02-05 20:11:02,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:11:02,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610961591] [2025-02-05 20:11:02,373 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:11:02,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:11:02,534 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 437 statements into 1 equivalence classes. [2025-02-05 20:11:06,136 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 437 of 437 statements. [2025-02-05 20:11:06,136 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:11:06,136 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:11:06,958 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:11:06,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:11:06,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610961591] [2025-02-05 20:11:06,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610961591] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 20:11:06,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [28664688] [2025-02-05 20:11:06,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:11:06,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:11:06,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:11:06,963 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-05 20:11:06,964 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-05 20:11:07,822 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 437 statements into 1 equivalence classes. [2025-02-05 20:11:08,793 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 437 of 437 statements. [2025-02-05 20:11:08,794 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:11:08,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:11:08,821 INFO L256 TraceCheckSpWp]: Trace formula consists of 4474 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-05 20:11:08,839 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 20:11:09,396 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:11:09,396 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 20:11:10,080 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:11:10,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [28664688] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 20:11:10,080 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 20:11:10,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2025-02-05 20:11:10,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848973568] [2025-02-05 20:11:10,081 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 20:11:10,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 20:11:10,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:11:10,082 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 20:11:10,082 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-02-05 20:11:10,084 INFO L87 Difference]: Start difference. First operand 1483 states and 2207 transitions. Second operand has 10 states, 10 states have (on average 58.8) internal successors, (588), 10 states have internal predecessors, (588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:11:11,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:11:11,240 INFO L93 Difference]: Finished difference Result 4446 states and 6622 transitions. [2025-02-05 20:11:11,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 20:11:11,241 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 58.8) internal successors, (588), 10 states have internal predecessors, (588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 437 [2025-02-05 20:11:11,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:11:11,246 INFO L225 Difference]: With dead ends: 4446 [2025-02-05 20:11:11,246 INFO L226 Difference]: Without dead ends: 2128 [2025-02-05 20:11:11,248 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 883 GetRequests, 870 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2025-02-05 20:11:11,248 INFO L435 NwaCegarLoop]: 981 mSDtfsCounter, 4351 mSDsluCounter, 3402 mSDsCounter, 0 mSdLazyCounter, 1945 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4351 SdHoareTripleChecker+Valid, 4383 SdHoareTripleChecker+Invalid, 2046 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 1945 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-05 20:11:11,249 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4351 Valid, 4383 Invalid, 2046 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 1945 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-05 20:11:11,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2128 states. [2025-02-05 20:11:11,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2128 to 1624. [2025-02-05 20:11:11,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1624 states, 1623 states have (on average 1.4836722119531731) internal successors, (2408), 1623 states have internal predecessors, (2408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:11:11,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1624 states to 1624 states and 2408 transitions. [2025-02-05 20:11:11,267 INFO L78 Accepts]: Start accepts. Automaton has 1624 states and 2408 transitions. Word has length 437 [2025-02-05 20:11:11,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:11:11,267 INFO L471 AbstractCegarLoop]: Abstraction has 1624 states and 2408 transitions. [2025-02-05 20:11:11,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 58.8) internal successors, (588), 10 states have internal predecessors, (588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:11:11,267 INFO L276 IsEmpty]: Start isEmpty. Operand 1624 states and 2408 transitions. [2025-02-05 20:11:11,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 439 [2025-02-05 20:11:11,270 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:11:11,270 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 20:11:11,289 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-05 20:11:11,474 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,SelfDestructingSolverStorable10 [2025-02-05 20:11:11,474 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:11:11,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:11:11,475 INFO L85 PathProgramCache]: Analyzing trace with hash -1077110090, now seen corresponding path program 1 times [2025-02-05 20:11:11,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:11:11,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208892275] [2025-02-05 20:11:11,475 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:11:11,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:11:11,643 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 438 statements into 1 equivalence classes. [2025-02-05 20:11:14,876 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 438 of 438 statements. [2025-02-05 20:11:14,877 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:11:14,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:11:16,165 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:11:16,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:11:16,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208892275] [2025-02-05 20:11:16,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208892275] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:11:16,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:11:16,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 20:11:16,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466968528] [2025-02-05 20:11:16,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:11:16,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 20:11:16,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:11:16,172 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 20:11:16,172 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 20:11:16,177 INFO L87 Difference]: Start difference. First operand 1624 states and 2408 transitions. Second operand has 5 states, 5 states have (on average 87.6) internal successors, (438), 5 states have internal predecessors, (438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:11:16,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:11:16,574 INFO L93 Difference]: Finished difference Result 3191 states and 4739 transitions. [2025-02-05 20:11:16,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 20:11:16,575 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 87.6) internal successors, (438), 5 states have internal predecessors, (438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 438 [2025-02-05 20:11:16,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:11:16,579 INFO L225 Difference]: With dead ends: 3191 [2025-02-05 20:11:16,579 INFO L226 Difference]: Without dead ends: 1882 [2025-02-05 20:11:16,581 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 20:11:16,582 INFO L435 NwaCegarLoop]: 998 mSDtfsCounter, 1671 mSDsluCounter, 1993 mSDsCounter, 0 mSdLazyCounter, 687 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1671 SdHoareTripleChecker+Valid, 2991 SdHoareTripleChecker+Invalid, 688 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 687 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 20:11:16,582 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1671 Valid, 2991 Invalid, 688 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 687 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 20:11:16,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1882 states. [2025-02-05 20:11:16,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1882 to 1620. [2025-02-05 20:11:16,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1620 states, 1619 states have (on average 1.4799258801729462) internal successors, (2396), 1619 states have internal predecessors, (2396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:11:16,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1620 states to 1620 states and 2396 transitions. [2025-02-05 20:11:16,603 INFO L78 Accepts]: Start accepts. Automaton has 1620 states and 2396 transitions. Word has length 438 [2025-02-05 20:11:16,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:11:16,604 INFO L471 AbstractCegarLoop]: Abstraction has 1620 states and 2396 transitions. [2025-02-05 20:11:16,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 87.6) internal successors, (438), 5 states have internal predecessors, (438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:11:16,604 INFO L276 IsEmpty]: Start isEmpty. Operand 1620 states and 2396 transitions. [2025-02-05 20:11:16,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 440 [2025-02-05 20:11:16,607 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:11:16,607 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 20:11:16,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 20:11:16,607 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:11:16,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:11:16,608 INFO L85 PathProgramCache]: Analyzing trace with hash 2078487421, now seen corresponding path program 1 times [2025-02-05 20:11:16,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:11:16,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296944702] [2025-02-05 20:11:16,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:11:16,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:11:16,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 439 statements into 1 equivalence classes. [2025-02-05 20:11:19,881 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 439 of 439 statements. [2025-02-05 20:11:19,881 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:11:19,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:11:20,585 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:11:20,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:11:20,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296944702] [2025-02-05 20:11:20,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296944702] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:11:20,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:11:20,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 20:11:20,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981666492] [2025-02-05 20:11:20,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:11:20,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 20:11:20,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:11:20,587 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 20:11:20,587 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 20:11:20,587 INFO L87 Difference]: Start difference. First operand 1620 states and 2396 transitions. Second operand has 6 states, 6 states have (on average 73.16666666666667) internal successors, (439), 6 states have internal predecessors, (439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:11:21,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:11:21,866 INFO L93 Difference]: Finished difference Result 3435 states and 5094 transitions. [2025-02-05 20:11:21,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 20:11:21,866 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 73.16666666666667) internal successors, (439), 6 states have internal predecessors, (439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 439 [2025-02-05 20:11:21,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:11:21,876 INFO L225 Difference]: With dead ends: 3435 [2025-02-05 20:11:21,879 INFO L226 Difference]: Without dead ends: 2178 [2025-02-05 20:11:21,881 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-02-05 20:11:21,882 INFO L435 NwaCegarLoop]: 899 mSDtfsCounter, 2071 mSDsluCounter, 2078 mSDsCounter, 0 mSdLazyCounter, 2019 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2071 SdHoareTripleChecker+Valid, 2977 SdHoareTripleChecker+Invalid, 2027 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 2019 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-02-05 20:11:21,882 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2071 Valid, 2977 Invalid, 2027 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 2019 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-02-05 20:11:21,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2178 states. [2025-02-05 20:11:21,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2178 to 1748. [2025-02-05 20:11:21,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1748 states, 1747 states have (on average 1.4802518603319976) internal successors, (2586), 1747 states have internal predecessors, (2586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:11:21,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1748 states to 1748 states and 2586 transitions. [2025-02-05 20:11:21,918 INFO L78 Accepts]: Start accepts. Automaton has 1748 states and 2586 transitions. Word has length 439 [2025-02-05 20:11:21,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:11:21,919 INFO L471 AbstractCegarLoop]: Abstraction has 1748 states and 2586 transitions. [2025-02-05 20:11:21,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 73.16666666666667) internal successors, (439), 6 states have internal predecessors, (439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:11:21,919 INFO L276 IsEmpty]: Start isEmpty. Operand 1748 states and 2586 transitions. [2025-02-05 20:11:21,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 441 [2025-02-05 20:11:21,923 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:11:21,924 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 20:11:21,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 20:11:21,924 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:11:21,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:11:21,924 INFO L85 PathProgramCache]: Analyzing trace with hash 2121605594, now seen corresponding path program 1 times [2025-02-05 20:11:21,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:11:21,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803635508] [2025-02-05 20:11:21,925 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:11:21,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:11:22,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 440 statements into 1 equivalence classes. [2025-02-05 20:11:26,472 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 440 of 440 statements. [2025-02-05 20:11:26,472 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:11:26,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:11:27,202 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:11:27,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:11:27,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803635508] [2025-02-05 20:11:27,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803635508] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:11:27,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:11:27,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 20:11:27,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178973699] [2025-02-05 20:11:27,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:11:27,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 20:11:27,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:11:27,204 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 20:11:27,205 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 20:11:27,205 INFO L87 Difference]: Start difference. First operand 1748 states and 2586 transitions. Second operand has 6 states, 6 states have (on average 73.33333333333333) internal successors, (440), 6 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:11:28,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:11:28,032 INFO L93 Difference]: Finished difference Result 3931 states and 5836 transitions. [2025-02-05 20:11:28,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 20:11:28,032 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 73.33333333333333) internal successors, (440), 6 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 440 [2025-02-05 20:11:28,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:11:28,038 INFO L225 Difference]: With dead ends: 3931 [2025-02-05 20:11:28,038 INFO L226 Difference]: Without dead ends: 2674 [2025-02-05 20:11:28,039 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-02-05 20:11:28,040 INFO L435 NwaCegarLoop]: 769 mSDtfsCounter, 3322 mSDsluCounter, 1599 mSDsCounter, 0 mSdLazyCounter, 1466 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3322 SdHoareTripleChecker+Valid, 2368 SdHoareTripleChecker+Invalid, 1474 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1466 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 20:11:28,040 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3322 Valid, 2368 Invalid, 1474 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1466 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 20:11:28,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2674 states. [2025-02-05 20:11:28,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2674 to 2246. [2025-02-05 20:11:28,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2246 states, 2245 states have (on average 1.4841870824053451) internal successors, (3332), 2245 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:11:28,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2246 states to 2246 states and 3332 transitions. [2025-02-05 20:11:28,088 INFO L78 Accepts]: Start accepts. Automaton has 2246 states and 3332 transitions. Word has length 440 [2025-02-05 20:11:28,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:11:28,089 INFO L471 AbstractCegarLoop]: Abstraction has 2246 states and 3332 transitions. [2025-02-05 20:11:28,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 73.33333333333333) internal successors, (440), 6 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:11:28,089 INFO L276 IsEmpty]: Start isEmpty. Operand 2246 states and 3332 transitions. [2025-02-05 20:11:28,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 442 [2025-02-05 20:11:28,097 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:11:28,097 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 20:11:28,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 20:11:28,097 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:11:28,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:11:28,097 INFO L85 PathProgramCache]: Analyzing trace with hash -472115099, now seen corresponding path program 1 times [2025-02-05 20:11:28,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:11:28,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267276732] [2025-02-05 20:11:28,098 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:11:28,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:11:28,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 441 statements into 1 equivalence classes. [2025-02-05 20:11:33,458 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 441 of 441 statements. [2025-02-05 20:11:33,458 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:11:33,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:11:34,155 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:11:34,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:11:34,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267276732] [2025-02-05 20:11:34,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267276732] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:11:34,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:11:34,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 20:11:34,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816645655] [2025-02-05 20:11:34,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:11:34,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 20:11:34,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:11:34,158 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 20:11:34,159 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 20:11:34,160 INFO L87 Difference]: Start difference. First operand 2246 states and 3332 transitions. Second operand has 6 states, 6 states have (on average 73.5) internal successors, (441), 6 states have internal predecessors, (441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:11:35,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:11:35,126 INFO L93 Difference]: Finished difference Result 5896 states and 8740 transitions. [2025-02-05 20:11:35,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 20:11:35,126 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 73.5) internal successors, (441), 6 states have internal predecessors, (441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 441 [2025-02-05 20:11:35,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:11:35,148 INFO L225 Difference]: With dead ends: 5896 [2025-02-05 20:11:35,149 INFO L226 Difference]: Without dead ends: 4639 [2025-02-05 20:11:35,150 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-05 20:11:35,151 INFO L435 NwaCegarLoop]: 799 mSDtfsCounter, 1820 mSDsluCounter, 2793 mSDsCounter, 0 mSdLazyCounter, 2012 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1820 SdHoareTripleChecker+Valid, 3592 SdHoareTripleChecker+Invalid, 2077 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 2012 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-05 20:11:35,151 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1820 Valid, 3592 Invalid, 2077 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 2012 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-05 20:11:35,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4639 states. [2025-02-05 20:11:35,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4639 to 4206. [2025-02-05 20:11:35,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4206 states, 4205 states have (on average 1.4820451843043996) internal successors, (6232), 4205 states have internal predecessors, (6232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:11:35,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4206 states to 4206 states and 6232 transitions. [2025-02-05 20:11:35,238 INFO L78 Accepts]: Start accepts. Automaton has 4206 states and 6232 transitions. Word has length 441 [2025-02-05 20:11:35,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:11:35,240 INFO L471 AbstractCegarLoop]: Abstraction has 4206 states and 6232 transitions. [2025-02-05 20:11:35,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 73.5) internal successors, (441), 6 states have internal predecessors, (441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:11:35,241 INFO L276 IsEmpty]: Start isEmpty. Operand 4206 states and 6232 transitions. [2025-02-05 20:11:35,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 443 [2025-02-05 20:11:35,249 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:11:35,249 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 20:11:35,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 20:11:35,250 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:11:35,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:11:35,253 INFO L85 PathProgramCache]: Analyzing trace with hash 74393527, now seen corresponding path program 1 times [2025-02-05 20:11:35,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:11:35,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664573652] [2025-02-05 20:11:35,254 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:11:35,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:11:35,408 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 442 statements into 1 equivalence classes. [2025-02-05 20:11:39,203 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 442 of 442 statements. [2025-02-05 20:11:39,204 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:11:39,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:11:41,267 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:11:41,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:11:41,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664573652] [2025-02-05 20:11:41,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664573652] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:11:41,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:11:41,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 20:11:41,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995805173] [2025-02-05 20:11:41,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:11:41,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 20:11:41,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:11:41,268 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 20:11:41,268 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 20:11:41,269 INFO L87 Difference]: Start difference. First operand 4206 states and 6232 transitions. Second operand has 6 states, 6 states have (on average 73.66666666666667) internal successors, (442), 6 states have internal predecessors, (442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:11:41,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:11:41,982 INFO L93 Difference]: Finished difference Result 7620 states and 11318 transitions. [2025-02-05 20:11:41,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 20:11:41,982 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 73.66666666666667) internal successors, (442), 6 states have internal predecessors, (442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 442 [2025-02-05 20:11:41,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:11:41,988 INFO L225 Difference]: With dead ends: 7620 [2025-02-05 20:11:41,988 INFO L226 Difference]: Without dead ends: 4202 [2025-02-05 20:11:41,991 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-02-05 20:11:41,991 INFO L435 NwaCegarLoop]: 976 mSDtfsCounter, 2066 mSDsluCounter, 2926 mSDsCounter, 0 mSdLazyCounter, 1002 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2066 SdHoareTripleChecker+Valid, 3902 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-05 20:11:41,991 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2066 Valid, 3902 Invalid, 1003 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1002 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 20:11:41,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4202 states. [2025-02-05 20:11:42,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4202 to 4202. [2025-02-05 20:11:42,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4202 states, 4201 states have (on average 1.4805998571768626) internal successors, (6220), 4201 states have internal predecessors, (6220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:11:42,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4202 states to 4202 states and 6220 transitions. [2025-02-05 20:11:42,020 INFO L78 Accepts]: Start accepts. Automaton has 4202 states and 6220 transitions. Word has length 442 [2025-02-05 20:11:42,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:11:42,020 INFO L471 AbstractCegarLoop]: Abstraction has 4202 states and 6220 transitions. [2025-02-05 20:11:42,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 73.66666666666667) internal successors, (442), 6 states have internal predecessors, (442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:11:42,020 INFO L276 IsEmpty]: Start isEmpty. Operand 4202 states and 6220 transitions. [2025-02-05 20:11:42,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 444 [2025-02-05 20:11:42,024 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:11:42,024 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 20:11:42,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 20:11:42,025 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:11:42,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:11:42,025 INFO L85 PathProgramCache]: Analyzing trace with hash -46741227, now seen corresponding path program 1 times [2025-02-05 20:11:42,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:11:42,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323798166] [2025-02-05 20:11:42,025 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:11:42,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:11:42,156 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 443 statements into 1 equivalence classes. [2025-02-05 20:11:42,340 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 443 of 443 statements. [2025-02-05 20:11:42,340 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:11:42,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:11:43,200 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:11:43,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:11:43,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323798166] [2025-02-05 20:11:43,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323798166] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:11:43,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:11:43,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 20:11:43,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170652980] [2025-02-05 20:11:43,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:11:43,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 20:11:43,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:11:43,202 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 20:11:43,202 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-05 20:11:43,203 INFO L87 Difference]: Start difference. First operand 4202 states and 6220 transitions. Second operand has 6 states, 6 states have (on average 73.83333333333333) internal successors, (443), 6 states have internal predecessors, (443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:11:44,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:11:44,481 INFO L93 Difference]: Finished difference Result 7618 states and 11309 transitions. [2025-02-05 20:11:44,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 20:11:44,481 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 73.83333333333333) internal successors, (443), 6 states have internal predecessors, (443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 443 [2025-02-05 20:11:44,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:11:44,486 INFO L225 Difference]: With dead ends: 7618 [2025-02-05 20:11:44,486 INFO L226 Difference]: Without dead ends: 4220 [2025-02-05 20:11:44,489 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-05 20:11:44,489 INFO L435 NwaCegarLoop]: 549 mSDtfsCounter, 1192 mSDsluCounter, 1637 mSDsCounter, 0 mSdLazyCounter, 2715 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1192 SdHoareTripleChecker+Valid, 2186 SdHoareTripleChecker+Invalid, 2716 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2715 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-02-05 20:11:44,489 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1192 Valid, 2186 Invalid, 2716 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2715 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-02-05 20:11:44,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4220 states. [2025-02-05 20:11:44,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4220 to 4210. [2025-02-05 20:11:44,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4210 states, 4209 states have (on average 1.478736041815158) internal successors, (6224), 4209 states have internal predecessors, (6224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:11:44,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4210 states to 4210 states and 6224 transitions. [2025-02-05 20:11:44,515 INFO L78 Accepts]: Start accepts. Automaton has 4210 states and 6224 transitions. Word has length 443 [2025-02-05 20:11:44,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:11:44,515 INFO L471 AbstractCegarLoop]: Abstraction has 4210 states and 6224 transitions. [2025-02-05 20:11:44,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 73.83333333333333) internal successors, (443), 6 states have internal predecessors, (443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:11:44,515 INFO L276 IsEmpty]: Start isEmpty. Operand 4210 states and 6224 transitions. [2025-02-05 20:11:44,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 445 [2025-02-05 20:11:44,518 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:11:44,518 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 20:11:44,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 20:11:44,519 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:11:44,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:11:44,519 INFO L85 PathProgramCache]: Analyzing trace with hash -334244078, now seen corresponding path program 1 times [2025-02-05 20:11:44,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:11:44,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801461848] [2025-02-05 20:11:44,519 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:11:44,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:11:44,649 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 444 statements into 1 equivalence classes. [2025-02-05 20:11:50,002 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 444 of 444 statements. [2025-02-05 20:11:50,003 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:11:50,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:11:51,250 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:11:51,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:11:51,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801461848] [2025-02-05 20:11:51,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801461848] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:11:51,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:11:51,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 20:11:51,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89840503] [2025-02-05 20:11:51,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:11:51,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 20:11:51,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:11:51,253 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 20:11:51,253 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-05 20:11:51,253 INFO L87 Difference]: Start difference. First operand 4210 states and 6224 transitions. Second operand has 6 states, 6 states have (on average 74.0) internal successors, (444), 6 states have internal predecessors, (444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:11:52,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:11:52,604 INFO L93 Difference]: Finished difference Result 6934 states and 10270 transitions. [2025-02-05 20:11:52,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 20:11:52,604 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 74.0) internal successors, (444), 6 states have internal predecessors, (444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 444 [2025-02-05 20:11:52,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:11:52,611 INFO L225 Difference]: With dead ends: 6934 [2025-02-05 20:11:52,611 INFO L226 Difference]: Without dead ends: 4484 [2025-02-05 20:11:52,614 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 20:11:52,614 INFO L435 NwaCegarLoop]: 652 mSDtfsCounter, 1728 mSDsluCounter, 1846 mSDsCounter, 0 mSdLazyCounter, 3004 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1728 SdHoareTripleChecker+Valid, 2498 SdHoareTripleChecker+Invalid, 3005 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3004 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-02-05 20:11:52,614 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1728 Valid, 2498 Invalid, 3005 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3004 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-02-05 20:11:52,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4484 states. [2025-02-05 20:11:52,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4484 to 3900. [2025-02-05 20:11:52,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3900 states, 3899 states have (on average 1.478071300333419) internal successors, (5763), 3899 states have internal predecessors, (5763), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:11:52,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3900 states to 3900 states and 5763 transitions. [2025-02-05 20:11:52,656 INFO L78 Accepts]: Start accepts. Automaton has 3900 states and 5763 transitions. Word has length 444 [2025-02-05 20:11:52,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:11:52,656 INFO L471 AbstractCegarLoop]: Abstraction has 3900 states and 5763 transitions. [2025-02-05 20:11:52,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 74.0) internal successors, (444), 6 states have internal predecessors, (444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:11:52,657 INFO L276 IsEmpty]: Start isEmpty. Operand 3900 states and 5763 transitions. [2025-02-05 20:11:52,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 445 [2025-02-05 20:11:52,659 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:11:52,660 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 20:11:52,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-05 20:11:52,660 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:11:52,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:11:52,661 INFO L85 PathProgramCache]: Analyzing trace with hash -791747051, now seen corresponding path program 1 times [2025-02-05 20:11:52,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:11:52,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209115087] [2025-02-05 20:11:52,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:11:52,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:11:52,813 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 444 statements into 1 equivalence classes. [2025-02-05 20:11:56,512 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 444 of 444 statements. [2025-02-05 20:11:56,512 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:11:56,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:11:57,282 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:11:57,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:11:57,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209115087] [2025-02-05 20:11:57,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209115087] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:11:57,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:11:57,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 20:11:57,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284397229] [2025-02-05 20:11:57,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:11:57,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 20:11:57,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:11:57,284 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 20:11:57,284 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 20:11:57,284 INFO L87 Difference]: Start difference. First operand 3900 states and 5763 transitions. Second operand has 6 states, 6 states have (on average 74.0) internal successors, (444), 6 states have internal predecessors, (444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:11:58,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:11:58,129 INFO L93 Difference]: Finished difference Result 6524 states and 9652 transitions. [2025-02-05 20:11:58,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 20:11:58,130 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 74.0) internal successors, (444), 6 states have internal predecessors, (444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 444 [2025-02-05 20:11:58,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:11:58,139 INFO L225 Difference]: With dead ends: 6524 [2025-02-05 20:11:58,139 INFO L226 Difference]: Without dead ends: 4384 [2025-02-05 20:11:58,142 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-02-05 20:11:58,142 INFO L435 NwaCegarLoop]: 771 mSDtfsCounter, 3264 mSDsluCounter, 1599 mSDsCounter, 0 mSdLazyCounter, 1464 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3264 SdHoareTripleChecker+Valid, 2370 SdHoareTripleChecker+Invalid, 1472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1464 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 20:11:58,143 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3264 Valid, 2370 Invalid, 1472 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1464 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 20:11:58,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4384 states. [2025-02-05 20:11:58,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4384 to 4030. [2025-02-05 20:11:58,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4030 states, 4029 states have (on average 1.4775378505832713) internal successors, (5953), 4029 states have internal predecessors, (5953), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:11:58,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4030 states to 4030 states and 5953 transitions. [2025-02-05 20:11:58,185 INFO L78 Accepts]: Start accepts. Automaton has 4030 states and 5953 transitions. Word has length 444 [2025-02-05 20:11:58,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:11:58,185 INFO L471 AbstractCegarLoop]: Abstraction has 4030 states and 5953 transitions. [2025-02-05 20:11:58,185 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 74.0) internal successors, (444), 6 states have internal predecessors, (444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:11:58,186 INFO L276 IsEmpty]: Start isEmpty. Operand 4030 states and 5953 transitions. [2025-02-05 20:11:58,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 446 [2025-02-05 20:11:58,189 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:11:58,190 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 20:11:58,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-05 20:11:58,190 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:11:58,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:11:58,191 INFO L85 PathProgramCache]: Analyzing trace with hash -1564967555, now seen corresponding path program 1 times [2025-02-05 20:11:58,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:11:58,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297821992] [2025-02-05 20:11:58,191 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:11:58,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms