./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal10.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.cal10.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 7f53cc5681a5a08e9c1e07ab3be30428c8fa3fd345275d441a7b8c6544c83a42 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 18:24:12,360 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 18:24:12,418 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-02-05 18:24:12,425 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 18:24:12,425 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 18:24:12,442 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 18:24:12,442 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 18:24:12,442 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 18:24:12,443 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 18:24:12,443 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 18:24:12,443 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 18:24:12,443 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 18:24:12,443 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 18:24:12,443 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 18:24:12,443 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 18:24:12,443 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 18:24:12,443 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 18:24:12,443 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 18:24:12,443 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 18:24:12,443 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 18:24:12,443 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 18:24:12,444 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 18:24:12,444 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 18:24:12,444 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 18:24:12,444 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 18:24:12,444 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 18:24:12,444 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 18:24:12,444 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 18:24:12,444 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 18:24:12,444 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 18:24:12,444 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 18:24:12,444 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 18:24:12,444 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 18:24:12,444 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 18:24:12,444 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 18:24:12,444 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 18:24:12,444 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 18:24:12,446 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 18:24:12,446 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 18:24:12,446 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 18:24:12,446 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 -> 7f53cc5681a5a08e9c1e07ab3be30428c8fa3fd345275d441a7b8c6544c83a42 [2025-02-05 18:24:12,649 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 18:24:12,655 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 18:24:12,656 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 18:24:12,657 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 18:24:12,657 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 18:24:12,658 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.cal10.c [2025-02-05 18:24:13,795 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/509eead05/d8c6df8d60834a0aa72ba16e9ff90d0a/FLAGbc3904735 [2025-02-05 18:24:14,085 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 18:24:14,085 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal10.c [2025-02-05 18:24:14,098 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/509eead05/d8c6df8d60834a0aa72ba16e9ff90d0a/FLAGbc3904735 [2025-02-05 18:24:14,393 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/509eead05/d8c6df8d60834a0aa72ba16e9ff90d0a [2025-02-05 18:24:14,397 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 18:24:14,399 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 18:24:14,401 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 18:24:14,401 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 18:24:14,404 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 18:24:14,405 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 06:24:14" (1/1) ... [2025-02-05 18:24:14,406 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@526be6f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:24:14, skipping insertion in model container [2025-02-05 18:24:14,406 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 06:24:14" (1/1) ... [2025-02-05 18:24:14,456 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 18:24:14,598 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.cal10.c[1245,1258] [2025-02-05 18:24:14,898 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 18:24:14,905 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 18:24:14,914 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.cal10.c[1245,1258] [2025-02-05 18:24:15,051 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 18:24:15,061 INFO L204 MainTranslator]: Completed translation [2025-02-05 18:24:15,062 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:24:15 WrapperNode [2025-02-05 18:24:15,062 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 18:24:15,063 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 18:24:15,063 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 18:24:15,064 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 18:24:15,068 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:24:15" (1/1) ... [2025-02-05 18:24:15,115 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:24:15" (1/1) ... [2025-02-05 18:24:15,448 INFO L138 Inliner]: procedures = 17, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 3643 [2025-02-05 18:24:15,448 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 18:24:15,449 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 18:24:15,450 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 18:24:15,450 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 18:24:15,457 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:24:15" (1/1) ... [2025-02-05 18:24:15,457 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:24:15" (1/1) ... [2025-02-05 18:24:15,562 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:24:15" (1/1) ... [2025-02-05 18:24:15,665 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8]. The 0 writes are split as follows [0, 0]. [2025-02-05 18:24:15,666 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:24:15" (1/1) ... [2025-02-05 18:24:15,666 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:24:15" (1/1) ... [2025-02-05 18:24:15,766 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:24:15" (1/1) ... [2025-02-05 18:24:15,796 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:24:15" (1/1) ... [2025-02-05 18:24:15,832 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:24:15" (1/1) ... [2025-02-05 18:24:15,848 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:24:15" (1/1) ... [2025-02-05 18:24:15,897 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 18:24:15,899 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 18:24:15,899 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 18:24:15,899 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 18:24:15,899 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:24:15" (1/1) ... [2025-02-05 18:24:15,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 18:24:15,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 18:24:15,925 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 18:24:15,954 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 18:24:15,971 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 18:24:15,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 18:24:15,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-05 18:24:15,972 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 18:24:15,972 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 18:24:16,260 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 18:24:16,261 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 18:24:19,514 INFO L? ?]: Removed 2044 outVars from TransFormulas that were not future-live. [2025-02-05 18:24:19,514 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 18:24:19,625 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 18:24:19,625 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 18:24:19,625 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 06:24:19 BoogieIcfgContainer [2025-02-05 18:24:19,626 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 18:24:19,627 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 18:24:19,627 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 18:24:19,634 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 18:24:19,634 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 06:24:14" (1/3) ... [2025-02-05 18:24:19,634 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f70eb98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 06:24:19, skipping insertion in model container [2025-02-05 18:24:19,634 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:24:15" (2/3) ... [2025-02-05 18:24:19,635 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f70eb98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 06:24:19, skipping insertion in model container [2025-02-05 18:24:19,635 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 06:24:19" (3/3) ... [2025-02-05 18:24:19,635 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.cal10.c [2025-02-05 18:24:19,648 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 18:24:19,649 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.cal10.c that has 1 procedures, 1089 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 18:24:19,718 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 18:24:19,729 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;@2e9a74e8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 18:24:19,730 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 18:24:19,737 INFO L276 IsEmpty]: Start isEmpty. Operand has 1089 states, 1087 states have (on average 1.500459981600736) internal successors, (1631), 1088 states have internal predecessors, (1631), 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 18:24:19,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 348 [2025-02-05 18:24:19,755 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:24:19,756 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:24:19,757 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:24:19,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:24:19,761 INFO L85 PathProgramCache]: Analyzing trace with hash -1768693894, now seen corresponding path program 1 times [2025-02-05 18:24:19,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:24:19,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955589656] [2025-02-05 18:24:19,767 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:24:19,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:24:19,901 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 347 statements into 1 equivalence classes. [2025-02-05 18:24:20,488 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 347 of 347 statements. [2025-02-05 18:24:20,489 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:24:20,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:24:22,118 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 18:24:22,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:24:22,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955589656] [2025-02-05 18:24:22,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955589656] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:24:22,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:24:22,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 18:24:22,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218661797] [2025-02-05 18:24:22,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:24:22,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 18:24:22,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:24:22,147 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 18:24:22,147 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 18:24:22,151 INFO L87 Difference]: Start difference. First operand has 1089 states, 1087 states have (on average 1.500459981600736) internal successors, (1631), 1088 states have internal predecessors, (1631), 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 86.75) internal successors, (347), 4 states have internal predecessors, (347), 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 18:24:22,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:24:22,748 INFO L93 Difference]: Finished difference Result 2147 states and 3219 transitions. [2025-02-05 18:24:22,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 18:24:22,750 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 86.75) internal successors, (347), 4 states have internal predecessors, (347), 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 347 [2025-02-05 18:24:22,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:24:22,767 INFO L225 Difference]: With dead ends: 2147 [2025-02-05 18:24:22,770 INFO L226 Difference]: Without dead ends: 1088 [2025-02-05 18:24:22,774 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 18:24:22,776 INFO L435 NwaCegarLoop]: 1356 mSDtfsCounter, 0 mSDsluCounter, 2707 mSDsCounter, 0 mSdLazyCounter, 817 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4063 SdHoareTripleChecker+Invalid, 817 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 817 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 18:24:22,779 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4063 Invalid, 817 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 817 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 18:24:22,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1088 states. [2025-02-05 18:24:22,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1088 to 1088. [2025-02-05 18:24:22,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1088 states, 1087 states have (on average 1.4986200551977922) internal successors, (1629), 1087 states have internal predecessors, (1629), 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 18:24:22,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1629 transitions. [2025-02-05 18:24:22,848 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1629 transitions. Word has length 347 [2025-02-05 18:24:22,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:24:22,850 INFO L471 AbstractCegarLoop]: Abstraction has 1088 states and 1629 transitions. [2025-02-05 18:24:22,851 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 86.75) internal successors, (347), 4 states have internal predecessors, (347), 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 18:24:22,851 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1629 transitions. [2025-02-05 18:24:22,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2025-02-05 18:24:22,858 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:24:22,859 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:24:22,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 18:24:22,860 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:24:22,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:24:22,862 INFO L85 PathProgramCache]: Analyzing trace with hash 1009743965, now seen corresponding path program 1 times [2025-02-05 18:24:22,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:24:22,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470925585] [2025-02-05 18:24:22,862 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:24:22,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:24:22,947 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 348 statements into 1 equivalence classes. [2025-02-05 18:24:23,070 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 348 of 348 statements. [2025-02-05 18:24:23,071 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:24:23,071 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:24:23,723 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 18:24:23,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:24:23,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470925585] [2025-02-05 18:24:23,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470925585] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:24:23,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:24:23,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 18:24:23,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284785867] [2025-02-05 18:24:23,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:24:23,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 18:24:23,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:24:23,728 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 18:24:23,729 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 18:24:23,729 INFO L87 Difference]: Start difference. First operand 1088 states and 1629 transitions. Second operand has 4 states, 4 states have (on average 87.0) internal successors, (348), 4 states have internal predecessors, (348), 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 18:24:24,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:24:24,319 INFO L93 Difference]: Finished difference Result 2148 states and 3217 transitions. [2025-02-05 18:24:24,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 18:24:24,323 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 87.0) internal successors, (348), 4 states have internal predecessors, (348), 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 348 [2025-02-05 18:24:24,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:24:24,329 INFO L225 Difference]: With dead ends: 2148 [2025-02-05 18:24:24,329 INFO L226 Difference]: Without dead ends: 1090 [2025-02-05 18:24:24,330 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 18:24:24,333 INFO L435 NwaCegarLoop]: 1356 mSDtfsCounter, 0 mSDsluCounter, 2704 mSDsCounter, 0 mSdLazyCounter, 820 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4060 SdHoareTripleChecker+Invalid, 820 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 820 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 18:24:24,334 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4060 Invalid, 820 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 820 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 18:24:24,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1090 states. [2025-02-05 18:24:24,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1090 to 1090. [2025-02-05 18:24:24,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1090 states, 1089 states have (on average 1.497704315886134) internal successors, (1631), 1089 states have internal predecessors, (1631), 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 18:24:24,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1090 states to 1090 states and 1631 transitions. [2025-02-05 18:24:24,360 INFO L78 Accepts]: Start accepts. Automaton has 1090 states and 1631 transitions. Word has length 348 [2025-02-05 18:24:24,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:24:24,360 INFO L471 AbstractCegarLoop]: Abstraction has 1090 states and 1631 transitions. [2025-02-05 18:24:24,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 87.0) internal successors, (348), 4 states have internal predecessors, (348), 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 18:24:24,361 INFO L276 IsEmpty]: Start isEmpty. Operand 1090 states and 1631 transitions. [2025-02-05 18:24:24,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 350 [2025-02-05 18:24:24,364 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:24:24,364 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:24:24,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 18:24:24,364 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:24:24,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:24:24,365 INFO L85 PathProgramCache]: Analyzing trace with hash -1126165547, now seen corresponding path program 1 times [2025-02-05 18:24:24,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:24:24,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969966635] [2025-02-05 18:24:24,365 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:24:24,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:24:24,443 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 349 statements into 1 equivalence classes. [2025-02-05 18:24:25,374 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 349 of 349 statements. [2025-02-05 18:24:25,374 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:24:25,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:24:26,487 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 18:24:26,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:24:26,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969966635] [2025-02-05 18:24:26,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969966635] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:24:26,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:24:26,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 18:24:26,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152828565] [2025-02-05 18:24:26,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:24:26,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 18:24:26,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:24:26,490 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 18:24:26,490 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 18:24:26,490 INFO L87 Difference]: Start difference. First operand 1090 states and 1631 transitions. Second operand has 4 states, 4 states have (on average 87.25) internal successors, (349), 4 states have internal predecessors, (349), 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 18:24:26,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:24:26,950 INFO L93 Difference]: Finished difference Result 2150 states and 3218 transitions. [2025-02-05 18:24:26,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 18:24:26,951 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 87.25) internal successors, (349), 4 states have internal predecessors, (349), 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 349 [2025-02-05 18:24:26,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:24:26,955 INFO L225 Difference]: With dead ends: 2150 [2025-02-05 18:24:26,955 INFO L226 Difference]: Without dead ends: 1090 [2025-02-05 18:24:26,957 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 18:24:26,957 INFO L435 NwaCegarLoop]: 1354 mSDtfsCounter, 6 mSDsluCounter, 2698 mSDsCounter, 0 mSdLazyCounter, 817 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 4052 SdHoareTripleChecker+Invalid, 817 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 817 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 18:24:26,957 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 4052 Invalid, 817 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 817 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 18:24:26,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1090 states. [2025-02-05 18:24:26,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1090 to 1090. [2025-02-05 18:24:26,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1090 states, 1089 states have (on average 1.4967860422405876) internal successors, (1630), 1089 states have internal predecessors, (1630), 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 18:24:26,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1090 states to 1090 states and 1630 transitions. [2025-02-05 18:24:26,973 INFO L78 Accepts]: Start accepts. Automaton has 1090 states and 1630 transitions. Word has length 349 [2025-02-05 18:24:26,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:24:26,974 INFO L471 AbstractCegarLoop]: Abstraction has 1090 states and 1630 transitions. [2025-02-05 18:24:26,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 87.25) internal successors, (349), 4 states have internal predecessors, (349), 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 18:24:26,974 INFO L276 IsEmpty]: Start isEmpty. Operand 1090 states and 1630 transitions. [2025-02-05 18:24:26,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2025-02-05 18:24:26,977 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:24:26,978 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:24:26,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 18:24:26,978 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:24:26,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:24:26,979 INFO L85 PathProgramCache]: Analyzing trace with hash -334846587, now seen corresponding path program 1 times [2025-02-05 18:24:26,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:24:26,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507781480] [2025-02-05 18:24:26,979 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:24:26,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:24:27,042 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 350 statements into 1 equivalence classes. [2025-02-05 18:24:28,519 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 350 of 350 statements. [2025-02-05 18:24:28,519 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:24:28,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:24:29,813 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 18:24:29,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:24:29,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507781480] [2025-02-05 18:24:29,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507781480] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:24:29,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:24:29,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 18:24:29,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108560603] [2025-02-05 18:24:29,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:24:29,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 18:24:29,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:24:29,817 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 18:24:29,817 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 18:24:29,818 INFO L87 Difference]: Start difference. First operand 1090 states and 1630 transitions. Second operand has 6 states, 6 states have (on average 58.333333333333336) internal successors, (350), 6 states have internal predecessors, (350), 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 18:24:30,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:24:30,729 INFO L93 Difference]: Finished difference Result 2818 states and 4214 transitions. [2025-02-05 18:24:30,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 18:24:30,730 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 58.333333333333336) internal successors, (350), 6 states have internal predecessors, (350), 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 350 [2025-02-05 18:24:30,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:24:30,736 INFO L225 Difference]: With dead ends: 2818 [2025-02-05 18:24:30,736 INFO L226 Difference]: Without dead ends: 1758 [2025-02-05 18:24:30,738 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-02-05 18:24:30,740 INFO L435 NwaCegarLoop]: 1336 mSDtfsCounter, 4198 mSDsluCounter, 4009 mSDsCounter, 0 mSdLazyCounter, 1159 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4198 SdHoareTripleChecker+Valid, 5345 SdHoareTripleChecker+Invalid, 1159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 18:24:30,741 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4198 Valid, 5345 Invalid, 1159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1159 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 18:24:30,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1758 states. [2025-02-05 18:24:30,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1758 to 1739. [2025-02-05 18:24:30,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1739 states, 1738 states have (on average 1.497698504027618) internal successors, (2603), 1738 states have internal predecessors, (2603), 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 18:24:30,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1739 states to 1739 states and 2603 transitions. [2025-02-05 18:24:30,775 INFO L78 Accepts]: Start accepts. Automaton has 1739 states and 2603 transitions. Word has length 350 [2025-02-05 18:24:30,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:24:30,776 INFO L471 AbstractCegarLoop]: Abstraction has 1739 states and 2603 transitions. [2025-02-05 18:24:30,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 58.333333333333336) internal successors, (350), 6 states have internal predecessors, (350), 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 18:24:30,776 INFO L276 IsEmpty]: Start isEmpty. Operand 1739 states and 2603 transitions. [2025-02-05 18:24:30,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2025-02-05 18:24:30,779 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:24:30,779 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:24:30,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 18:24:30,779 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:24:30,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:24:30,780 INFO L85 PathProgramCache]: Analyzing trace with hash 98053586, now seen corresponding path program 1 times [2025-02-05 18:24:30,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:24:30,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297876252] [2025-02-05 18:24:30,780 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:24:30,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:24:30,846 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 351 statements into 1 equivalence classes. [2025-02-05 18:24:32,047 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 351 of 351 statements. [2025-02-05 18:24:32,047 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:24:32,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:24:32,953 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 18:24:32,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:24:32,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297876252] [2025-02-05 18:24:32,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297876252] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:24:32,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:24:32,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 18:24:32,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966993284] [2025-02-05 18:24:32,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:24:32,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 18:24:32,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:24:32,956 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 18:24:32,956 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-05 18:24:32,956 INFO L87 Difference]: Start difference. First operand 1739 states and 2603 transitions. Second operand has 8 states, 8 states have (on average 43.875) internal successors, (351), 8 states have internal predecessors, (351), 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 18:24:34,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:24:34,053 INFO L93 Difference]: Finished difference Result 2820 states and 4216 transitions. [2025-02-05 18:24:34,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 18:24:34,053 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 43.875) internal successors, (351), 8 states have internal predecessors, (351), 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 351 [2025-02-05 18:24:34,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:24:34,060 INFO L225 Difference]: With dead ends: 2820 [2025-02-05 18:24:34,060 INFO L226 Difference]: Without dead ends: 1760 [2025-02-05 18:24:34,062 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2025-02-05 18:24:34,064 INFO L435 NwaCegarLoop]: 1335 mSDtfsCounter, 4201 mSDsluCounter, 6671 mSDsCounter, 0 mSdLazyCounter, 1750 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4201 SdHoareTripleChecker+Valid, 8006 SdHoareTripleChecker+Invalid, 1750 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1750 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-05 18:24:34,064 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4201 Valid, 8006 Invalid, 1750 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1750 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-05 18:24:34,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1760 states. [2025-02-05 18:24:34,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1760 to 1742. [2025-02-05 18:24:34,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1742 states, 1741 states have (on average 1.4974152785755313) internal successors, (2607), 1741 states have internal predecessors, (2607), 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 18:24:34,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1742 states to 1742 states and 2607 transitions. [2025-02-05 18:24:34,097 INFO L78 Accepts]: Start accepts. Automaton has 1742 states and 2607 transitions. Word has length 351 [2025-02-05 18:24:34,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:24:34,097 INFO L471 AbstractCegarLoop]: Abstraction has 1742 states and 2607 transitions. [2025-02-05 18:24:34,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 43.875) internal successors, (351), 8 states have internal predecessors, (351), 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 18:24:34,098 INFO L276 IsEmpty]: Start isEmpty. Operand 1742 states and 2607 transitions. [2025-02-05 18:24:34,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2025-02-05 18:24:34,100 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:24:34,101 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:24:34,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 18:24:34,101 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:24:34,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:24:34,102 INFO L85 PathProgramCache]: Analyzing trace with hash -2047504111, now seen corresponding path program 1 times [2025-02-05 18:24:34,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:24:34,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897821884] [2025-02-05 18:24:34,102 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:24:34,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:24:34,175 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 352 statements into 1 equivalence classes. [2025-02-05 18:24:35,071 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 352 of 352 statements. [2025-02-05 18:24:35,071 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:24:35,071 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:24:35,940 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 18:24:35,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:24:35,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897821884] [2025-02-05 18:24:35,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897821884] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:24:35,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:24:35,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 18:24:35,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654868571] [2025-02-05 18:24:35,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:24:35,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 18:24:35,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:24:35,941 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 18:24:35,941 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 18:24:35,941 INFO L87 Difference]: Start difference. First operand 1742 states and 2607 transitions. Second operand has 6 states, 6 states have (on average 58.666666666666664) internal successors, (352), 6 states have internal predecessors, (352), 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 18:24:36,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:24:36,982 INFO L93 Difference]: Finished difference Result 3835 states and 5738 transitions. [2025-02-05 18:24:36,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 18:24:36,983 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 58.666666666666664) internal successors, (352), 6 states have internal predecessors, (352), 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 352 [2025-02-05 18:24:36,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:24:36,988 INFO L225 Difference]: With dead ends: 3835 [2025-02-05 18:24:36,988 INFO L226 Difference]: Without dead ends: 1750 [2025-02-05 18:24:36,991 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2025-02-05 18:24:36,991 INFO L435 NwaCegarLoop]: 2034 mSDtfsCounter, 3336 mSDsluCounter, 5273 mSDsCounter, 0 mSdLazyCounter, 1746 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3336 SdHoareTripleChecker+Valid, 7307 SdHoareTripleChecker+Invalid, 1779 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1746 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-05 18:24:36,991 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3336 Valid, 7307 Invalid, 1779 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1746 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-05 18:24:36,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1750 states. [2025-02-05 18:24:37,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1750 to 1746. [2025-02-05 18:24:37,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1746 states, 1745 states have (on average 1.4962750716332378) internal successors, (2611), 1745 states have internal predecessors, (2611), 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 18:24:37,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1746 states to 1746 states and 2611 transitions. [2025-02-05 18:24:37,047 INFO L78 Accepts]: Start accepts. Automaton has 1746 states and 2611 transitions. Word has length 352 [2025-02-05 18:24:37,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:24:37,047 INFO L471 AbstractCegarLoop]: Abstraction has 1746 states and 2611 transitions. [2025-02-05 18:24:37,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 58.666666666666664) internal successors, (352), 6 states have internal predecessors, (352), 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 18:24:37,047 INFO L276 IsEmpty]: Start isEmpty. Operand 1746 states and 2611 transitions. [2025-02-05 18:24:37,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 354 [2025-02-05 18:24:37,050 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:24:37,050 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:24:37,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 18:24:37,051 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:24:37,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:24:37,051 INFO L85 PathProgramCache]: Analyzing trace with hash 1581546268, now seen corresponding path program 1 times [2025-02-05 18:24:37,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:24:37,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080760940] [2025-02-05 18:24:37,051 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:24:37,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:24:37,121 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 353 statements into 1 equivalence classes. [2025-02-05 18:24:37,182 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 353 of 353 statements. [2025-02-05 18:24:37,183 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:24:37,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:24:37,868 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 18:24:37,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:24:37,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080760940] [2025-02-05 18:24:37,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080760940] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:24:37,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:24:37,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 18:24:37,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600006447] [2025-02-05 18:24:37,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:24:37,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 18:24:37,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:24:37,870 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 18:24:37,870 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 18:24:37,871 INFO L87 Difference]: Start difference. First operand 1746 states and 2611 transitions. Second operand has 5 states, 5 states have (on average 70.6) internal successors, (353), 5 states have internal predecessors, (353), 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 18:24:38,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:24:38,612 INFO L93 Difference]: Finished difference Result 2845 states and 4251 transitions. [2025-02-05 18:24:38,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 18:24:38,613 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 70.6) internal successors, (353), 5 states have internal predecessors, (353), 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 353 [2025-02-05 18:24:38,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:24:38,618 INFO L225 Difference]: With dead ends: 2845 [2025-02-05 18:24:38,618 INFO L226 Difference]: Without dead ends: 1754 [2025-02-05 18:24:38,620 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 18:24:38,620 INFO L435 NwaCegarLoop]: 1210 mSDtfsCounter, 1624 mSDsluCounter, 2417 mSDsCounter, 0 mSdLazyCounter, 1251 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1624 SdHoareTripleChecker+Valid, 3627 SdHoareTripleChecker+Invalid, 1252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 18:24:38,620 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1624 Valid, 3627 Invalid, 1252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1251 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 18:24:38,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1754 states. [2025-02-05 18:24:38,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1754 to 1752. [2025-02-05 18:24:38,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1752 states, 1751 states have (on average 1.4945745288406624) internal successors, (2617), 1751 states have internal predecessors, (2617), 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 18:24:38,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1752 states to 1752 states and 2617 transitions. [2025-02-05 18:24:38,648 INFO L78 Accepts]: Start accepts. Automaton has 1752 states and 2617 transitions. Word has length 353 [2025-02-05 18:24:38,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:24:38,649 INFO L471 AbstractCegarLoop]: Abstraction has 1752 states and 2617 transitions. [2025-02-05 18:24:38,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 70.6) internal successors, (353), 5 states have internal predecessors, (353), 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 18:24:38,649 INFO L276 IsEmpty]: Start isEmpty. Operand 1752 states and 2617 transitions. [2025-02-05 18:24:38,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 354 [2025-02-05 18:24:38,652 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:24:38,652 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:24:38,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 18:24:38,653 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:24:38,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:24:38,653 INFO L85 PathProgramCache]: Analyzing trace with hash 140775959, now seen corresponding path program 1 times [2025-02-05 18:24:38,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:24:38,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046948611] [2025-02-05 18:24:38,653 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:24:38,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:24:38,715 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 353 statements into 1 equivalence classes. [2025-02-05 18:24:39,715 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 353 of 353 statements. [2025-02-05 18:24:39,715 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:24:39,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:24:40,136 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 18:24:40,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:24:40,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046948611] [2025-02-05 18:24:40,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046948611] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:24:40,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:24:40,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 18:24:40,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102597644] [2025-02-05 18:24:40,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:24:40,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 18:24:40,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:24:40,137 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 18:24:40,138 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 18:24:40,138 INFO L87 Difference]: Start difference. First operand 1752 states and 2617 transitions. Second operand has 4 states, 4 states have (on average 88.25) internal successors, (353), 4 states have internal predecessors, (353), 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 18:24:41,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:24:41,026 INFO L93 Difference]: Finished difference Result 3842 states and 5740 transitions. [2025-02-05 18:24:41,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 18:24:41,026 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 88.25) internal successors, (353), 4 states have internal predecessors, (353), 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 353 [2025-02-05 18:24:41,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:24:41,032 INFO L225 Difference]: With dead ends: 3842 [2025-02-05 18:24:41,032 INFO L226 Difference]: Without dead ends: 1752 [2025-02-05 18:24:41,035 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 18:24:41,035 INFO L435 NwaCegarLoop]: 2039 mSDtfsCounter, 1426 mSDsluCounter, 3247 mSDsCounter, 0 mSdLazyCounter, 1295 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1426 SdHoareTripleChecker+Valid, 5286 SdHoareTripleChecker+Invalid, 1327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 18:24:41,036 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1426 Valid, 5286 Invalid, 1327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1295 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 18:24:41,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1752 states. [2025-02-05 18:24:41,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1752 to 1748. [2025-02-05 18:24:41,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1748 states, 1747 states have (on average 1.4945621064682313) internal successors, (2611), 1747 states have internal predecessors, (2611), 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 18:24:41,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1748 states to 1748 states and 2611 transitions. [2025-02-05 18:24:41,070 INFO L78 Accepts]: Start accepts. Automaton has 1748 states and 2611 transitions. Word has length 353 [2025-02-05 18:24:41,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:24:41,070 INFO L471 AbstractCegarLoop]: Abstraction has 1748 states and 2611 transitions. [2025-02-05 18:24:41,071 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 88.25) internal successors, (353), 4 states have internal predecessors, (353), 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 18:24:41,071 INFO L276 IsEmpty]: Start isEmpty. Operand 1748 states and 2611 transitions. [2025-02-05 18:24:41,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 355 [2025-02-05 18:24:41,073 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:24:41,073 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:24:41,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 18:24:41,075 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:24:41,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:24:41,076 INFO L85 PathProgramCache]: Analyzing trace with hash -1031608680, now seen corresponding path program 1 times [2025-02-05 18:24:41,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:24:41,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957186508] [2025-02-05 18:24:41,076 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:24:41,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:24:41,142 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 354 statements into 1 equivalence classes. [2025-02-05 18:24:42,261 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 354 of 354 statements. [2025-02-05 18:24:42,261 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:24:42,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:24:43,586 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 18:24:43,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:24:43,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957186508] [2025-02-05 18:24:43,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957186508] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:24:43,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:24:43,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 18:24:43,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940212221] [2025-02-05 18:24:43,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:24:43,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 18:24:43,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:24:43,588 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 18:24:43,588 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-05 18:24:43,589 INFO L87 Difference]: Start difference. First operand 1748 states and 2611 transitions. Second operand has 8 states, 8 states have (on average 44.25) internal successors, (354), 8 states have internal predecessors, (354), 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 18:24:44,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:24:44,415 INFO L93 Difference]: Finished difference Result 4141 states and 6189 transitions. [2025-02-05 18:24:44,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 18:24:44,416 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 44.25) internal successors, (354), 8 states have internal predecessors, (354), 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 354 [2025-02-05 18:24:44,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:24:44,423 INFO L225 Difference]: With dead ends: 4141 [2025-02-05 18:24:44,423 INFO L226 Difference]: Without dead ends: 2692 [2025-02-05 18:24:44,425 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2025-02-05 18:24:44,428 INFO L435 NwaCegarLoop]: 1344 mSDtfsCounter, 2994 mSDsluCounter, 6605 mSDsCounter, 0 mSdLazyCounter, 1837 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2994 SdHoareTripleChecker+Valid, 7949 SdHoareTripleChecker+Invalid, 1840 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1837 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 18:24:44,428 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2994 Valid, 7949 Invalid, 1840 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1837 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 18:24:44,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2692 states. [2025-02-05 18:24:44,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2692 to 2638. [2025-02-05 18:24:44,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2638 states, 2637 states have (on average 1.49677664012135) internal successors, (3947), 2637 states have internal predecessors, (3947), 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 18:24:44,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2638 states to 2638 states and 3947 transitions. [2025-02-05 18:24:44,464 INFO L78 Accepts]: Start accepts. Automaton has 2638 states and 3947 transitions. Word has length 354 [2025-02-05 18:24:44,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:24:44,464 INFO L471 AbstractCegarLoop]: Abstraction has 2638 states and 3947 transitions. [2025-02-05 18:24:44,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 44.25) internal successors, (354), 8 states have internal predecessors, (354), 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 18:24:44,465 INFO L276 IsEmpty]: Start isEmpty. Operand 2638 states and 3947 transitions. [2025-02-05 18:24:44,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 356 [2025-02-05 18:24:44,467 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:24:44,467 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:24:44,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 18:24:44,467 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:24:44,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:24:44,470 INFO L85 PathProgramCache]: Analyzing trace with hash -1173246609, now seen corresponding path program 1 times [2025-02-05 18:24:44,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:24:44,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528765244] [2025-02-05 18:24:44,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:24:44,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:24:44,532 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 355 statements into 1 equivalence classes. [2025-02-05 18:24:45,459 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 355 of 355 statements. [2025-02-05 18:24:45,460 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:24:45,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:24:46,104 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 18:24:46,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:24:46,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528765244] [2025-02-05 18:24:46,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528765244] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:24:46,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:24:46,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 18:24:46,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423420406] [2025-02-05 18:24:46,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:24:46,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 18:24:46,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:24:46,106 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 18:24:46,106 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-05 18:24:46,107 INFO L87 Difference]: Start difference. First operand 2638 states and 3947 transitions. Second operand has 7 states, 7 states have (on average 50.714285714285715) internal successors, (355), 7 states have internal predecessors, (355), 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 18:24:47,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:24:47,120 INFO L93 Difference]: Finished difference Result 4179 states and 6251 transitions. [2025-02-05 18:24:47,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 18:24:47,120 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 50.714285714285715) internal successors, (355), 7 states have internal predecessors, (355), 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 355 [2025-02-05 18:24:47,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:24:47,126 INFO L225 Difference]: With dead ends: 4179 [2025-02-05 18:24:47,126 INFO L226 Difference]: Without dead ends: 2646 [2025-02-05 18:24:47,127 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-05 18:24:47,128 INFO L435 NwaCegarLoop]: 1103 mSDtfsCounter, 1323 mSDsluCounter, 4398 mSDsCounter, 0 mSdLazyCounter, 2613 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1323 SdHoareTripleChecker+Valid, 5501 SdHoareTripleChecker+Invalid, 2614 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2613 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-05 18:24:47,128 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1323 Valid, 5501 Invalid, 2614 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2613 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-05 18:24:47,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2646 states. [2025-02-05 18:24:47,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2646 to 2642. [2025-02-05 18:24:47,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2642 states, 2641 states have (on average 1.496024233244983) internal successors, (3951), 2641 states have internal predecessors, (3951), 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 18:24:47,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2642 states to 2642 states and 3951 transitions. [2025-02-05 18:24:47,157 INFO L78 Accepts]: Start accepts. Automaton has 2642 states and 3951 transitions. Word has length 355 [2025-02-05 18:24:47,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:24:47,158 INFO L471 AbstractCegarLoop]: Abstraction has 2642 states and 3951 transitions. [2025-02-05 18:24:47,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 50.714285714285715) internal successors, (355), 7 states have internal predecessors, (355), 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 18:24:47,158 INFO L276 IsEmpty]: Start isEmpty. Operand 2642 states and 3951 transitions. [2025-02-05 18:24:47,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 356 [2025-02-05 18:24:47,160 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:24:47,160 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:24:47,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 18:24:47,160 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:24:47,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:24:47,161 INFO L85 PathProgramCache]: Analyzing trace with hash 1079246766, now seen corresponding path program 1 times [2025-02-05 18:24:47,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:24:47,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493649017] [2025-02-05 18:24:47,161 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:24:47,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:24:47,221 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 355 statements into 1 equivalence classes. [2025-02-05 18:24:47,961 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 355 of 355 statements. [2025-02-05 18:24:47,961 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:24:47,961 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:24:48,875 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 18:24:48,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:24:48,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493649017] [2025-02-05 18:24:48,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493649017] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:24:48,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:24:48,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 18:24:48,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880584028] [2025-02-05 18:24:48,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:24:48,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 18:24:48,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:24:48,876 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 18:24:48,876 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 18:24:48,876 INFO L87 Difference]: Start difference. First operand 2642 states and 3951 transitions. Second operand has 5 states, 5 states have (on average 71.0) internal successors, (355), 5 states have internal predecessors, (355), 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 18:24:49,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:24:49,382 INFO L93 Difference]: Finished difference Result 4193 states and 6265 transitions. [2025-02-05 18:24:49,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 18:24:49,382 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 71.0) internal successors, (355), 5 states have internal predecessors, (355), 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 355 [2025-02-05 18:24:49,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:24:49,388 INFO L225 Difference]: With dead ends: 4193 [2025-02-05 18:24:49,388 INFO L226 Difference]: Without dead ends: 2650 [2025-02-05 18:24:49,390 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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 18:24:49,391 INFO L435 NwaCegarLoop]: 1212 mSDtfsCounter, 1307 mSDsluCounter, 2419 mSDsCounter, 0 mSdLazyCounter, 1243 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1307 SdHoareTripleChecker+Valid, 3631 SdHoareTripleChecker+Invalid, 1243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 18:24:49,391 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1307 Valid, 3631 Invalid, 1243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1243 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 18:24:49,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2650 states. [2025-02-05 18:24:49,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2650 to 2648. [2025-02-05 18:24:49,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2648 states, 2647 states have (on average 1.494899886664148) internal successors, (3957), 2647 states have internal predecessors, (3957), 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 18:24:49,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2648 states to 2648 states and 3957 transitions. [2025-02-05 18:24:49,430 INFO L78 Accepts]: Start accepts. Automaton has 2648 states and 3957 transitions. Word has length 355 [2025-02-05 18:24:49,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:24:49,431 INFO L471 AbstractCegarLoop]: Abstraction has 2648 states and 3957 transitions. [2025-02-05 18:24:49,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 71.0) internal successors, (355), 5 states have internal predecessors, (355), 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 18:24:49,435 INFO L276 IsEmpty]: Start isEmpty. Operand 2648 states and 3957 transitions. [2025-02-05 18:24:49,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 357 [2025-02-05 18:24:49,437 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:24:49,437 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:24:49,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 18:24:49,438 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:24:49,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:24:49,438 INFO L85 PathProgramCache]: Analyzing trace with hash -172615522, now seen corresponding path program 1 times [2025-02-05 18:24:49,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:24:49,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771567380] [2025-02-05 18:24:49,438 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:24:49,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:24:49,507 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 356 statements into 1 equivalence classes. [2025-02-05 18:24:51,007 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 356 of 356 statements. [2025-02-05 18:24:51,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:24:51,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:24:51,715 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 18:24:51,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:24:51,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771567380] [2025-02-05 18:24:51,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [771567380] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:24:51,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:24:51,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 18:24:51,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832962593] [2025-02-05 18:24:51,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:24:51,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 18:24:51,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:24:51,717 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 18:24:51,717 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 18:24:51,718 INFO L87 Difference]: Start difference. First operand 2648 states and 3957 transitions. Second operand has 4 states, 4 states have (on average 89.0) internal successors, (356), 4 states have internal predecessors, (356), 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 18:24:52,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:24:52,092 INFO L93 Difference]: Finished difference Result 4266 states and 6368 transitions. [2025-02-05 18:24:52,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 18:24:52,093 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 89.0) internal successors, (356), 4 states have internal predecessors, (356), 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 356 [2025-02-05 18:24:52,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:24:52,099 INFO L225 Difference]: With dead ends: 4266 [2025-02-05 18:24:52,099 INFO L226 Difference]: Without dead ends: 2648 [2025-02-05 18:24:52,101 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 18:24:52,102 INFO L435 NwaCegarLoop]: 1346 mSDtfsCounter, 913 mSDsluCounter, 1734 mSDsCounter, 0 mSdLazyCounter, 642 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 913 SdHoareTripleChecker+Valid, 3080 SdHoareTripleChecker+Invalid, 642 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 642 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 18:24:52,102 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [913 Valid, 3080 Invalid, 642 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 642 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 18:24:52,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2648 states. [2025-02-05 18:24:52,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2648 to 2648. [2025-02-05 18:24:52,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2648 states, 2647 states have (on average 1.494144314318096) internal successors, (3955), 2647 states have internal predecessors, (3955), 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 18:24:52,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2648 states to 2648 states and 3955 transitions. [2025-02-05 18:24:52,134 INFO L78 Accepts]: Start accepts. Automaton has 2648 states and 3955 transitions. Word has length 356 [2025-02-05 18:24:52,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:24:52,134 INFO L471 AbstractCegarLoop]: Abstraction has 2648 states and 3955 transitions. [2025-02-05 18:24:52,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 89.0) internal successors, (356), 4 states have internal predecessors, (356), 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 18:24:52,135 INFO L276 IsEmpty]: Start isEmpty. Operand 2648 states and 3955 transitions. [2025-02-05 18:24:52,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 358 [2025-02-05 18:24:52,137 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:24:52,137 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:24:52,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 18:24:52,137 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:24:52,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:24:52,138 INFO L85 PathProgramCache]: Analyzing trace with hash 653034513, now seen corresponding path program 1 times [2025-02-05 18:24:52,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:24:52,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238431103] [2025-02-05 18:24:52,138 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:24:52,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:24:52,217 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 357 statements into 1 equivalence classes. [2025-02-05 18:24:53,713 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 357 of 357 statements. [2025-02-05 18:24:53,714 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:24:53,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:24:54,547 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 18:24:54,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:24:54,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238431103] [2025-02-05 18:24:54,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238431103] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:24:54,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:24:54,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 18:24:54,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998320223] [2025-02-05 18:24:54,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:24:54,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 18:24:54,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:24:54,548 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 18:24:54,548 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-05 18:24:54,548 INFO L87 Difference]: Start difference. First operand 2648 states and 3955 transitions. Second operand has 7 states, 7 states have (on average 51.0) internal successors, (357), 7 states have internal predecessors, (357), 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 18:24:55,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:24:55,488 INFO L93 Difference]: Finished difference Result 4270 states and 6371 transitions. [2025-02-05 18:24:55,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 18:24:55,488 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 51.0) internal successors, (357), 7 states have internal predecessors, (357), 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 357 [2025-02-05 18:24:55,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:24:55,498 INFO L225 Difference]: With dead ends: 4270 [2025-02-05 18:24:55,498 INFO L226 Difference]: Without dead ends: 2656 [2025-02-05 18:24:55,500 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-02-05 18:24:55,500 INFO L435 NwaCegarLoop]: 1097 mSDtfsCounter, 1362 mSDsluCounter, 3592 mSDsCounter, 0 mSdLazyCounter, 2278 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1362 SdHoareTripleChecker+Valid, 4689 SdHoareTripleChecker+Invalid, 2279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-05 18:24:55,500 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1362 Valid, 4689 Invalid, 2279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2278 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-05 18:24:55,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2656 states. [2025-02-05 18:24:55,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2656 to 2652. [2025-02-05 18:24:55,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2652 states, 2651 states have (on average 1.4933987174651076) internal successors, (3959), 2651 states have internal predecessors, (3959), 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 18:24:55,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2652 states to 2652 states and 3959 transitions. [2025-02-05 18:24:55,532 INFO L78 Accepts]: Start accepts. Automaton has 2652 states and 3959 transitions. Word has length 357 [2025-02-05 18:24:55,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:24:55,533 INFO L471 AbstractCegarLoop]: Abstraction has 2652 states and 3959 transitions. [2025-02-05 18:24:55,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 51.0) internal successors, (357), 7 states have internal predecessors, (357), 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 18:24:55,533 INFO L276 IsEmpty]: Start isEmpty. Operand 2652 states and 3959 transitions. [2025-02-05 18:24:55,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 359 [2025-02-05 18:24:55,535 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:24:55,535 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:24:55,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 18:24:55,536 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:24:55,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:24:55,536 INFO L85 PathProgramCache]: Analyzing trace with hash -1383406586, now seen corresponding path program 1 times [2025-02-05 18:24:55,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:24:55,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592540516] [2025-02-05 18:24:55,536 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:24:55,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:24:55,603 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 358 statements into 1 equivalence classes. [2025-02-05 18:24:56,772 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 358 of 358 statements. [2025-02-05 18:24:56,772 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:24:56,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:24:58,151 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 18:24:58,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:24:58,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592540516] [2025-02-05 18:24:58,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592540516] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:24:58,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:24:58,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 18:24:58,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90175868] [2025-02-05 18:24:58,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:24:58,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 18:24:58,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:24:58,152 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 18:24:58,152 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-02-05 18:24:58,152 INFO L87 Difference]: Start difference. First operand 2652 states and 3959 transitions. Second operand has 9 states, 9 states have (on average 39.77777777777778) internal successors, (358), 9 states have internal predecessors, (358), 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 18:24:59,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:24:59,121 INFO L93 Difference]: Finished difference Result 4185 states and 6243 transitions. [2025-02-05 18:24:59,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 18:24:59,122 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 39.77777777777778) internal successors, (358), 9 states have internal predecessors, (358), 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 358 [2025-02-05 18:24:59,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:24:59,128 INFO L225 Difference]: With dead ends: 4185 [2025-02-05 18:24:59,128 INFO L226 Difference]: Without dead ends: 2670 [2025-02-05 18:24:59,129 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2025-02-05 18:24:59,130 INFO L435 NwaCegarLoop]: 1328 mSDtfsCounter, 4181 mSDsluCounter, 7966 mSDsCounter, 0 mSdLazyCounter, 2074 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4181 SdHoareTripleChecker+Valid, 9294 SdHoareTripleChecker+Invalid, 2075 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2074 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-05 18:24:59,130 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4181 Valid, 9294 Invalid, 2075 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2074 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-05 18:24:59,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2670 states. [2025-02-05 18:24:59,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2670 to 2656. [2025-02-05 18:24:59,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2656 states, 2655 states have (on average 1.4930320150659133) internal successors, (3964), 2655 states have internal predecessors, (3964), 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 18:24:59,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2656 states to 2656 states and 3964 transitions. [2025-02-05 18:24:59,155 INFO L78 Accepts]: Start accepts. Automaton has 2656 states and 3964 transitions. Word has length 358 [2025-02-05 18:24:59,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:24:59,155 INFO L471 AbstractCegarLoop]: Abstraction has 2656 states and 3964 transitions. [2025-02-05 18:24:59,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 39.77777777777778) internal successors, (358), 9 states have internal predecessors, (358), 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 18:24:59,156 INFO L276 IsEmpty]: Start isEmpty. Operand 2656 states and 3964 transitions. [2025-02-05 18:24:59,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 360 [2025-02-05 18:24:59,158 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:24:59,158 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:24:59,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 18:24:59,158 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:24:59,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:24:59,159 INFO L85 PathProgramCache]: Analyzing trace with hash 73099130, now seen corresponding path program 1 times [2025-02-05 18:24:59,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:24:59,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845858011] [2025-02-05 18:24:59,159 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:24:59,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:24:59,219 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 359 statements into 1 equivalence classes. [2025-02-05 18:25:00,388 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 359 of 359 statements. [2025-02-05 18:25:00,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:25:00,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:25:01,071 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 18:25:01,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:25:01,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845858011] [2025-02-05 18:25:01,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845858011] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:25:01,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:25:01,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 18:25:01,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273295590] [2025-02-05 18:25:01,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:25:01,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 18:25:01,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:25:01,072 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 18:25:01,073 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 18:25:01,073 INFO L87 Difference]: Start difference. First operand 2656 states and 3964 transitions. Second operand has 5 states, 5 states have (on average 71.8) internal successors, (359), 5 states have internal predecessors, (359), 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 18:25:01,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:25:01,434 INFO L93 Difference]: Finished difference Result 4248 states and 6333 transitions. [2025-02-05 18:25:01,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 18:25:01,434 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 71.8) internal successors, (359), 5 states have internal predecessors, (359), 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 359 [2025-02-05 18:25:01,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:25:01,437 INFO L225 Difference]: With dead ends: 4248 [2025-02-05 18:25:01,438 INFO L226 Difference]: Without dead ends: 2656 [2025-02-05 18:25:01,439 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 18:25:01,439 INFO L435 NwaCegarLoop]: 1340 mSDtfsCounter, 1404 mSDsluCounter, 2656 mSDsCounter, 0 mSdLazyCounter, 837 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1404 SdHoareTripleChecker+Valid, 3996 SdHoareTripleChecker+Invalid, 837 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 837 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 18:25:01,439 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1404 Valid, 3996 Invalid, 837 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 837 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 18:25:01,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2656 states. [2025-02-05 18:25:01,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2656 to 2656. [2025-02-05 18:25:01,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2656 states, 2655 states have (on average 1.4922787193973635) internal successors, (3962), 2655 states have internal predecessors, (3962), 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 18:25:01,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2656 states to 2656 states and 3962 transitions. [2025-02-05 18:25:01,459 INFO L78 Accepts]: Start accepts. Automaton has 2656 states and 3962 transitions. Word has length 359 [2025-02-05 18:25:01,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:25:01,459 INFO L471 AbstractCegarLoop]: Abstraction has 2656 states and 3962 transitions. [2025-02-05 18:25:01,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 71.8) internal successors, (359), 5 states have internal predecessors, (359), 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 18:25:01,460 INFO L276 IsEmpty]: Start isEmpty. Operand 2656 states and 3962 transitions. [2025-02-05 18:25:01,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 361 [2025-02-05 18:25:01,461 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:25:01,462 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:25:01,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 18:25:01,462 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:25:01,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:25:01,462 INFO L85 PathProgramCache]: Analyzing trace with hash -1247343777, now seen corresponding path program 1 times [2025-02-05 18:25:01,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:25:01,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078570701] [2025-02-05 18:25:01,462 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:25:01,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:25:01,526 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 360 statements into 1 equivalence classes. [2025-02-05 18:25:01,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 360 of 360 statements. [2025-02-05 18:25:01,893 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:25:01,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:25:02,892 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 18:25:02,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:25:02,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078570701] [2025-02-05 18:25:02,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078570701] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:25:02,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:25:02,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 18:25:02,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217146926] [2025-02-05 18:25:02,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:25:02,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 18:25:02,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:25:02,894 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 18:25:02,894 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-02-05 18:25:02,894 INFO L87 Difference]: Start difference. First operand 2656 states and 3962 transitions. Second operand has 8 states, 8 states have (on average 45.0) internal successors, (360), 8 states have internal predecessors, (360), 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 18:25:03,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:25:03,566 INFO L93 Difference]: Finished difference Result 7470 states and 11140 transitions. [2025-02-05 18:25:03,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 18:25:03,566 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 45.0) internal successors, (360), 8 states have internal predecessors, (360), 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 360 [2025-02-05 18:25:03,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:25:03,573 INFO L225 Difference]: With dead ends: 7470 [2025-02-05 18:25:03,573 INFO L226 Difference]: Without dead ends: 5064 [2025-02-05 18:25:03,576 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2025-02-05 18:25:03,576 INFO L435 NwaCegarLoop]: 1341 mSDtfsCounter, 3932 mSDsluCounter, 6332 mSDsCounter, 0 mSdLazyCounter, 1622 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3932 SdHoareTripleChecker+Valid, 7673 SdHoareTripleChecker+Invalid, 1623 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1622 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 18:25:03,576 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3932 Valid, 7673 Invalid, 1623 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1622 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 18:25:03,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5064 states. [2025-02-05 18:25:03,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5064 to 4586. [2025-02-05 18:25:03,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4586 states, 4585 states have (on average 1.495310796074155) internal successors, (6856), 4585 states have internal predecessors, (6856), 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 18:25:03,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4586 states to 4586 states and 6856 transitions. [2025-02-05 18:25:03,635 INFO L78 Accepts]: Start accepts. Automaton has 4586 states and 6856 transitions. Word has length 360 [2025-02-05 18:25:03,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:25:03,635 INFO L471 AbstractCegarLoop]: Abstraction has 4586 states and 6856 transitions. [2025-02-05 18:25:03,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 45.0) internal successors, (360), 8 states have internal predecessors, (360), 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 18:25:03,635 INFO L276 IsEmpty]: Start isEmpty. Operand 4586 states and 6856 transitions. [2025-02-05 18:25:03,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 361 [2025-02-05 18:25:03,640 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:25:03,640 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:25:03,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 18:25:03,640 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:25:03,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:25:03,641 INFO L85 PathProgramCache]: Analyzing trace with hash 1518199090, now seen corresponding path program 1 times [2025-02-05 18:25:03,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:25:03,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636435467] [2025-02-05 18:25:03,641 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:25:03,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:25:03,720 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 360 statements into 1 equivalence classes. [2025-02-05 18:25:04,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 360 of 360 statements. [2025-02-05 18:25:04,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:25:04,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:25:04,941 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 18:25:04,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:25:04,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636435467] [2025-02-05 18:25:04,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636435467] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:25:04,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:25:04,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 18:25:04,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993063914] [2025-02-05 18:25:04,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:25:04,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 18:25:04,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:25:04,942 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 18:25:04,942 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 18:25:04,942 INFO L87 Difference]: Start difference. First operand 4586 states and 6856 transitions. Second operand has 5 states, 5 states have (on average 72.0) internal successors, (360), 5 states have internal predecessors, (360), 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 18:25:05,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:25:05,618 INFO L93 Difference]: Finished difference Result 7173 states and 10716 transitions. [2025-02-05 18:25:05,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 18:25:05,619 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 72.0) internal successors, (360), 5 states have internal predecessors, (360), 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 360 [2025-02-05 18:25:05,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:25:05,628 INFO L225 Difference]: With dead ends: 7173 [2025-02-05 18:25:05,629 INFO L226 Difference]: Without dead ends: 4588 [2025-02-05 18:25:05,635 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 18:25:05,636 INFO L435 NwaCegarLoop]: 1104 mSDtfsCounter, 1329 mSDsluCounter, 2204 mSDsCounter, 0 mSdLazyCounter, 1559 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1329 SdHoareTripleChecker+Valid, 3308 SdHoareTripleChecker+Invalid, 1560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1559 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 18:25:05,636 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1329 Valid, 3308 Invalid, 1560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1559 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 18:25:05,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4588 states. [2025-02-05 18:25:05,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4588 to 4588. [2025-02-05 18:25:05,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4588 states, 4587 states have (on average 1.4950948332243297) internal successors, (6858), 4587 states have internal predecessors, (6858), 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 18:25:05,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4588 states to 4588 states and 6858 transitions. [2025-02-05 18:25:05,682 INFO L78 Accepts]: Start accepts. Automaton has 4588 states and 6858 transitions. Word has length 360 [2025-02-05 18:25:05,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:25:05,682 INFO L471 AbstractCegarLoop]: Abstraction has 4588 states and 6858 transitions. [2025-02-05 18:25:05,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 72.0) internal successors, (360), 5 states have internal predecessors, (360), 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 18:25:05,682 INFO L276 IsEmpty]: Start isEmpty. Operand 4588 states and 6858 transitions. [2025-02-05 18:25:05,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 362 [2025-02-05 18:25:05,685 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:25:05,686 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:25:05,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 18:25:05,686 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:25:05,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:25:05,687 INFO L85 PathProgramCache]: Analyzing trace with hash -716772628, now seen corresponding path program 1 times [2025-02-05 18:25:05,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:25:05,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35540799] [2025-02-05 18:25:05,687 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:25:05,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:25:05,780 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 361 statements into 1 equivalence classes. [2025-02-05 18:25:06,707 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 361 of 361 statements. [2025-02-05 18:25:06,707 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:25:06,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:25:07,225 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 18:25:07,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:25:07,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35540799] [2025-02-05 18:25:07,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35540799] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:25:07,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:25:07,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 18:25:07,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478218353] [2025-02-05 18:25:07,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:25:07,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 18:25:07,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:25:07,226 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 18:25:07,226 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 18:25:07,226 INFO L87 Difference]: Start difference. First operand 4588 states and 6858 transitions. Second operand has 5 states, 5 states have (on average 72.2) internal successors, (361), 5 states have internal predecessors, (361), 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 18:25:07,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:25:07,765 INFO L93 Difference]: Finished difference Result 7656 states and 11424 transitions. [2025-02-05 18:25:07,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 18:25:07,766 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 72.2) internal successors, (361), 5 states have internal predecessors, (361), 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 361 [2025-02-05 18:25:07,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:25:07,772 INFO L225 Difference]: With dead ends: 7656 [2025-02-05 18:25:07,772 INFO L226 Difference]: Without dead ends: 4588 [2025-02-05 18:25:07,775 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 18:25:07,776 INFO L435 NwaCegarLoop]: 1345 mSDtfsCounter, 551 mSDsluCounter, 3444 mSDsCounter, 0 mSdLazyCounter, 1153 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 551 SdHoareTripleChecker+Valid, 4789 SdHoareTripleChecker+Invalid, 1156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 18:25:07,776 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [551 Valid, 4789 Invalid, 1156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1153 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 18:25:07,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4588 states. [2025-02-05 18:25:07,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4588 to 2826. [2025-02-05 18:25:07,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2826 states, 2825 states have (on average 1.4902654867256637) internal successors, (4210), 2825 states have internal predecessors, (4210), 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 18:25:07,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2826 states to 2826 states and 4210 transitions. [2025-02-05 18:25:07,806 INFO L78 Accepts]: Start accepts. Automaton has 2826 states and 4210 transitions. Word has length 361 [2025-02-05 18:25:07,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:25:07,806 INFO L471 AbstractCegarLoop]: Abstraction has 2826 states and 4210 transitions. [2025-02-05 18:25:07,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 72.2) internal successors, (361), 5 states have internal predecessors, (361), 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 18:25:07,806 INFO L276 IsEmpty]: Start isEmpty. Operand 2826 states and 4210 transitions. [2025-02-05 18:25:07,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 362 [2025-02-05 18:25:07,808 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:25:07,808 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:25:07,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-05 18:25:07,808 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:25:07,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:25:07,809 INFO L85 PathProgramCache]: Analyzing trace with hash 1851947183, now seen corresponding path program 1 times [2025-02-05 18:25:07,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:25:07,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206095657] [2025-02-05 18:25:07,810 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:25:07,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:25:07,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 361 statements into 1 equivalence classes. [2025-02-05 18:25:08,737 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 361 of 361 statements. [2025-02-05 18:25:08,737 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:25:08,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:25:09,761 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 18:25:09,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:25:09,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206095657] [2025-02-05 18:25:09,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206095657] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:25:09,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:25:09,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 18:25:09,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209817319] [2025-02-05 18:25:09,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:25:09,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 18:25:09,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:25:09,762 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 18:25:09,762 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-02-05 18:25:09,763 INFO L87 Difference]: Start difference. First operand 2826 states and 4210 transitions. Second operand has 8 states, 8 states have (on average 45.125) internal successors, (361), 8 states have internal predecessors, (361), 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 18:25:11,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:25:11,299 INFO L93 Difference]: Finished difference Result 6511 states and 9685 transitions. [2025-02-05 18:25:11,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 18:25:11,299 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 45.125) internal successors, (361), 8 states have internal predecessors, (361), 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 361 [2025-02-05 18:25:11,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:25:11,305 INFO L225 Difference]: With dead ends: 6511 [2025-02-05 18:25:11,305 INFO L226 Difference]: Without dead ends: 4362 [2025-02-05 18:25:11,307 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2025-02-05 18:25:11,308 INFO L435 NwaCegarLoop]: 2012 mSDtfsCounter, 2650 mSDsluCounter, 7927 mSDsCounter, 0 mSdLazyCounter, 4627 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2650 SdHoareTripleChecker+Valid, 9939 SdHoareTripleChecker+Invalid, 4628 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4627 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-02-05 18:25:11,308 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2650 Valid, 9939 Invalid, 4628 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4627 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-02-05 18:25:11,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4362 states. [2025-02-05 18:25:11,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4362 to 2826. [2025-02-05 18:25:11,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2826 states, 2825 states have (on average 1.4902654867256637) internal successors, (4210), 2825 states have internal predecessors, (4210), 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 18:25:11,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2826 states to 2826 states and 4210 transitions. [2025-02-05 18:25:11,342 INFO L78 Accepts]: Start accepts. Automaton has 2826 states and 4210 transitions. Word has length 361 [2025-02-05 18:25:11,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:25:11,342 INFO L471 AbstractCegarLoop]: Abstraction has 2826 states and 4210 transitions. [2025-02-05 18:25:11,342 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 45.125) internal successors, (361), 8 states have internal predecessors, (361), 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 18:25:11,342 INFO L276 IsEmpty]: Start isEmpty. Operand 2826 states and 4210 transitions. [2025-02-05 18:25:11,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 362 [2025-02-05 18:25:11,344 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:25:11,344 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:25:11,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-05 18:25:11,345 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:25:11,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:25:11,345 INFO L85 PathProgramCache]: Analyzing trace with hash -1220488169, now seen corresponding path program 1 times [2025-02-05 18:25:11,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:25:11,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766236566] [2025-02-05 18:25:11,346 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:25:11,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:25:11,411 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 361 statements into 1 equivalence classes. [2025-02-05 18:25:12,591 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 361 of 361 statements. [2025-02-05 18:25:12,591 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:25:12,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:25:13,402 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 18:25:13,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:25:13,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766236566] [2025-02-05 18:25:13,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766236566] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:25:13,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:25:13,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 18:25:13,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078814601] [2025-02-05 18:25:13,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:25:13,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 18:25:13,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:25:13,403 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 18:25:13,403 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-02-05 18:25:13,403 INFO L87 Difference]: Start difference. First operand 2826 states and 4210 transitions. Second operand has 8 states, 8 states have (on average 45.125) internal successors, (361), 8 states have internal predecessors, (361), 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 18:25:14,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:25:14,168 INFO L93 Difference]: Finished difference Result 4507 states and 6708 transitions. [2025-02-05 18:25:14,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 18:25:14,169 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 45.125) internal successors, (361), 8 states have internal predecessors, (361), 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 361 [2025-02-05 18:25:14,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:25:14,172 INFO L225 Difference]: With dead ends: 4507 [2025-02-05 18:25:14,172 INFO L226 Difference]: Without dead ends: 2834 [2025-02-05 18:25:14,173 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2025-02-05 18:25:14,173 INFO L435 NwaCegarLoop]: 1220 mSDtfsCounter, 1761 mSDsluCounter, 4877 mSDsCounter, 0 mSdLazyCounter, 1976 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1761 SdHoareTripleChecker+Valid, 6097 SdHoareTripleChecker+Invalid, 1977 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1976 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 18:25:14,174 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1761 Valid, 6097 Invalid, 1977 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1976 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 18:25:14,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2834 states. [2025-02-05 18:25:14,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2834 to 2832. [2025-02-05 18:25:14,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2832 states, 2831 states have (on average 1.4892264217590958) internal successors, (4216), 2831 states have internal predecessors, (4216), 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 18:25:14,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2832 states to 2832 states and 4216 transitions. [2025-02-05 18:25:14,193 INFO L78 Accepts]: Start accepts. Automaton has 2832 states and 4216 transitions. Word has length 361 [2025-02-05 18:25:14,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:25:14,193 INFO L471 AbstractCegarLoop]: Abstraction has 2832 states and 4216 transitions. [2025-02-05 18:25:14,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 45.125) internal successors, (361), 8 states have internal predecessors, (361), 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 18:25:14,193 INFO L276 IsEmpty]: Start isEmpty. Operand 2832 states and 4216 transitions. [2025-02-05 18:25:14,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 363 [2025-02-05 18:25:14,195 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:25:14,195 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:25:14,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-05 18:25:14,195 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:25:14,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:25:14,196 INFO L85 PathProgramCache]: Analyzing trace with hash 1135885553, now seen corresponding path program 1 times [2025-02-05 18:25:14,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:25:14,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452163000] [2025-02-05 18:25:14,196 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:25:14,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:25:14,255 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 362 statements into 1 equivalence classes. [2025-02-05 18:25:15,364 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 362 of 362 statements. [2025-02-05 18:25:15,364 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:25:15,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:25:15,755 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 18:25:15,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:25:15,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452163000] [2025-02-05 18:25:15,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452163000] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:25:15,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:25:15,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 18:25:15,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912096918] [2025-02-05 18:25:15,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:25:15,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 18:25:15,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:25:15,757 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 18:25:15,757 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 18:25:15,757 INFO L87 Difference]: Start difference. First operand 2832 states and 4216 transitions. Second operand has 4 states, 4 states have (on average 90.5) internal successors, (362), 4 states have internal predecessors, (362), 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 18:25:16,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:25:16,058 INFO L93 Difference]: Finished difference Result 4519 states and 6720 transitions. [2025-02-05 18:25:16,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 18:25:16,059 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 90.5) internal successors, (362), 4 states have internal predecessors, (362), 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 362 [2025-02-05 18:25:16,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:25:16,062 INFO L225 Difference]: With dead ends: 4519 [2025-02-05 18:25:16,062 INFO L226 Difference]: Without dead ends: 2838 [2025-02-05 18:25:16,064 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 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 18:25:16,065 INFO L435 NwaCegarLoop]: 1350 mSDtfsCounter, 0 mSDsluCounter, 2694 mSDsCounter, 0 mSdLazyCounter, 821 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4044 SdHoareTripleChecker+Invalid, 821 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 821 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 18:25:16,065 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4044 Invalid, 821 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 821 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 18:25:16,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2838 states. [2025-02-05 18:25:16,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2838 to 2838. [2025-02-05 18:25:16,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2838 states, 2837 states have (on average 1.4881917518505463) internal successors, (4222), 2837 states have internal predecessors, (4222), 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 18:25:16,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2838 states to 2838 states and 4222 transitions. [2025-02-05 18:25:16,089 INFO L78 Accepts]: Start accepts. Automaton has 2838 states and 4222 transitions. Word has length 362 [2025-02-05 18:25:16,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:25:16,089 INFO L471 AbstractCegarLoop]: Abstraction has 2838 states and 4222 transitions. [2025-02-05 18:25:16,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 90.5) internal successors, (362), 4 states have internal predecessors, (362), 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 18:25:16,089 INFO L276 IsEmpty]: Start isEmpty. Operand 2838 states and 4222 transitions. [2025-02-05 18:25:16,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 364 [2025-02-05 18:25:16,091 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:25:16,091 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:25:16,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-05 18:25:16,092 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:25:16,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:25:16,092 INFO L85 PathProgramCache]: Analyzing trace with hash 681443521, now seen corresponding path program 1 times [2025-02-05 18:25:16,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:25:16,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550199014] [2025-02-05 18:25:16,092 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:25:16,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:25:16,153 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 363 statements into 1 equivalence classes. [2025-02-05 18:25:17,127 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 363 of 363 statements. [2025-02-05 18:25:17,128 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:25:17,128 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:25:17,644 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 18:25:17,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:25:17,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550199014] [2025-02-05 18:25:17,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550199014] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:25:17,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:25:17,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 18:25:17,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266861935] [2025-02-05 18:25:17,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:25:17,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 18:25:17,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:25:17,645 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 18:25:17,645 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-02-05 18:25:17,646 INFO L87 Difference]: Start difference. First operand 2838 states and 4222 transitions. Second operand has 8 states, 8 states have (on average 45.375) internal successors, (363), 8 states have internal predecessors, (363), 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 18:25:18,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:25:18,766 INFO L93 Difference]: Finished difference Result 6590 states and 9780 transitions. [2025-02-05 18:25:18,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 18:25:18,766 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 45.375) internal successors, (363), 8 states have internal predecessors, (363), 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 363 [2025-02-05 18:25:18,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:25:18,771 INFO L225 Difference]: With dead ends: 6590 [2025-02-05 18:25:18,772 INFO L226 Difference]: Without dead ends: 4892 [2025-02-05 18:25:18,774 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-02-05 18:25:18,775 INFO L435 NwaCegarLoop]: 1100 mSDtfsCounter, 2205 mSDsluCounter, 5486 mSDsCounter, 0 mSdLazyCounter, 3187 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2205 SdHoareTripleChecker+Valid, 6586 SdHoareTripleChecker+Invalid, 3189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-05 18:25:18,775 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2205 Valid, 6586 Invalid, 3189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3187 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-05 18:25:18,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4892 states. [2025-02-05 18:25:18,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4892 to 4650. [2025-02-05 18:25:18,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4650 states, 4649 states have (on average 1.4893525489352548) internal successors, (6924), 4649 states have internal predecessors, (6924), 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 18:25:18,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4650 states to 4650 states and 6924 transitions. [2025-02-05 18:25:18,816 INFO L78 Accepts]: Start accepts. Automaton has 4650 states and 6924 transitions. Word has length 363 [2025-02-05 18:25:18,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:25:18,816 INFO L471 AbstractCegarLoop]: Abstraction has 4650 states and 6924 transitions. [2025-02-05 18:25:18,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 45.375) internal successors, (363), 8 states have internal predecessors, (363), 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 18:25:18,816 INFO L276 IsEmpty]: Start isEmpty. Operand 4650 states and 6924 transitions. [2025-02-05 18:25:18,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 364 [2025-02-05 18:25:18,819 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:25:18,819 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:25:18,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-05 18:25:18,820 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:25:18,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:25:18,821 INFO L85 PathProgramCache]: Analyzing trace with hash -979949133, now seen corresponding path program 1 times [2025-02-05 18:25:18,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:25:18,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813295011] [2025-02-05 18:25:18,821 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:25:18,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:25:18,890 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 363 statements into 1 equivalence classes. [2025-02-05 18:25:20,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 363 of 363 statements. [2025-02-05 18:25:20,702 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:25:20,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:25:21,509 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 18:25:21,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:25:21,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813295011] [2025-02-05 18:25:21,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813295011] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:25:21,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:25:21,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 18:25:21,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895883510] [2025-02-05 18:25:21,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:25:21,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 18:25:21,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:25:21,510 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 18:25:21,510 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-05 18:25:21,510 INFO L87 Difference]: Start difference. First operand 4650 states and 6924 transitions. Second operand has 8 states, 8 states have (on average 45.375) internal successors, (363), 8 states have internal predecessors, (363), 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 18:25:23,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:25:23,230 INFO L93 Difference]: Finished difference Result 9661 states and 14348 transitions. [2025-02-05 18:25:23,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 18:25:23,230 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 45.375) internal successors, (363), 8 states have internal predecessors, (363), 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 363 [2025-02-05 18:25:23,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:25:23,236 INFO L225 Difference]: With dead ends: 9661 [2025-02-05 18:25:23,236 INFO L226 Difference]: Without dead ends: 5233 [2025-02-05 18:25:23,241 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2025-02-05 18:25:23,241 INFO L435 NwaCegarLoop]: 1596 mSDtfsCounter, 3653 mSDsluCounter, 7328 mSDsCounter, 0 mSdLazyCounter, 3969 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3653 SdHoareTripleChecker+Valid, 8924 SdHoareTripleChecker+Invalid, 4027 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 3969 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-02-05 18:25:23,241 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3653 Valid, 8924 Invalid, 4027 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 3969 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-02-05 18:25:23,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5233 states. [2025-02-05 18:25:23,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5233 to 5197. [2025-02-05 18:25:23,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5197 states, 5196 states have (on average 1.474788298691301) internal successors, (7663), 5196 states have internal predecessors, (7663), 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 18:25:23,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5197 states to 5197 states and 7663 transitions. [2025-02-05 18:25:23,289 INFO L78 Accepts]: Start accepts. Automaton has 5197 states and 7663 transitions. Word has length 363 [2025-02-05 18:25:23,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:25:23,290 INFO L471 AbstractCegarLoop]: Abstraction has 5197 states and 7663 transitions. [2025-02-05 18:25:23,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 45.375) internal successors, (363), 8 states have internal predecessors, (363), 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 18:25:23,290 INFO L276 IsEmpty]: Start isEmpty. Operand 5197 states and 7663 transitions. [2025-02-05 18:25:23,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 365 [2025-02-05 18:25:23,293 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:25:23,293 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:25:23,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-05 18:25:23,294 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:25:23,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:25:23,294 INFO L85 PathProgramCache]: Analyzing trace with hash -41884623, now seen corresponding path program 1 times [2025-02-05 18:25:23,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:25:23,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970957737] [2025-02-05 18:25:23,295 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:25:23,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:25:23,361 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 364 statements into 1 equivalence classes. [2025-02-05 18:25:24,416 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 364 of 364 statements. [2025-02-05 18:25:24,416 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:25:24,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:25:25,305 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 18:25:25,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:25:25,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970957737] [2025-02-05 18:25:25,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970957737] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:25:25,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:25:25,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 18:25:25,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018840731] [2025-02-05 18:25:25,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:25:25,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 18:25:25,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:25:25,307 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 18:25:25,307 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-05 18:25:25,307 INFO L87 Difference]: Start difference. First operand 5197 states and 7663 transitions. Second operand has 7 states, 7 states have (on average 52.0) internal successors, (364), 7 states have internal predecessors, (364), 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 18:25:26,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:25:26,082 INFO L93 Difference]: Finished difference Result 12116 states and 17902 transitions. [2025-02-05 18:25:26,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 18:25:26,082 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 52.0) internal successors, (364), 7 states have internal predecessors, (364), 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 364 [2025-02-05 18:25:26,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:25:26,090 INFO L225 Difference]: With dead ends: 12116 [2025-02-05 18:25:26,090 INFO L226 Difference]: Without dead ends: 8557 [2025-02-05 18:25:26,094 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-02-05 18:25:26,095 INFO L435 NwaCegarLoop]: 1214 mSDtfsCounter, 2726 mSDsluCounter, 4835 mSDsCounter, 0 mSdLazyCounter, 2100 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2726 SdHoareTripleChecker+Valid, 6049 SdHoareTripleChecker+Invalid, 2100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 18:25:26,095 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2726 Valid, 6049 Invalid, 2100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2100 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 18:25:26,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8557 states. [2025-02-05 18:25:26,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8557 to 8349. [2025-02-05 18:25:26,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8349 states, 8348 states have (on average 1.483349305222808) internal successors, (12383), 8348 states have internal predecessors, (12383), 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 18:25:26,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8349 states to 8349 states and 12383 transitions. [2025-02-05 18:25:26,158 INFO L78 Accepts]: Start accepts. Automaton has 8349 states and 12383 transitions. Word has length 364 [2025-02-05 18:25:26,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:25:26,159 INFO L471 AbstractCegarLoop]: Abstraction has 8349 states and 12383 transitions. [2025-02-05 18:25:26,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 52.0) internal successors, (364), 7 states have internal predecessors, (364), 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 18:25:26,159 INFO L276 IsEmpty]: Start isEmpty. Operand 8349 states and 12383 transitions. [2025-02-05 18:25:26,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 365 [2025-02-05 18:25:26,164 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:25:26,164 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:25:26,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-05 18:25:26,164 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:25:26,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:25:26,165 INFO L85 PathProgramCache]: Analyzing trace with hash -1295579940, now seen corresponding path program 1 times [2025-02-05 18:25:26,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:25:26,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992368586] [2025-02-05 18:25:26,165 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:25:26,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:25:26,236 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 364 statements into 1 equivalence classes. [2025-02-05 18:25:27,329 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 364 of 364 statements. [2025-02-05 18:25:27,329 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:25:27,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:25:27,878 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 18:25:27,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:25:27,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992368586] [2025-02-05 18:25:27,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992368586] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:25:27,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:25:27,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 18:25:27,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184014703] [2025-02-05 18:25:27,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:25:27,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 18:25:27,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:25:27,879 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 18:25:27,879 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-05 18:25:27,879 INFO L87 Difference]: Start difference. First operand 8349 states and 12383 transitions. Second operand has 7 states, 7 states have (on average 52.0) internal successors, (364), 7 states have internal predecessors, (364), 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 18:25:28,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:25:28,824 INFO L93 Difference]: Finished difference Result 12747 states and 18907 transitions. [2025-02-05 18:25:28,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 18:25:28,825 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 52.0) internal successors, (364), 7 states have internal predecessors, (364), 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 364 [2025-02-05 18:25:28,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:25:28,832 INFO L225 Difference]: With dead ends: 12747 [2025-02-05 18:25:28,832 INFO L226 Difference]: Without dead ends: 8353 [2025-02-05 18:25:28,837 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-05 18:25:28,838 INFO L435 NwaCegarLoop]: 1100 mSDtfsCounter, 1288 mSDsluCounter, 4387 mSDsCounter, 0 mSdLazyCounter, 2613 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1288 SdHoareTripleChecker+Valid, 5487 SdHoareTripleChecker+Invalid, 2613 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2613 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-05 18:25:28,838 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1288 Valid, 5487 Invalid, 2613 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2613 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-05 18:25:28,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8353 states. [2025-02-05 18:25:28,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8353 to 8351. [2025-02-05 18:25:28,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8351 states, 8350 states have (on average 1.4832335329341317) internal successors, (12385), 8350 states have internal predecessors, (12385), 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 18:25:28,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8351 states to 8351 states and 12385 transitions. [2025-02-05 18:25:28,904 INFO L78 Accepts]: Start accepts. Automaton has 8351 states and 12385 transitions. Word has length 364 [2025-02-05 18:25:28,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:25:28,904 INFO L471 AbstractCegarLoop]: Abstraction has 8351 states and 12385 transitions. [2025-02-05 18:25:28,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 52.0) internal successors, (364), 7 states have internal predecessors, (364), 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 18:25:28,905 INFO L276 IsEmpty]: Start isEmpty. Operand 8351 states and 12385 transitions. [2025-02-05 18:25:28,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 365 [2025-02-05 18:25:28,909 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:25:28,909 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:25:28,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-02-05 18:25:28,910 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:25:28,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:25:28,910 INFO L85 PathProgramCache]: Analyzing trace with hash 1592120662, now seen corresponding path program 1 times [2025-02-05 18:25:28,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:25:28,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327698421] [2025-02-05 18:25:28,910 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:25:28,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:25:28,974 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 364 statements into 1 equivalence classes.