./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.Huffman_dec.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.Huffman_dec.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 3b0071c78088f9c96f862cb661d2ce94895d7fb3336b3cc889e5292b345efcdd --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 07:43:37,631 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 07:43:37,674 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-08 07:43:37,678 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 07:43:37,678 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 07:43:37,697 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 07:43:37,698 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 07:43:37,698 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 07:43:37,699 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 07:43:37,699 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 07:43:37,700 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 07:43:37,700 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 07:43:37,700 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 07:43:37,700 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 07:43:37,700 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 07:43:37,701 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 07:43:37,701 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 07:43:37,701 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 07:43:37,701 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 07:43:37,701 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 07:43:37,701 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 07:43:37,701 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 07:43:37,701 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 07:43:37,701 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 07:43:37,701 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 07:43:37,702 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 07:43:37,702 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 07:43:37,702 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 07:43:37,702 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 07:43:37,702 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 07:43:37,702 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 07:43:37,702 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 07:43:37,702 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 07:43:37,702 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 07:43:37,703 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 07:43:37,703 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 07:43:37,703 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 07:43:37,703 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 07:43:37,703 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 07:43:37,703 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 07:43:37,703 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3b0071c78088f9c96f862cb661d2ce94895d7fb3336b3cc889e5292b345efcdd [2025-03-08 07:43:37,937 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 07:43:37,945 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 07:43:37,949 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 07:43:37,950 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 07:43:37,950 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 07:43:37,951 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.Huffman_dec.c [2025-03-08 07:43:39,078 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d4d3e565a/579b0a4c428e48c09e6f641b8777eb91/FLAGfc87570f1 [2025-03-08 07:43:39,334 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 07:43:39,335 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.Huffman_dec.c [2025-03-08 07:43:39,342 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d4d3e565a/579b0a4c428e48c09e6f641b8777eb91/FLAGfc87570f1 [2025-03-08 07:43:39,646 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d4d3e565a/579b0a4c428e48c09e6f641b8777eb91 [2025-03-08 07:43:39,648 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 07:43:39,649 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 07:43:39,650 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 07:43:39,650 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 07:43:39,653 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 07:43:39,653 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 07:43:39" (1/1) ... [2025-03-08 07:43:39,654 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b75528f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:43:39, skipping insertion in model container [2025-03-08 07:43:39,654 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 07:43:39" (1/1) ... [2025-03-08 07:43:39,690 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 07:43:39,800 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.Huffman_dec.c[1251,1264] [2025-03-08 07:43:39,980 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 07:43:39,990 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 07:43:39,997 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.Huffman_dec.c[1251,1264] [2025-03-08 07:43:40,062 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 07:43:40,074 INFO L204 MainTranslator]: Completed translation [2025-03-08 07:43:40,074 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:43:40 WrapperNode [2025-03-08 07:43:40,075 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 07:43:40,076 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 07:43:40,076 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 07:43:40,076 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 07:43:40,080 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:43:40" (1/1) ... [2025-03-08 07:43:40,099 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:43:40" (1/1) ... [2025-03-08 07:43:40,181 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1334 [2025-03-08 07:43:40,182 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 07:43:40,182 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 07:43:40,182 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 07:43:40,183 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 07:43:40,189 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:43:40" (1/1) ... [2025-03-08 07:43:40,189 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:43:40" (1/1) ... [2025-03-08 07:43:40,204 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:43:40" (1/1) ... [2025-03-08 07:43:40,249 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 07:43:40,249 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:43:40" (1/1) ... [2025-03-08 07:43:40,249 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:43:40" (1/1) ... [2025-03-08 07:43:40,287 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:43:40" (1/1) ... [2025-03-08 07:43:40,299 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:43:40" (1/1) ... [2025-03-08 07:43:40,314 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:43:40" (1/1) ... [2025-03-08 07:43:40,322 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:43:40" (1/1) ... [2025-03-08 07:43:40,346 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 07:43:40,347 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 07:43:40,347 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 07:43:40,347 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 07:43:40,348 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:43:40" (1/1) ... [2025-03-08 07:43:40,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 07:43:40,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 07:43:40,373 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 07:43:40,375 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 07:43:40,393 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 07:43:40,393 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 07:43:40,393 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 07:43:40,393 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 07:43:40,573 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 07:43:40,574 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 07:43:41,830 INFO L? ?]: Removed 791 outVars from TransFormulas that were not future-live. [2025-03-08 07:43:41,830 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 07:43:41,881 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 07:43:41,883 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 07:43:41,883 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 07:43:41 BoogieIcfgContainer [2025-03-08 07:43:41,883 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 07:43:41,885 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 07:43:41,885 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 07:43:41,889 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 07:43:41,889 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 07:43:39" (1/3) ... [2025-03-08 07:43:41,889 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fe62a0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 07:43:41, skipping insertion in model container [2025-03-08 07:43:41,890 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:43:40" (2/3) ... [2025-03-08 07:43:41,890 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fe62a0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 07:43:41, skipping insertion in model container [2025-03-08 07:43:41,890 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 07:43:41" (3/3) ... [2025-03-08 07:43:41,891 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.Huffman_dec.c [2025-03-08 07:43:41,902 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 07:43:41,904 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.Huffman_dec.c that has 1 procedures, 290 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 07:43:41,955 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 07:43:41,963 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;@8c5027a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 07:43:41,965 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 07:43:41,968 INFO L276 IsEmpty]: Start isEmpty. Operand has 290 states, 288 states have (on average 1.4965277777777777) internal successors, (431), 289 states have internal predecessors, (431), 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-03-08 07:43:41,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-08 07:43:41,973 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:43:41,973 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] [2025-03-08 07:43:41,974 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:43:41,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:43:41,977 INFO L85 PathProgramCache]: Analyzing trace with hash -910901466, now seen corresponding path program 1 times [2025-03-08 07:43:41,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:43:41,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654559163] [2025-03-08 07:43:41,983 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:43:41,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:43:42,071 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-08 07:43:42,546 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-08 07:43:42,546 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:43:42,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:43:43,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:43:43,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:43:43,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654559163] [2025-03-08 07:43:43,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654559163] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:43:43,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:43:43,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 07:43:43,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313412617] [2025-03-08 07:43:43,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:43:43,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 07:43:43,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:43:43,303 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 07:43:43,304 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 07:43:43,306 INFO L87 Difference]: Start difference. First operand has 290 states, 288 states have (on average 1.4965277777777777) internal successors, (431), 289 states have internal predecessors, (431), 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 17.75) internal successors, (71), 4 states have internal predecessors, (71), 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-03-08 07:43:43,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:43:43,492 INFO L93 Difference]: Finished difference Result 569 states and 849 transitions. [2025-03-08 07:43:43,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 07:43:43,494 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 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 71 [2025-03-08 07:43:43,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:43:43,503 INFO L225 Difference]: With dead ends: 569 [2025-03-08 07:43:43,503 INFO L226 Difference]: Without dead ends: 289 [2025-03-08 07:43:43,506 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 07:43:43,510 INFO L435 NwaCegarLoop]: 355 mSDtfsCounter, 0 mSDsluCounter, 705 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1060 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 07:43:43,511 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1060 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 07:43:43,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2025-03-08 07:43:43,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 289. [2025-03-08 07:43:43,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 288 states have (on average 1.4895833333333333) internal successors, (429), 288 states have internal predecessors, (429), 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-03-08 07:43:43,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 429 transitions. [2025-03-08 07:43:43,551 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 429 transitions. Word has length 71 [2025-03-08 07:43:43,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:43:43,551 INFO L471 AbstractCegarLoop]: Abstraction has 289 states and 429 transitions. [2025-03-08 07:43:43,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 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-03-08 07:43:43,551 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 429 transitions. [2025-03-08 07:43:43,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-08 07:43:43,555 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:43:43,555 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] [2025-03-08 07:43:43,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 07:43:43,555 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:43:43,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:43:43,555 INFO L85 PathProgramCache]: Analyzing trace with hash 1831505030, now seen corresponding path program 1 times [2025-03-08 07:43:43,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:43:43,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728869693] [2025-03-08 07:43:43,556 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:43:43,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:43:43,598 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-08 07:43:43,643 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-08 07:43:43,644 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:43:43,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:43:43,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:43:43,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:43:43,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728869693] [2025-03-08 07:43:43,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728869693] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:43:43,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:43:43,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 07:43:43,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001440712] [2025-03-08 07:43:43,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:43:43,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 07:43:43,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:43:43,949 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 07:43:43,949 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 07:43:43,952 INFO L87 Difference]: Start difference. First operand 289 states and 429 transitions. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 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-03-08 07:43:44,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:43:44,102 INFO L93 Difference]: Finished difference Result 570 states and 847 transitions. [2025-03-08 07:43:44,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 07:43:44,102 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 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 72 [2025-03-08 07:43:44,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:43:44,104 INFO L225 Difference]: With dead ends: 570 [2025-03-08 07:43:44,105 INFO L226 Difference]: Without dead ends: 291 [2025-03-08 07:43:44,106 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-03-08 07:43:44,106 INFO L435 NwaCegarLoop]: 355 mSDtfsCounter, 0 mSDsluCounter, 702 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1057 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 07:43:44,107 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1057 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 07:43:44,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2025-03-08 07:43:44,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 291. [2025-03-08 07:43:44,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 290 states have (on average 1.486206896551724) internal successors, (431), 290 states have internal predecessors, (431), 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-03-08 07:43:44,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 431 transitions. [2025-03-08 07:43:44,125 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 431 transitions. Word has length 72 [2025-03-08 07:43:44,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:43:44,126 INFO L471 AbstractCegarLoop]: Abstraction has 291 states and 431 transitions. [2025-03-08 07:43:44,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 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-03-08 07:43:44,126 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 431 transitions. [2025-03-08 07:43:44,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-08 07:43:44,127 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:43:44,128 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] [2025-03-08 07:43:44,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 07:43:44,129 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:43:44,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:43:44,130 INFO L85 PathProgramCache]: Analyzing trace with hash -1421376735, now seen corresponding path program 1 times [2025-03-08 07:43:44,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:43:44,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811542181] [2025-03-08 07:43:44,131 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:43:44,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:43:44,183 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-08 07:43:44,400 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-08 07:43:44,400 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:43:44,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:43:45,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:43:45,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:43:45,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811542181] [2025-03-08 07:43:45,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811542181] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:43:45,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:43:45,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:43:45,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300209979] [2025-03-08 07:43:45,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:43:45,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:43:45,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:43:45,114 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:43:45,114 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:43:45,114 INFO L87 Difference]: Start difference. First operand 291 states and 431 transitions. Second operand has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 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-03-08 07:43:45,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:43:45,330 INFO L93 Difference]: Finished difference Result 574 states and 851 transitions. [2025-03-08 07:43:45,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 07:43:45,331 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 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 73 [2025-03-08 07:43:45,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:43:45,332 INFO L225 Difference]: With dead ends: 574 [2025-03-08 07:43:45,332 INFO L226 Difference]: Without dead ends: 293 [2025-03-08 07:43:45,332 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-08 07:43:45,333 INFO L435 NwaCegarLoop]: 355 mSDtfsCounter, 365 mSDsluCounter, 1052 mSDsCounter, 0 mSdLazyCounter, 300 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 365 SdHoareTripleChecker+Valid, 1407 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 07:43:45,333 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [365 Valid, 1407 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 300 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 07:43:45,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2025-03-08 07:43:45,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 293. [2025-03-08 07:43:45,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 292 states have (on average 1.4828767123287672) internal successors, (433), 292 states have internal predecessors, (433), 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-03-08 07:43:45,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 433 transitions. [2025-03-08 07:43:45,350 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 433 transitions. Word has length 73 [2025-03-08 07:43:45,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:43:45,350 INFO L471 AbstractCegarLoop]: Abstraction has 293 states and 433 transitions. [2025-03-08 07:43:45,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 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-03-08 07:43:45,350 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 433 transitions. [2025-03-08 07:43:45,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-08 07:43:45,353 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:43:45,353 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] [2025-03-08 07:43:45,353 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 07:43:45,354 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:43:45,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:43:45,354 INFO L85 PathProgramCache]: Analyzing trace with hash 775356939, now seen corresponding path program 1 times [2025-03-08 07:43:45,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:43:45,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076371919] [2025-03-08 07:43:45,354 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:43:45,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:43:45,388 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-08 07:43:45,596 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-08 07:43:45,597 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:43:45,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:43:52,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:43:52,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:43:52,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076371919] [2025-03-08 07:43:52,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076371919] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:43:52,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:43:52,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 07:43:52,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081138265] [2025-03-08 07:43:52,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:43:52,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 07:43:52,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:43:52,084 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 07:43:52,084 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 07:43:52,084 INFO L87 Difference]: Start difference. First operand 293 states and 433 transitions. Second operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 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-03-08 07:43:53,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:43:53,089 INFO L93 Difference]: Finished difference Result 576 states and 852 transitions. [2025-03-08 07:43:53,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 07:43:53,092 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 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 74 [2025-03-08 07:43:53,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:43:53,094 INFO L225 Difference]: With dead ends: 576 [2025-03-08 07:43:53,094 INFO L226 Difference]: Without dead ends: 293 [2025-03-08 07:43:53,095 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:43:53,095 INFO L435 NwaCegarLoop]: 206 mSDtfsCounter, 365 mSDsluCounter, 409 mSDsCounter, 0 mSdLazyCounter, 658 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 365 SdHoareTripleChecker+Valid, 615 SdHoareTripleChecker+Invalid, 659 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 658 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 07:43:53,095 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [365 Valid, 615 Invalid, 659 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 658 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 07:43:53,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2025-03-08 07:43:53,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 293. [2025-03-08 07:43:53,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 292 states have (on average 1.4794520547945205) internal successors, (432), 292 states have internal predecessors, (432), 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-03-08 07:43:53,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 432 transitions. [2025-03-08 07:43:53,114 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 432 transitions. Word has length 74 [2025-03-08 07:43:53,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:43:53,115 INFO L471 AbstractCegarLoop]: Abstraction has 293 states and 432 transitions. [2025-03-08 07:43:53,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 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-03-08 07:43:53,115 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 432 transitions. [2025-03-08 07:43:53,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-08 07:43:53,116 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:43:53,116 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] [2025-03-08 07:43:53,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 07:43:53,117 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:43:53,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:43:53,118 INFO L85 PathProgramCache]: Analyzing trace with hash 264352967, now seen corresponding path program 1 times [2025-03-08 07:43:53,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:43:53,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071992156] [2025-03-08 07:43:53,118 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:43:53,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:43:53,154 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-08 07:43:53,506 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-08 07:43:53,506 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:43:53,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:44:10,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:44:10,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:44:10,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071992156] [2025-03-08 07:44:10,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071992156] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:44:10,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:44:10,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [57] imperfect sequences [] total 57 [2025-03-08 07:44:10,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497887092] [2025-03-08 07:44:10,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:44:10,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2025-03-08 07:44:10,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:44:10,348 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2025-03-08 07:44:10,349 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=3054, Unknown=0, NotChecked=0, Total=3192 [2025-03-08 07:44:10,349 INFO L87 Difference]: Start difference. First operand 293 states and 432 transitions. Second operand has 57 states, 57 states have (on average 1.3157894736842106) internal successors, (75), 57 states have internal predecessors, (75), 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-03-08 07:44:21,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:44:21,805 INFO L93 Difference]: Finished difference Result 2008 states and 2985 transitions. [2025-03-08 07:44:21,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2025-03-08 07:44:21,805 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 57 states have (on average 1.3157894736842106) internal successors, (75), 57 states have internal predecessors, (75), 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 75 [2025-03-08 07:44:21,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:44:21,811 INFO L225 Difference]: With dead ends: 2008 [2025-03-08 07:44:21,811 INFO L226 Difference]: Without dead ends: 1725 [2025-03-08 07:44:21,814 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2107 ImplicationChecksByTransitivity, 12.5s TimeCoverageRelationStatistics Valid=1702, Invalid=10288, Unknown=0, NotChecked=0, Total=11990 [2025-03-08 07:44:21,814 INFO L435 NwaCegarLoop]: 320 mSDtfsCounter, 7552 mSDsluCounter, 17033 mSDsCounter, 0 mSdLazyCounter, 6620 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7552 SdHoareTripleChecker+Valid, 17353 SdHoareTripleChecker+Invalid, 6620 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6620 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2025-03-08 07:44:21,814 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7552 Valid, 17353 Invalid, 6620 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [0 Valid, 6620 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2025-03-08 07:44:21,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1725 states. [2025-03-08 07:44:21,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1725 to 347. [2025-03-08 07:44:21,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 347 states, 346 states have (on average 1.4797687861271676) internal successors, (512), 346 states have internal predecessors, (512), 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-03-08 07:44:21,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 512 transitions. [2025-03-08 07:44:21,835 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 512 transitions. Word has length 75 [2025-03-08 07:44:21,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:44:21,835 INFO L471 AbstractCegarLoop]: Abstraction has 347 states and 512 transitions. [2025-03-08 07:44:21,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 57 states have (on average 1.3157894736842106) internal successors, (75), 57 states have internal predecessors, (75), 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-03-08 07:44:21,836 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 512 transitions. [2025-03-08 07:44:21,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-08 07:44:21,836 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:44:21,836 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] [2025-03-08 07:44:21,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 07:44:21,837 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:44:21,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:44:21,837 INFO L85 PathProgramCache]: Analyzing trace with hash -931528508, now seen corresponding path program 1 times [2025-03-08 07:44:21,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:44:21,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686025762] [2025-03-08 07:44:21,837 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:44:21,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:44:21,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-08 07:44:21,882 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-08 07:44:21,882 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:44:21,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:44:22,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:44:22,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:44:22,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686025762] [2025-03-08 07:44:22,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686025762] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:44:22,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:44:22,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 07:44:22,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090273736] [2025-03-08 07:44:22,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:44:22,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 07:44:22,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:44:22,038 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 07:44:22,038 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 07:44:22,038 INFO L87 Difference]: Start difference. First operand 347 states and 512 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 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-03-08 07:44:22,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:44:22,268 INFO L93 Difference]: Finished difference Result 875 states and 1289 transitions. [2025-03-08 07:44:22,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 07:44:22,269 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 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 76 [2025-03-08 07:44:22,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:44:22,271 INFO L225 Difference]: With dead ends: 875 [2025-03-08 07:44:22,271 INFO L226 Difference]: Without dead ends: 538 [2025-03-08 07:44:22,272 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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-03-08 07:44:22,273 INFO L435 NwaCegarLoop]: 325 mSDtfsCounter, 794 mSDsluCounter, 645 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 794 SdHoareTripleChecker+Valid, 970 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 07:44:22,273 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [794 Valid, 970 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 07:44:22,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2025-03-08 07:44:22,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 377. [2025-03-08 07:44:22,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 376 states have (on average 1.476063829787234) internal successors, (555), 376 states have internal predecessors, (555), 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-03-08 07:44:22,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 555 transitions. [2025-03-08 07:44:22,290 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 555 transitions. Word has length 76 [2025-03-08 07:44:22,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:44:22,290 INFO L471 AbstractCegarLoop]: Abstraction has 377 states and 555 transitions. [2025-03-08 07:44:22,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 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-03-08 07:44:22,290 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 555 transitions. [2025-03-08 07:44:22,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-08 07:44:22,292 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:44:22,292 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:44:22,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 07:44:22,292 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:44:22,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:44:22,293 INFO L85 PathProgramCache]: Analyzing trace with hash 1764455226, now seen corresponding path program 1 times [2025-03-08 07:44:22,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:44:22,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571255788] [2025-03-08 07:44:22,293 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:44:22,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:44:22,331 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-08 07:44:22,350 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-08 07:44:22,350 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:44:22,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:44:22,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:44:22,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:44:22,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571255788] [2025-03-08 07:44:22,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571255788] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:44:22,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:44:22,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 07:44:22,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216654675] [2025-03-08 07:44:22,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:44:22,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 07:44:22,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:44:22,525 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 07:44:22,525 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 07:44:22,525 INFO L87 Difference]: Start difference. First operand 377 states and 555 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 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-03-08 07:44:22,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:44:22,752 INFO L93 Difference]: Finished difference Result 873 states and 1284 transitions. [2025-03-08 07:44:22,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 07:44:22,753 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 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 76 [2025-03-08 07:44:22,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:44:22,754 INFO L225 Difference]: With dead ends: 873 [2025-03-08 07:44:22,755 INFO L226 Difference]: Without dead ends: 536 [2025-03-08 07:44:22,756 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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-03-08 07:44:22,757 INFO L435 NwaCegarLoop]: 325 mSDtfsCounter, 782 mSDsluCounter, 645 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 782 SdHoareTripleChecker+Valid, 970 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 07:44:22,757 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [782 Valid, 970 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 07:44:22,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2025-03-08 07:44:22,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 387. [2025-03-08 07:44:22,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 387 states, 386 states have (on average 1.471502590673575) internal successors, (568), 386 states have internal predecessors, (568), 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-03-08 07:44:22,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 568 transitions. [2025-03-08 07:44:22,768 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 568 transitions. Word has length 76 [2025-03-08 07:44:22,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:44:22,769 INFO L471 AbstractCegarLoop]: Abstraction has 387 states and 568 transitions. [2025-03-08 07:44:22,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 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-03-08 07:44:22,769 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 568 transitions. [2025-03-08 07:44:22,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-08 07:44:22,769 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:44:22,770 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] [2025-03-08 07:44:22,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 07:44:22,770 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:44:22,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:44:22,771 INFO L85 PathProgramCache]: Analyzing trace with hash -1758162768, now seen corresponding path program 1 times [2025-03-08 07:44:22,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:44:22,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708378129] [2025-03-08 07:44:22,771 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:44:22,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:44:22,800 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-08 07:44:22,817 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-08 07:44:22,817 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:44:22,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:44:22,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:44:22,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:44:22,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708378129] [2025-03-08 07:44:22,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708378129] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:44:22,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:44:22,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 07:44:22,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017904374] [2025-03-08 07:44:22,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:44:22,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 07:44:22,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:44:22,953 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 07:44:22,954 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 07:44:22,954 INFO L87 Difference]: Start difference. First operand 387 states and 568 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 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-03-08 07:44:23,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:44:23,173 INFO L93 Difference]: Finished difference Result 871 states and 1279 transitions. [2025-03-08 07:44:23,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 07:44:23,174 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 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 76 [2025-03-08 07:44:23,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:44:23,176 INFO L225 Difference]: With dead ends: 871 [2025-03-08 07:44:23,176 INFO L226 Difference]: Without dead ends: 534 [2025-03-08 07:44:23,177 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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-03-08 07:44:23,177 INFO L435 NwaCegarLoop]: 325 mSDtfsCounter, 770 mSDsluCounter, 645 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 770 SdHoareTripleChecker+Valid, 970 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 07:44:23,178 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [770 Valid, 970 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 07:44:23,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2025-03-08 07:44:23,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 397. [2025-03-08 07:44:23,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 397 states, 396 states have (on average 1.4671717171717171) internal successors, (581), 396 states have internal predecessors, (581), 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-03-08 07:44:23,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 581 transitions. [2025-03-08 07:44:23,189 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 581 transitions. Word has length 76 [2025-03-08 07:44:23,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:44:23,190 INFO L471 AbstractCegarLoop]: Abstraction has 397 states and 581 transitions. [2025-03-08 07:44:23,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 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-03-08 07:44:23,190 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 581 transitions. [2025-03-08 07:44:23,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-08 07:44:23,190 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:44:23,190 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] [2025-03-08 07:44:23,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 07:44:23,192 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:44:23,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:44:23,194 INFO L85 PathProgramCache]: Analyzing trace with hash -1313866121, now seen corresponding path program 1 times [2025-03-08 07:44:23,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:44:23,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555692702] [2025-03-08 07:44:23,194 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:44:23,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:44:23,222 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-08 07:44:23,263 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-08 07:44:23,264 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:44:23,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:44:23,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:44:23,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:44:23,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555692702] [2025-03-08 07:44:23,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555692702] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:44:23,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:44:23,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 07:44:23,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59754691] [2025-03-08 07:44:23,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:44:23,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 07:44:23,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:44:23,477 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 07:44:23,477 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 07:44:23,478 INFO L87 Difference]: Start difference. First operand 397 states and 581 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 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-03-08 07:44:23,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:44:23,749 INFO L93 Difference]: Finished difference Result 869 states and 1274 transitions. [2025-03-08 07:44:23,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 07:44:23,750 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 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 76 [2025-03-08 07:44:23,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:44:23,751 INFO L225 Difference]: With dead ends: 869 [2025-03-08 07:44:23,755 INFO L226 Difference]: Without dead ends: 532 [2025-03-08 07:44:23,756 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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-03-08 07:44:23,757 INFO L435 NwaCegarLoop]: 325 mSDtfsCounter, 752 mSDsluCounter, 645 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 752 SdHoareTripleChecker+Valid, 970 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 07:44:23,757 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [752 Valid, 970 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 07:44:23,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2025-03-08 07:44:23,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 425. [2025-03-08 07:44:23,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 425 states, 424 states have (on average 1.4646226415094339) internal successors, (621), 424 states have internal predecessors, (621), 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-03-08 07:44:23,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 621 transitions. [2025-03-08 07:44:23,773 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 621 transitions. Word has length 76 [2025-03-08 07:44:23,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:44:23,773 INFO L471 AbstractCegarLoop]: Abstraction has 425 states and 621 transitions. [2025-03-08 07:44:23,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 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-03-08 07:44:23,774 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 621 transitions. [2025-03-08 07:44:23,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-08 07:44:23,774 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:44:23,774 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] [2025-03-08 07:44:23,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 07:44:23,775 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:44:23,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:44:23,777 INFO L85 PathProgramCache]: Analyzing trace with hash -1919794579, now seen corresponding path program 1 times [2025-03-08 07:44:23,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:44:23,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674888504] [2025-03-08 07:44:23,777 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:44:23,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:44:23,834 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-08 07:44:23,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-08 07:44:23,851 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:44:23,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:44:24,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:44:24,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:44:24,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674888504] [2025-03-08 07:44:24,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674888504] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:44:24,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:44:24,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 07:44:24,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916744903] [2025-03-08 07:44:24,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:44:24,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 07:44:24,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:44:24,001 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 07:44:24,001 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 07:44:24,001 INFO L87 Difference]: Start difference. First operand 425 states and 621 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 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-03-08 07:44:24,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:44:24,209 INFO L93 Difference]: Finished difference Result 867 states and 1269 transitions. [2025-03-08 07:44:24,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 07:44:24,210 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 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 76 [2025-03-08 07:44:24,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:44:24,211 INFO L225 Difference]: With dead ends: 867 [2025-03-08 07:44:24,211 INFO L226 Difference]: Without dead ends: 530 [2025-03-08 07:44:24,212 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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-03-08 07:44:24,212 INFO L435 NwaCegarLoop]: 325 mSDtfsCounter, 740 mSDsluCounter, 645 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 740 SdHoareTripleChecker+Valid, 970 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 07:44:24,212 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [740 Valid, 970 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 07:44:24,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2025-03-08 07:44:24,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 435. [2025-03-08 07:44:24,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 435 states, 434 states have (on average 1.4608294930875576) internal successors, (634), 434 states have internal predecessors, (634), 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-03-08 07:44:24,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 634 transitions. [2025-03-08 07:44:24,222 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 634 transitions. Word has length 76 [2025-03-08 07:44:24,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:44:24,222 INFO L471 AbstractCegarLoop]: Abstraction has 435 states and 634 transitions. [2025-03-08 07:44:24,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 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-03-08 07:44:24,222 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 634 transitions. [2025-03-08 07:44:24,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-08 07:44:24,223 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:44:24,223 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] [2025-03-08 07:44:24,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 07:44:24,223 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:44:24,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:44:24,223 INFO L85 PathProgramCache]: Analyzing trace with hash -2096084876, now seen corresponding path program 1 times [2025-03-08 07:44:24,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:44:24,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547601792] [2025-03-08 07:44:24,224 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:44:24,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:44:24,250 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-08 07:44:24,275 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-08 07:44:24,276 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:44:24,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:44:24,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:44:24,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:44:24,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547601792] [2025-03-08 07:44:24,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547601792] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:44:24,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:44:24,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 07:44:24,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904486880] [2025-03-08 07:44:24,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:44:24,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 07:44:24,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:44:24,405 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 07:44:24,406 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 07:44:24,406 INFO L87 Difference]: Start difference. First operand 435 states and 634 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 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-03-08 07:44:24,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:44:24,612 INFO L93 Difference]: Finished difference Result 865 states and 1264 transitions. [2025-03-08 07:44:24,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 07:44:24,612 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 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 76 [2025-03-08 07:44:24,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:44:24,614 INFO L225 Difference]: With dead ends: 865 [2025-03-08 07:44:24,614 INFO L226 Difference]: Without dead ends: 528 [2025-03-08 07:44:24,614 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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-03-08 07:44:24,615 INFO L435 NwaCegarLoop]: 325 mSDtfsCounter, 722 mSDsluCounter, 645 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 722 SdHoareTripleChecker+Valid, 970 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 07:44:24,615 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [722 Valid, 970 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 07:44:24,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2025-03-08 07:44:24,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 463. [2025-03-08 07:44:24,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 463 states, 462 states have (on average 1.4588744588744589) internal successors, (674), 462 states have internal predecessors, (674), 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-03-08 07:44:24,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 674 transitions. [2025-03-08 07:44:24,624 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 674 transitions. Word has length 76 [2025-03-08 07:44:24,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:44:24,624 INFO L471 AbstractCegarLoop]: Abstraction has 463 states and 674 transitions. [2025-03-08 07:44:24,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 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-03-08 07:44:24,624 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 674 transitions. [2025-03-08 07:44:24,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-08 07:44:24,636 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:44:24,636 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] [2025-03-08 07:44:24,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 07:44:24,636 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:44:24,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:44:24,637 INFO L85 PathProgramCache]: Analyzing trace with hash -2013719830, now seen corresponding path program 1 times [2025-03-08 07:44:24,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:44:24,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003217891] [2025-03-08 07:44:24,637 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:44:24,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:44:24,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-08 07:44:24,677 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-08 07:44:24,677 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:44:24,677 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:44:24,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:44:24,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:44:24,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003217891] [2025-03-08 07:44:24,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003217891] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:44:24,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:44:24,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 07:44:24,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640835966] [2025-03-08 07:44:24,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:44:24,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 07:44:24,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:44:24,803 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 07:44:24,803 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 07:44:24,803 INFO L87 Difference]: Start difference. First operand 463 states and 674 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 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-03-08 07:44:24,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:44:24,996 INFO L93 Difference]: Finished difference Result 863 states and 1259 transitions. [2025-03-08 07:44:24,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 07:44:24,998 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 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 76 [2025-03-08 07:44:24,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:44:24,999 INFO L225 Difference]: With dead ends: 863 [2025-03-08 07:44:24,999 INFO L226 Difference]: Without dead ends: 526 [2025-03-08 07:44:25,000 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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-03-08 07:44:25,000 INFO L435 NwaCegarLoop]: 325 mSDtfsCounter, 710 mSDsluCounter, 645 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 710 SdHoareTripleChecker+Valid, 970 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 07:44:25,000 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [710 Valid, 970 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 07:44:25,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2025-03-08 07:44:25,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 473. [2025-03-08 07:44:25,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 473 states, 472 states have (on average 1.4555084745762712) internal successors, (687), 472 states have internal predecessors, (687), 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-03-08 07:44:25,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 687 transitions. [2025-03-08 07:44:25,010 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 687 transitions. Word has length 76 [2025-03-08 07:44:25,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:44:25,010 INFO L471 AbstractCegarLoop]: Abstraction has 473 states and 687 transitions. [2025-03-08 07:44:25,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 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-03-08 07:44:25,010 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 687 transitions. [2025-03-08 07:44:25,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-08 07:44:25,011 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:44:25,011 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] [2025-03-08 07:44:25,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 07:44:25,011 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:44:25,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:44:25,012 INFO L85 PathProgramCache]: Analyzing trace with hash -878344096, now seen corresponding path program 1 times [2025-03-08 07:44:25,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:44:25,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170260636] [2025-03-08 07:44:25,012 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:44:25,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:44:25,039 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-08 07:44:25,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-08 07:44:25,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:44:25,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:44:25,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:44:25,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:44:25,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170260636] [2025-03-08 07:44:25,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170260636] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:44:25,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:44:25,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 07:44:25,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690798222] [2025-03-08 07:44:25,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:44:25,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 07:44:25,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:44:25,196 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 07:44:25,196 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 07:44:25,197 INFO L87 Difference]: Start difference. First operand 473 states and 687 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 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-03-08 07:44:25,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:44:25,402 INFO L93 Difference]: Finished difference Result 861 states and 1254 transitions. [2025-03-08 07:44:25,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 07:44:25,403 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 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 76 [2025-03-08 07:44:25,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:44:25,404 INFO L225 Difference]: With dead ends: 861 [2025-03-08 07:44:25,404 INFO L226 Difference]: Without dead ends: 524 [2025-03-08 07:44:25,405 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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-03-08 07:44:25,405 INFO L435 NwaCegarLoop]: 325 mSDtfsCounter, 698 mSDsluCounter, 645 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 698 SdHoareTripleChecker+Valid, 970 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 07:44:25,405 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [698 Valid, 970 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 07:44:25,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2025-03-08 07:44:25,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 483. [2025-03-08 07:44:25,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 483 states, 482 states have (on average 1.4522821576763485) internal successors, (700), 482 states have internal predecessors, (700), 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-03-08 07:44:25,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 483 states and 700 transitions. [2025-03-08 07:44:25,415 INFO L78 Accepts]: Start accepts. Automaton has 483 states and 700 transitions. Word has length 76 [2025-03-08 07:44:25,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:44:25,415 INFO L471 AbstractCegarLoop]: Abstraction has 483 states and 700 transitions. [2025-03-08 07:44:25,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 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-03-08 07:44:25,415 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 700 transitions. [2025-03-08 07:44:25,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-08 07:44:25,416 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:44:25,416 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] [2025-03-08 07:44:25,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 07:44:25,417 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:44:25,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:44:25,417 INFO L85 PathProgramCache]: Analyzing trace with hash 10692822, now seen corresponding path program 1 times [2025-03-08 07:44:25,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:44:25,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910567239] [2025-03-08 07:44:25,417 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:44:25,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:44:25,444 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-08 07:44:25,460 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-08 07:44:25,460 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:44:25,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:44:25,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:44:25,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:44:25,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910567239] [2025-03-08 07:44:25,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910567239] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:44:25,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:44:25,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 07:44:25,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095155816] [2025-03-08 07:44:25,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:44:25,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 07:44:25,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:44:25,670 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 07:44:25,670 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 07:44:25,670 INFO L87 Difference]: Start difference. First operand 483 states and 700 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 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-03-08 07:44:25,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:44:25,831 INFO L93 Difference]: Finished difference Result 859 states and 1249 transitions. [2025-03-08 07:44:25,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 07:44:25,831 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 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 76 [2025-03-08 07:44:25,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:44:25,833 INFO L225 Difference]: With dead ends: 859 [2025-03-08 07:44:25,833 INFO L226 Difference]: Without dead ends: 522 [2025-03-08 07:44:25,833 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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-03-08 07:44:25,833 INFO L435 NwaCegarLoop]: 325 mSDtfsCounter, 686 mSDsluCounter, 645 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 686 SdHoareTripleChecker+Valid, 970 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 07:44:25,834 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [686 Valid, 970 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 07:44:25,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2025-03-08 07:44:25,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 493. [2025-03-08 07:44:25,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 493 states, 492 states have (on average 1.4491869918699187) internal successors, (713), 492 states have internal predecessors, (713), 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-03-08 07:44:25,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 713 transitions. [2025-03-08 07:44:25,847 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 713 transitions. Word has length 76 [2025-03-08 07:44:25,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:44:25,847 INFO L471 AbstractCegarLoop]: Abstraction has 493 states and 713 transitions. [2025-03-08 07:44:25,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 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-03-08 07:44:25,847 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 713 transitions. [2025-03-08 07:44:25,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-08 07:44:25,848 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:44:25,848 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] [2025-03-08 07:44:25,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 07:44:25,848 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:44:25,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:44:25,848 INFO L85 PathProgramCache]: Analyzing trace with hash -820651205, now seen corresponding path program 1 times [2025-03-08 07:44:25,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:44:25,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957373996] [2025-03-08 07:44:25,848 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:44:25,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:44:25,873 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-08 07:44:25,888 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-08 07:44:25,889 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:44:25,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:44:26,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:44:26,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:44:26,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957373996] [2025-03-08 07:44:26,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957373996] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:44:26,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:44:26,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 07:44:26,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327526402] [2025-03-08 07:44:26,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:44:26,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 07:44:26,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:44:26,026 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 07:44:26,026 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 07:44:26,026 INFO L87 Difference]: Start difference. First operand 493 states and 713 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 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-03-08 07:44:26,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:44:26,213 INFO L93 Difference]: Finished difference Result 861 states and 1249 transitions. [2025-03-08 07:44:26,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 07:44:26,213 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 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 76 [2025-03-08 07:44:26,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:44:26,215 INFO L225 Difference]: With dead ends: 861 [2025-03-08 07:44:26,215 INFO L226 Difference]: Without dead ends: 520 [2025-03-08 07:44:26,217 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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-03-08 07:44:26,217 INFO L435 NwaCegarLoop]: 325 mSDtfsCounter, 680 mSDsluCounter, 645 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 680 SdHoareTripleChecker+Valid, 970 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 07:44:26,217 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [680 Valid, 970 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 07:44:26,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2025-03-08 07:44:26,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 491. [2025-03-08 07:44:26,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 491 states, 490 states have (on average 1.4448979591836735) internal successors, (708), 490 states have internal predecessors, (708), 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-03-08 07:44:26,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 708 transitions. [2025-03-08 07:44:26,227 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 708 transitions. Word has length 76 [2025-03-08 07:44:26,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:44:26,227 INFO L471 AbstractCegarLoop]: Abstraction has 491 states and 708 transitions. [2025-03-08 07:44:26,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 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-03-08 07:44:26,227 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 708 transitions. [2025-03-08 07:44:26,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-08 07:44:26,228 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:44:26,228 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] [2025-03-08 07:44:26,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 07:44:26,228 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:44:26,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:44:26,228 INFO L85 PathProgramCache]: Analyzing trace with hash -486637499, now seen corresponding path program 1 times [2025-03-08 07:44:26,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:44:26,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143801930] [2025-03-08 07:44:26,229 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:44:26,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:44:26,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-08 07:44:26,274 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-08 07:44:26,275 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:44:26,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:44:26,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:44:26,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:44:26,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143801930] [2025-03-08 07:44:26,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143801930] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:44:26,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:44:26,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 07:44:26,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911671884] [2025-03-08 07:44:26,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:44:26,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 07:44:26,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:44:26,424 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 07:44:26,424 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 07:44:26,424 INFO L87 Difference]: Start difference. First operand 491 states and 708 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 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-03-08 07:44:26,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:44:26,588 INFO L93 Difference]: Finished difference Result 863 states and 1248 transitions. [2025-03-08 07:44:26,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 07:44:26,588 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 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 76 [2025-03-08 07:44:26,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:44:26,590 INFO L225 Difference]: With dead ends: 863 [2025-03-08 07:44:26,590 INFO L226 Difference]: Without dead ends: 518 [2025-03-08 07:44:26,590 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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-03-08 07:44:26,591 INFO L435 NwaCegarLoop]: 325 mSDtfsCounter, 676 mSDsluCounter, 645 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 676 SdHoareTripleChecker+Valid, 970 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 07:44:26,591 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [676 Valid, 970 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 07:44:26,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2025-03-08 07:44:26,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 489. [2025-03-08 07:44:26,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 489 states, 488 states have (on average 1.4405737704918034) internal successors, (703), 488 states have internal predecessors, (703), 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-03-08 07:44:26,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 703 transitions. [2025-03-08 07:44:26,617 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 703 transitions. Word has length 76 [2025-03-08 07:44:26,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:44:26,617 INFO L471 AbstractCegarLoop]: Abstraction has 489 states and 703 transitions. [2025-03-08 07:44:26,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 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-03-08 07:44:26,618 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 703 transitions. [2025-03-08 07:44:26,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-08 07:44:26,618 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:44:26,618 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] [2025-03-08 07:44:26,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 07:44:26,618 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:44:26,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:44:26,619 INFO L85 PathProgramCache]: Analyzing trace with hash -661024689, now seen corresponding path program 1 times [2025-03-08 07:44:26,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:44:26,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235775034] [2025-03-08 07:44:26,620 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:44:26,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:44:26,652 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-08 07:44:26,669 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-08 07:44:26,669 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:44:26,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:44:26,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:44:26,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:44:26,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235775034] [2025-03-08 07:44:26,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235775034] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:44:26,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:44:26,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 07:44:26,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689749381] [2025-03-08 07:44:26,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:44:26,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 07:44:26,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:44:26,812 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 07:44:26,812 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 07:44:26,812 INFO L87 Difference]: Start difference. First operand 489 states and 703 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 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-03-08 07:44:26,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:44:26,983 INFO L93 Difference]: Finished difference Result 865 states and 1247 transitions. [2025-03-08 07:44:26,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 07:44:26,984 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 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 76 [2025-03-08 07:44:26,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:44:26,985 INFO L225 Difference]: With dead ends: 865 [2025-03-08 07:44:26,985 INFO L226 Difference]: Without dead ends: 516 [2025-03-08 07:44:26,986 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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-03-08 07:44:26,986 INFO L435 NwaCegarLoop]: 325 mSDtfsCounter, 672 mSDsluCounter, 645 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 672 SdHoareTripleChecker+Valid, 970 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 07:44:26,986 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [672 Valid, 970 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 07:44:26,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2025-03-08 07:44:26,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 487. [2025-03-08 07:44:26,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 487 states, 486 states have (on average 1.4362139917695473) internal successors, (698), 486 states have internal predecessors, (698), 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-03-08 07:44:26,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 698 transitions. [2025-03-08 07:44:26,993 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 698 transitions. Word has length 76 [2025-03-08 07:44:26,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:44:26,994 INFO L471 AbstractCegarLoop]: Abstraction has 487 states and 698 transitions. [2025-03-08 07:44:26,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 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-03-08 07:44:26,994 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 698 transitions. [2025-03-08 07:44:26,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-08 07:44:26,994 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:44:26,994 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] [2025-03-08 07:44:26,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 07:44:26,995 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:44:26,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:44:26,995 INFO L85 PathProgramCache]: Analyzing trace with hash 1790544729, now seen corresponding path program 1 times [2025-03-08 07:44:26,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:44:26,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128952996] [2025-03-08 07:44:26,995 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:44:26,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:44:27,022 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-08 07:44:27,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-08 07:44:27,047 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:44:27,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:44:27,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:44:27,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:44:27,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128952996] [2025-03-08 07:44:27,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128952996] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:44:27,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:44:27,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 07:44:27,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244179257] [2025-03-08 07:44:27,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:44:27,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 07:44:27,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:44:27,204 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 07:44:27,204 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 07:44:27,204 INFO L87 Difference]: Start difference. First operand 487 states and 698 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 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-03-08 07:44:27,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:44:27,376 INFO L93 Difference]: Finished difference Result 867 states and 1246 transitions. [2025-03-08 07:44:27,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 07:44:27,377 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 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 76 [2025-03-08 07:44:27,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:44:27,378 INFO L225 Difference]: With dead ends: 867 [2025-03-08 07:44:27,378 INFO L226 Difference]: Without dead ends: 514 [2025-03-08 07:44:27,378 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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-03-08 07:44:27,379 INFO L435 NwaCegarLoop]: 325 mSDtfsCounter, 668 mSDsluCounter, 645 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 668 SdHoareTripleChecker+Valid, 970 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 07:44:27,379 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [668 Valid, 970 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 07:44:27,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2025-03-08 07:44:27,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 485. [2025-03-08 07:44:27,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 485 states, 484 states have (on average 1.4318181818181819) internal successors, (693), 484 states have internal predecessors, (693), 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-03-08 07:44:27,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 693 transitions. [2025-03-08 07:44:27,389 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 693 transitions. Word has length 76 [2025-03-08 07:44:27,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:44:27,390 INFO L471 AbstractCegarLoop]: Abstraction has 485 states and 693 transitions. [2025-03-08 07:44:27,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 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-03-08 07:44:27,390 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 693 transitions. [2025-03-08 07:44:27,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-08 07:44:27,390 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:44:27,390 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] [2025-03-08 07:44:27,391 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 07:44:27,391 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:44:27,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:44:27,391 INFO L85 PathProgramCache]: Analyzing trace with hash 220047614, now seen corresponding path program 1 times [2025-03-08 07:44:27,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:44:27,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002661190] [2025-03-08 07:44:27,391 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:44:27,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:44:27,423 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-08 07:44:27,437 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-08 07:44:27,438 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:44:27,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:44:27,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:44:27,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:44:27,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002661190] [2025-03-08 07:44:27,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002661190] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:44:27,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:44:27,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 07:44:27,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684095096] [2025-03-08 07:44:27,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:44:27,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 07:44:27,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:44:27,589 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 07:44:27,589 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 07:44:27,589 INFO L87 Difference]: Start difference. First operand 485 states and 693 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 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-03-08 07:44:27,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:44:27,779 INFO L93 Difference]: Finished difference Result 867 states and 1243 transitions. [2025-03-08 07:44:27,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 07:44:27,779 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 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 76 [2025-03-08 07:44:27,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:44:27,781 INFO L225 Difference]: With dead ends: 867 [2025-03-08 07:44:27,781 INFO L226 Difference]: Without dead ends: 512 [2025-03-08 07:44:27,781 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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-03-08 07:44:27,781 INFO L435 NwaCegarLoop]: 325 mSDtfsCounter, 662 mSDsluCounter, 645 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 662 SdHoareTripleChecker+Valid, 970 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 07:44:27,781 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [662 Valid, 970 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 07:44:27,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2025-03-08 07:44:27,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 483. [2025-03-08 07:44:27,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 483 states, 482 states have (on average 1.4273858921161826) internal successors, (688), 482 states have internal predecessors, (688), 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-03-08 07:44:27,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 483 states and 688 transitions. [2025-03-08 07:44:27,788 INFO L78 Accepts]: Start accepts. Automaton has 483 states and 688 transitions. Word has length 76 [2025-03-08 07:44:27,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:44:27,788 INFO L471 AbstractCegarLoop]: Abstraction has 483 states and 688 transitions. [2025-03-08 07:44:27,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 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-03-08 07:44:27,788 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 688 transitions. [2025-03-08 07:44:27,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-08 07:44:27,789 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:44:27,789 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] [2025-03-08 07:44:27,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 07:44:27,789 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:44:27,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:44:27,790 INFO L85 PathProgramCache]: Analyzing trace with hash -1494159005, now seen corresponding path program 1 times [2025-03-08 07:44:27,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:44:27,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910438478] [2025-03-08 07:44:27,790 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:44:27,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:44:27,816 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-08 07:44:27,830 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-08 07:44:27,831 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:44:27,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:44:27,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:44:27,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:44:27,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910438478] [2025-03-08 07:44:27,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910438478] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:44:27,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:44:27,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 07:44:27,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898696426] [2025-03-08 07:44:27,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:44:27,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 07:44:27,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:44:27,956 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 07:44:27,956 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 07:44:27,956 INFO L87 Difference]: Start difference. First operand 483 states and 688 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 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-03-08 07:44:28,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:44:28,118 INFO L93 Difference]: Finished difference Result 867 states and 1240 transitions. [2025-03-08 07:44:28,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 07:44:28,118 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 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 76 [2025-03-08 07:44:28,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:44:28,120 INFO L225 Difference]: With dead ends: 867 [2025-03-08 07:44:28,120 INFO L226 Difference]: Without dead ends: 510 [2025-03-08 07:44:28,120 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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-03-08 07:44:28,121 INFO L435 NwaCegarLoop]: 325 mSDtfsCounter, 656 mSDsluCounter, 645 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 656 SdHoareTripleChecker+Valid, 970 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 07:44:28,121 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [656 Valid, 970 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 07:44:28,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2025-03-08 07:44:28,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 481. [2025-03-08 07:44:28,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 481 states, 480 states have (on average 1.4229166666666666) internal successors, (683), 480 states have internal predecessors, (683), 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-03-08 07:44:28,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 683 transitions. [2025-03-08 07:44:28,129 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 683 transitions. Word has length 76 [2025-03-08 07:44:28,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:44:28,129 INFO L471 AbstractCegarLoop]: Abstraction has 481 states and 683 transitions. [2025-03-08 07:44:28,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 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-03-08 07:44:28,129 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 683 transitions. [2025-03-08 07:44:28,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-08 07:44:28,129 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:44:28,129 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] [2025-03-08 07:44:28,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-08 07:44:28,129 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:44:28,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:44:28,130 INFO L85 PathProgramCache]: Analyzing trace with hash 420721800, now seen corresponding path program 1 times [2025-03-08 07:44:28,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:44:28,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015965666] [2025-03-08 07:44:28,130 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:44:28,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:44:28,166 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-08 07:44:28,181 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-08 07:44:28,181 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:44:28,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:44:28,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:44:28,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:44:28,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015965666] [2025-03-08 07:44:28,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015965666] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:44:28,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:44:28,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 07:44:28,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65694648] [2025-03-08 07:44:28,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:44:28,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 07:44:28,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:44:28,314 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 07:44:28,314 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 07:44:28,314 INFO L87 Difference]: Start difference. First operand 481 states and 683 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 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-03-08 07:44:28,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:44:28,496 INFO L93 Difference]: Finished difference Result 867 states and 1237 transitions. [2025-03-08 07:44:28,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 07:44:28,496 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 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 76 [2025-03-08 07:44:28,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:44:28,497 INFO L225 Difference]: With dead ends: 867 [2025-03-08 07:44:28,497 INFO L226 Difference]: Without dead ends: 508 [2025-03-08 07:44:28,498 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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-03-08 07:44:28,498 INFO L435 NwaCegarLoop]: 325 mSDtfsCounter, 650 mSDsluCounter, 645 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 650 SdHoareTripleChecker+Valid, 970 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 07:44:28,498 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [650 Valid, 970 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 07:44:28,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2025-03-08 07:44:28,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 479. [2025-03-08 07:44:28,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 479 states, 478 states have (on average 1.4184100418410042) internal successors, (678), 478 states have internal predecessors, (678), 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-03-08 07:44:28,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 678 transitions. [2025-03-08 07:44:28,505 INFO L78 Accepts]: Start accepts. Automaton has 479 states and 678 transitions. Word has length 76 [2025-03-08 07:44:28,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:44:28,505 INFO L471 AbstractCegarLoop]: Abstraction has 479 states and 678 transitions. [2025-03-08 07:44:28,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 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-03-08 07:44:28,506 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 678 transitions. [2025-03-08 07:44:28,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-08 07:44:28,506 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:44:28,506 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] [2025-03-08 07:44:28,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-08 07:44:28,506 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:44:28,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:44:28,507 INFO L85 PathProgramCache]: Analyzing trace with hash -593171694, now seen corresponding path program 1 times [2025-03-08 07:44:28,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:44:28,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485468048] [2025-03-08 07:44:28,507 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:44:28,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:44:28,532 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-08 07:44:28,547 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-08 07:44:28,547 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:44:28,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:44:28,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:44:28,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:44:28,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485468048] [2025-03-08 07:44:28,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485468048] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:44:28,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:44:28,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 07:44:28,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62024423] [2025-03-08 07:44:28,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:44:28,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 07:44:28,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:44:28,693 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 07:44:28,693 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 07:44:28,694 INFO L87 Difference]: Start difference. First operand 479 states and 678 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 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-03-08 07:44:28,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:44:28,860 INFO L93 Difference]: Finished difference Result 869 states and 1236 transitions. [2025-03-08 07:44:28,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 07:44:28,860 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 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 76 [2025-03-08 07:44:28,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:44:28,862 INFO L225 Difference]: With dead ends: 869 [2025-03-08 07:44:28,862 INFO L226 Difference]: Without dead ends: 506 [2025-03-08 07:44:28,862 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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-03-08 07:44:28,864 INFO L435 NwaCegarLoop]: 325 mSDtfsCounter, 646 mSDsluCounter, 645 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 646 SdHoareTripleChecker+Valid, 970 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 07:44:28,865 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [646 Valid, 970 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 07:44:28,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2025-03-08 07:44:28,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 477. [2025-03-08 07:44:28,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 477 states, 476 states have (on average 1.4138655462184875) internal successors, (673), 476 states have internal predecessors, (673), 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-03-08 07:44:28,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 673 transitions. [2025-03-08 07:44:28,871 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 673 transitions. Word has length 76 [2025-03-08 07:44:28,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:44:28,871 INFO L471 AbstractCegarLoop]: Abstraction has 477 states and 673 transitions. [2025-03-08 07:44:28,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 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-03-08 07:44:28,871 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 673 transitions. [2025-03-08 07:44:28,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-08 07:44:28,872 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:44:28,872 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] [2025-03-08 07:44:28,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-08 07:44:28,872 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:44:28,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:44:28,873 INFO L85 PathProgramCache]: Analyzing trace with hash 1883491484, now seen corresponding path program 1 times [2025-03-08 07:44:28,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:44:28,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267850118] [2025-03-08 07:44:28,874 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:44:28,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:44:28,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-08 07:44:28,919 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-08 07:44:28,919 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:44:28,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:44:29,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:44:29,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:44:29,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267850118] [2025-03-08 07:44:29,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267850118] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:44:29,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:44:29,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 07:44:29,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874405796] [2025-03-08 07:44:29,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:44:29,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 07:44:29,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:44:29,049 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 07:44:29,049 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 07:44:29,049 INFO L87 Difference]: Start difference. First operand 477 states and 673 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 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-03-08 07:44:29,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:44:29,209 INFO L93 Difference]: Finished difference Result 871 states and 1235 transitions. [2025-03-08 07:44:29,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 07:44:29,213 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 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 76 [2025-03-08 07:44:29,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:44:29,214 INFO L225 Difference]: With dead ends: 871 [2025-03-08 07:44:29,214 INFO L226 Difference]: Without dead ends: 504 [2025-03-08 07:44:29,215 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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-03-08 07:44:29,215 INFO L435 NwaCegarLoop]: 325 mSDtfsCounter, 642 mSDsluCounter, 645 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 642 SdHoareTripleChecker+Valid, 970 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 07:44:29,215 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [642 Valid, 970 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 07:44:29,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2025-03-08 07:44:29,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 475. [2025-03-08 07:44:29,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 475 states, 474 states have (on average 1.409282700421941) internal successors, (668), 474 states have internal predecessors, (668), 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-03-08 07:44:29,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475 states to 475 states and 668 transitions. [2025-03-08 07:44:29,222 INFO L78 Accepts]: Start accepts. Automaton has 475 states and 668 transitions. Word has length 76 [2025-03-08 07:44:29,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:44:29,222 INFO L471 AbstractCegarLoop]: Abstraction has 475 states and 668 transitions. [2025-03-08 07:44:29,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 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-03-08 07:44:29,223 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 668 transitions. [2025-03-08 07:44:29,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-08 07:44:29,223 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:44:29,223 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] [2025-03-08 07:44:29,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-08 07:44:29,223 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:44:29,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:44:29,232 INFO L85 PathProgramCache]: Analyzing trace with hash -652434047, now seen corresponding path program 1 times [2025-03-08 07:44:29,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:44:29,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927704103] [2025-03-08 07:44:29,232 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:44:29,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:44:29,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-08 07:44:29,274 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-08 07:44:29,275 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:44:29,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:44:29,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:44:29,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:44:29,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927704103] [2025-03-08 07:44:29,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927704103] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:44:29,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:44:29,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 07:44:29,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443667225] [2025-03-08 07:44:29,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:44:29,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 07:44:29,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:44:29,427 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 07:44:29,427 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 07:44:29,427 INFO L87 Difference]: Start difference. First operand 475 states and 668 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 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-03-08 07:44:29,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:44:29,589 INFO L93 Difference]: Finished difference Result 871 states and 1232 transitions. [2025-03-08 07:44:29,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 07:44:29,589 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 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 76 [2025-03-08 07:44:29,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:44:29,590 INFO L225 Difference]: With dead ends: 871 [2025-03-08 07:44:29,590 INFO L226 Difference]: Without dead ends: 502 [2025-03-08 07:44:29,591 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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-03-08 07:44:29,591 INFO L435 NwaCegarLoop]: 325 mSDtfsCounter, 636 mSDsluCounter, 645 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 636 SdHoareTripleChecker+Valid, 970 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 07:44:29,591 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [636 Valid, 970 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 07:44:29,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2025-03-08 07:44:29,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 473. [2025-03-08 07:44:29,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 473 states, 472 states have (on average 1.4046610169491525) internal successors, (663), 472 states have internal predecessors, (663), 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-03-08 07:44:29,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 663 transitions. [2025-03-08 07:44:29,598 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 663 transitions. Word has length 76 [2025-03-08 07:44:29,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:44:29,598 INFO L471 AbstractCegarLoop]: Abstraction has 473 states and 663 transitions. [2025-03-08 07:44:29,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 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-03-08 07:44:29,598 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 663 transitions. [2025-03-08 07:44:29,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-08 07:44:29,599 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:44:29,599 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] [2025-03-08 07:44:29,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-08 07:44:29,599 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:44:29,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:44:29,600 INFO L85 PathProgramCache]: Analyzing trace with hash 1864554790, now seen corresponding path program 1 times [2025-03-08 07:44:29,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:44:29,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346338114] [2025-03-08 07:44:29,600 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:44:29,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:44:29,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-08 07:44:29,643 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-08 07:44:29,643 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:44:29,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:44:29,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:44:29,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:44:29,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346338114] [2025-03-08 07:44:29,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346338114] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:44:29,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:44:29,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 07:44:29,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340238105] [2025-03-08 07:44:29,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:44:29,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 07:44:29,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:44:29,778 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 07:44:29,778 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 07:44:29,779 INFO L87 Difference]: Start difference. First operand 473 states and 663 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 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-03-08 07:44:29,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:44:29,948 INFO L93 Difference]: Finished difference Result 871 states and 1229 transitions. [2025-03-08 07:44:29,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 07:44:29,948 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 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 76 [2025-03-08 07:44:29,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:44:29,949 INFO L225 Difference]: With dead ends: 871 [2025-03-08 07:44:29,949 INFO L226 Difference]: Without dead ends: 500 [2025-03-08 07:44:29,950 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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-03-08 07:44:29,950 INFO L435 NwaCegarLoop]: 325 mSDtfsCounter, 630 mSDsluCounter, 645 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 630 SdHoareTripleChecker+Valid, 970 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 07:44:29,950 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [630 Valid, 970 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 07:44:29,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2025-03-08 07:44:29,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 471. [2025-03-08 07:44:29,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 471 states, 470 states have (on average 1.4) internal successors, (658), 470 states have internal predecessors, (658), 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-03-08 07:44:29,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 658 transitions. [2025-03-08 07:44:29,957 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 658 transitions. Word has length 76 [2025-03-08 07:44:29,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:44:29,957 INFO L471 AbstractCegarLoop]: Abstraction has 471 states and 658 transitions. [2025-03-08 07:44:29,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 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-03-08 07:44:29,958 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 658 transitions. [2025-03-08 07:44:29,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-08 07:44:29,958 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:44:29,958 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] [2025-03-08 07:44:29,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-08 07:44:29,958 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:44:29,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:44:29,959 INFO L85 PathProgramCache]: Analyzing trace with hash -1670727797, now seen corresponding path program 1 times [2025-03-08 07:44:29,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:44:29,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982841466] [2025-03-08 07:44:29,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:44:29,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:44:29,985 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-08 07:44:30,000 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-08 07:44:30,000 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:44:30,000 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:44:30,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:44:30,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:44:30,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982841466] [2025-03-08 07:44:30,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982841466] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:44:30,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:44:30,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 07:44:30,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17494007] [2025-03-08 07:44:30,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:44:30,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 07:44:30,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:44:30,136 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 07:44:30,136 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 07:44:30,136 INFO L87 Difference]: Start difference. First operand 471 states and 658 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 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-03-08 07:44:30,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:44:30,304 INFO L93 Difference]: Finished difference Result 871 states and 1226 transitions. [2025-03-08 07:44:30,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 07:44:30,305 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 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 76 [2025-03-08 07:44:30,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:44:30,306 INFO L225 Difference]: With dead ends: 871 [2025-03-08 07:44:30,306 INFO L226 Difference]: Without dead ends: 498 [2025-03-08 07:44:30,306 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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-03-08 07:44:30,307 INFO L435 NwaCegarLoop]: 325 mSDtfsCounter, 624 mSDsluCounter, 645 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 624 SdHoareTripleChecker+Valid, 970 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 07:44:30,307 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [624 Valid, 970 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 07:44:30,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2025-03-08 07:44:30,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 469. [2025-03-08 07:44:30,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 469 states, 468 states have (on average 1.3952991452991452) internal successors, (653), 468 states have internal predecessors, (653), 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-03-08 07:44:30,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 653 transitions. [2025-03-08 07:44:30,312 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 653 transitions. Word has length 76 [2025-03-08 07:44:30,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:44:30,313 INFO L471 AbstractCegarLoop]: Abstraction has 469 states and 653 transitions. [2025-03-08 07:44:30,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 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-03-08 07:44:30,313 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 653 transitions. [2025-03-08 07:44:30,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-08 07:44:30,313 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:44:30,313 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] [2025-03-08 07:44:30,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-08 07:44:30,314 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:44:30,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:44:30,315 INFO L85 PathProgramCache]: Analyzing trace with hash 116176021, now seen corresponding path program 1 times [2025-03-08 07:44:30,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:44:30,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620379485] [2025-03-08 07:44:30,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:44:30,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:44:30,343 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-08 07:44:30,358 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-08 07:44:30,358 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:44:30,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:44:30,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:44:30,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:44:30,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620379485] [2025-03-08 07:44:30,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620379485] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:44:30,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:44:30,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 07:44:30,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768251669] [2025-03-08 07:44:30,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:44:30,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 07:44:30,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:44:30,524 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 07:44:30,524 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 07:44:30,524 INFO L87 Difference]: Start difference. First operand 469 states and 653 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 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-03-08 07:44:30,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:44:30,686 INFO L93 Difference]: Finished difference Result 873 states and 1225 transitions. [2025-03-08 07:44:30,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 07:44:30,687 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 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 76 [2025-03-08 07:44:30,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:44:30,688 INFO L225 Difference]: With dead ends: 873 [2025-03-08 07:44:30,688 INFO L226 Difference]: Without dead ends: 496 [2025-03-08 07:44:30,688 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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-03-08 07:44:30,689 INFO L435 NwaCegarLoop]: 325 mSDtfsCounter, 620 mSDsluCounter, 645 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 620 SdHoareTripleChecker+Valid, 970 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 07:44:30,689 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [620 Valid, 970 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 07:44:30,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2025-03-08 07:44:30,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 467. [2025-03-08 07:44:30,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 467 states, 466 states have (on average 1.390557939914163) internal successors, (648), 466 states have internal predecessors, (648), 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-03-08 07:44:30,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 648 transitions. [2025-03-08 07:44:30,695 INFO L78 Accepts]: Start accepts. Automaton has 467 states and 648 transitions. Word has length 76 [2025-03-08 07:44:30,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:44:30,695 INFO L471 AbstractCegarLoop]: Abstraction has 467 states and 648 transitions. [2025-03-08 07:44:30,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 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-03-08 07:44:30,695 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 648 transitions. [2025-03-08 07:44:30,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-08 07:44:30,696 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:44:30,696 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] [2025-03-08 07:44:30,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-08 07:44:30,696 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:44:30,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:44:30,696 INFO L85 PathProgramCache]: Analyzing trace with hash 917839007, now seen corresponding path program 1 times [2025-03-08 07:44:30,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:44:30,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797944198] [2025-03-08 07:44:30,697 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:44:30,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:44:30,723 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-08 07:44:30,739 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-08 07:44:30,740 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:44:30,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:44:30,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:44:30,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:44:30,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797944198] [2025-03-08 07:44:30,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797944198] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:44:30,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:44:30,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 07:44:30,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456494418] [2025-03-08 07:44:30,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:44:30,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 07:44:30,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:44:30,878 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 07:44:30,878 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 07:44:30,878 INFO L87 Difference]: Start difference. First operand 467 states and 648 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 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-03-08 07:44:31,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:44:31,032 INFO L93 Difference]: Finished difference Result 875 states and 1224 transitions. [2025-03-08 07:44:31,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 07:44:31,032 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 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 76 [2025-03-08 07:44:31,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:44:31,033 INFO L225 Difference]: With dead ends: 875 [2025-03-08 07:44:31,033 INFO L226 Difference]: Without dead ends: 494 [2025-03-08 07:44:31,034 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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-03-08 07:44:31,034 INFO L435 NwaCegarLoop]: 325 mSDtfsCounter, 616 mSDsluCounter, 645 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 616 SdHoareTripleChecker+Valid, 970 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 07:44:31,034 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [616 Valid, 970 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 07:44:31,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2025-03-08 07:44:31,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 465. [2025-03-08 07:44:31,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 465 states, 464 states have (on average 1.3857758620689655) internal successors, (643), 464 states have internal predecessors, (643), 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-03-08 07:44:31,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 643 transitions. [2025-03-08 07:44:31,040 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 643 transitions. Word has length 76 [2025-03-08 07:44:31,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:44:31,040 INFO L471 AbstractCegarLoop]: Abstraction has 465 states and 643 transitions. [2025-03-08 07:44:31,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 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-03-08 07:44:31,040 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 643 transitions. [2025-03-08 07:44:31,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-08 07:44:31,041 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:44:31,041 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] [2025-03-08 07:44:31,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-08 07:44:31,041 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:44:31,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:44:31,041 INFO L85 PathProgramCache]: Analyzing trace with hash -57249879, now seen corresponding path program 1 times [2025-03-08 07:44:31,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:44:31,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851725522] [2025-03-08 07:44:31,041 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:44:31,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:44:31,068 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-08 07:44:31,083 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-08 07:44:31,083 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:44:31,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:44:31,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:44:31,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:44:31,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851725522] [2025-03-08 07:44:31,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851725522] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:44:31,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:44:31,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 07:44:31,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125513242] [2025-03-08 07:44:31,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:44:31,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 07:44:31,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:44:31,208 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 07:44:31,208 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 07:44:31,208 INFO L87 Difference]: Start difference. First operand 465 states and 643 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 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-03-08 07:44:31,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:44:31,360 INFO L93 Difference]: Finished difference Result 877 states and 1223 transitions. [2025-03-08 07:44:31,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 07:44:31,360 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 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 76 [2025-03-08 07:44:31,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:44:31,361 INFO L225 Difference]: With dead ends: 877 [2025-03-08 07:44:31,361 INFO L226 Difference]: Without dead ends: 492 [2025-03-08 07:44:31,362 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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-03-08 07:44:31,362 INFO L435 NwaCegarLoop]: 325 mSDtfsCounter, 612 mSDsluCounter, 645 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 612 SdHoareTripleChecker+Valid, 970 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 07:44:31,362 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [612 Valid, 970 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 07:44:31,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2025-03-08 07:44:31,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 463. [2025-03-08 07:44:31,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 463 states, 462 states have (on average 1.380952380952381) internal successors, (638), 462 states have internal predecessors, (638), 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-03-08 07:44:31,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 638 transitions. [2025-03-08 07:44:31,367 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 638 transitions. Word has length 76 [2025-03-08 07:44:31,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:44:31,367 INFO L471 AbstractCegarLoop]: Abstraction has 463 states and 638 transitions. [2025-03-08 07:44:31,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 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-03-08 07:44:31,368 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 638 transitions. [2025-03-08 07:44:31,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-08 07:44:31,368 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:44:31,368 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] [2025-03-08 07:44:31,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-08 07:44:31,368 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:44:31,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:44:31,368 INFO L85 PathProgramCache]: Analyzing trace with hash -1689077426, now seen corresponding path program 1 times [2025-03-08 07:44:31,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:44:31,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229995053] [2025-03-08 07:44:31,368 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:44:31,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:44:31,394 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-08 07:44:31,408 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-08 07:44:31,409 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:44:31,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:44:31,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:44:31,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:44:31,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229995053] [2025-03-08 07:44:31,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229995053] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:44:31,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:44:31,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 07:44:31,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991691109] [2025-03-08 07:44:31,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:44:31,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 07:44:31,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:44:31,539 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 07:44:31,539 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 07:44:31,540 INFO L87 Difference]: Start difference. First operand 463 states and 638 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 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-03-08 07:44:31,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:44:31,695 INFO L93 Difference]: Finished difference Result 877 states and 1220 transitions. [2025-03-08 07:44:31,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 07:44:31,696 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 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 76 [2025-03-08 07:44:31,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:44:31,697 INFO L225 Difference]: With dead ends: 877 [2025-03-08 07:44:31,697 INFO L226 Difference]: Without dead ends: 490 [2025-03-08 07:44:31,697 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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-03-08 07:44:31,697 INFO L435 NwaCegarLoop]: 325 mSDtfsCounter, 606 mSDsluCounter, 645 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 606 SdHoareTripleChecker+Valid, 970 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 07:44:31,698 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [606 Valid, 970 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 07:44:31,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2025-03-08 07:44:31,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 461. [2025-03-08 07:44:31,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 461 states, 460 states have (on average 1.376086956521739) internal successors, (633), 460 states have internal predecessors, (633), 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-03-08 07:44:31,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 633 transitions. [2025-03-08 07:44:31,703 INFO L78 Accepts]: Start accepts. Automaton has 461 states and 633 transitions. Word has length 76 [2025-03-08 07:44:31,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:44:31,703 INFO L471 AbstractCegarLoop]: Abstraction has 461 states and 633 transitions. [2025-03-08 07:44:31,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 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-03-08 07:44:31,703 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 633 transitions. [2025-03-08 07:44:31,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-08 07:44:31,704 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:44:31,704 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] [2025-03-08 07:44:31,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-08 07:44:31,704 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:44:31,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:44:31,704 INFO L85 PathProgramCache]: Analyzing trace with hash 2082680243, now seen corresponding path program 1 times [2025-03-08 07:44:31,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:44:31,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059791554] [2025-03-08 07:44:31,704 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:44:31,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:44:31,735 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-08 07:44:31,749 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-08 07:44:31,750 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:44:31,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:44:31,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:44:31,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:44:31,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059791554] [2025-03-08 07:44:31,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059791554] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:44:31,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:44:31,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 07:44:31,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552077154] [2025-03-08 07:44:31,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:44:31,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 07:44:31,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:44:31,870 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 07:44:31,870 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 07:44:31,870 INFO L87 Difference]: Start difference. First operand 461 states and 633 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 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-03-08 07:44:32,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:44:32,030 INFO L93 Difference]: Finished difference Result 877 states and 1217 transitions. [2025-03-08 07:44:32,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 07:44:32,030 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 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 76 [2025-03-08 07:44:32,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:44:32,031 INFO L225 Difference]: With dead ends: 877 [2025-03-08 07:44:32,031 INFO L226 Difference]: Without dead ends: 488 [2025-03-08 07:44:32,032 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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-03-08 07:44:32,032 INFO L435 NwaCegarLoop]: 325 mSDtfsCounter, 600 mSDsluCounter, 645 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 600 SdHoareTripleChecker+Valid, 970 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 07:44:32,032 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [600 Valid, 970 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 07:44:32,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2025-03-08 07:44:32,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 459. [2025-03-08 07:44:32,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 459 states, 458 states have (on average 1.3711790393013101) internal successors, (628), 458 states have internal predecessors, (628), 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-03-08 07:44:32,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 628 transitions. [2025-03-08 07:44:32,038 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 628 transitions. Word has length 76 [2025-03-08 07:44:32,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:44:32,038 INFO L471 AbstractCegarLoop]: Abstraction has 459 states and 628 transitions. [2025-03-08 07:44:32,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 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-03-08 07:44:32,038 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 628 transitions. [2025-03-08 07:44:32,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-08 07:44:32,038 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:44:32,038 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] [2025-03-08 07:44:32,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-08 07:44:32,038 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:44:32,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:44:32,039 INFO L85 PathProgramCache]: Analyzing trace with hash 1789402328, now seen corresponding path program 1 times [2025-03-08 07:44:32,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:44:32,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330615165] [2025-03-08 07:44:32,039 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:44:32,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:44:32,065 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-08 07:44:32,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-08 07:44:32,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:44:32,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:44:32,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:44:32,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:44:32,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330615165] [2025-03-08 07:44:32,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330615165] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:44:32,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:44:32,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 07:44:32,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660008110] [2025-03-08 07:44:32,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:44:32,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 07:44:32,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:44:32,203 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 07:44:32,203 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 07:44:32,203 INFO L87 Difference]: Start difference. First operand 459 states and 628 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 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-03-08 07:44:32,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:44:32,355 INFO L93 Difference]: Finished difference Result 809 states and 1141 transitions. [2025-03-08 07:44:32,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 07:44:32,359 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 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 76 [2025-03-08 07:44:32,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:44:32,360 INFO L225 Difference]: With dead ends: 809 [2025-03-08 07:44:32,360 INFO L226 Difference]: Without dead ends: 418 [2025-03-08 07:44:32,360 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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-03-08 07:44:32,360 INFO L435 NwaCegarLoop]: 325 mSDtfsCounter, 568 mSDsluCounter, 645 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 568 SdHoareTripleChecker+Valid, 970 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 07:44:32,361 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [568 Valid, 970 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 07:44:32,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2025-03-08 07:44:32,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 405. [2025-03-08 07:44:32,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 405 states, 404 states have (on average 1.4158415841584158) internal successors, (572), 404 states have internal predecessors, (572), 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-03-08 07:44:32,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 572 transitions. [2025-03-08 07:44:32,368 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 572 transitions. Word has length 76 [2025-03-08 07:44:32,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:44:32,368 INFO L471 AbstractCegarLoop]: Abstraction has 405 states and 572 transitions. [2025-03-08 07:44:32,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 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-03-08 07:44:32,368 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 572 transitions. [2025-03-08 07:44:32,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2025-03-08 07:44:32,369 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:44:32,369 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:44:32,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-08 07:44:32,369 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:44:32,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:44:32,370 INFO L85 PathProgramCache]: Analyzing trace with hash -502106364, now seen corresponding path program 1 times [2025-03-08 07:44:32,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:44:32,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226768633] [2025-03-08 07:44:32,370 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:44:32,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:44:32,430 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 215 statements into 1 equivalence classes. [2025-03-08 07:44:33,073 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 215 of 215 statements. [2025-03-08 07:44:33,073 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:44:33,073 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:44:34,206 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 6 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:44:34,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:44:34,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226768633] [2025-03-08 07:44:34,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226768633] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 07:44:34,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [919910462] [2025-03-08 07:44:34,207 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:44:34,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 07:44:34,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 07:44:34,209 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 07:44:34,209 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 07:44:34,680 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 215 statements into 1 equivalence classes. [2025-03-08 07:44:34,895 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 215 of 215 statements. [2025-03-08 07:44:34,895 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:44:34,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:44:34,907 INFO L256 TraceCheckSpWp]: Trace formula consists of 2385 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-08 07:44:34,916 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 07:44:35,103 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-08 07:44:35,104 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 07:44:35,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [919910462] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:44:35,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 07:44:35,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2025-03-08 07:44:35,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317521028] [2025-03-08 07:44:35,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:44:35,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 07:44:35,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:44:35,105 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 07:44:35,105 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-03-08 07:44:35,105 INFO L87 Difference]: Start difference. First operand 405 states and 572 transitions. Second operand has 5 states, 5 states have (on average 41.0) internal successors, (205), 5 states have internal predecessors, (205), 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-03-08 07:44:35,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:44:35,595 INFO L93 Difference]: Finished difference Result 857 states and 1236 transitions. [2025-03-08 07:44:35,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 07:44:35,596 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 41.0) internal successors, (205), 5 states have internal predecessors, (205), 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 215 [2025-03-08 07:44:35,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:44:35,597 INFO L225 Difference]: With dead ends: 857 [2025-03-08 07:44:35,597 INFO L226 Difference]: Without dead ends: 520 [2025-03-08 07:44:35,598 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 214 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2025-03-08 07:44:35,598 INFO L435 NwaCegarLoop]: 373 mSDtfsCounter, 121 mSDsluCounter, 803 mSDsCounter, 0 mSdLazyCounter, 994 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 1176 SdHoareTripleChecker+Invalid, 995 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 994 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 07:44:35,598 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 1176 Invalid, 995 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 994 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 07:44:35,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2025-03-08 07:44:35,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 491. [2025-03-08 07:44:35,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 491 states, 490 states have (on average 1.4285714285714286) internal successors, (700), 490 states have internal predecessors, (700), 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-03-08 07:44:35,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 700 transitions. [2025-03-08 07:44:35,605 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 700 transitions. Word has length 215 [2025-03-08 07:44:35,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:44:35,605 INFO L471 AbstractCegarLoop]: Abstraction has 491 states and 700 transitions. [2025-03-08 07:44:35,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 41.0) internal successors, (205), 5 states have internal predecessors, (205), 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-03-08 07:44:35,605 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 700 transitions. [2025-03-08 07:44:35,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2025-03-08 07:44:35,606 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:44:35,606 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:44:35,620 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 07:44:35,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2025-03-08 07:44:35,806 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:44:35,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:44:35,807 INFO L85 PathProgramCache]: Analyzing trace with hash -2101089926, now seen corresponding path program 1 times [2025-03-08 07:44:35,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:44:35,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074201582] [2025-03-08 07:44:35,807 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:44:35,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:44:35,876 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 215 statements into 1 equivalence classes. [2025-03-08 07:44:36,086 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 215 of 215 statements. [2025-03-08 07:44:36,086 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:44:36,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:44:37,831 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 48 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:44:37,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:44:37,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074201582] [2025-03-08 07:44:37,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074201582] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 07:44:37,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [811464245] [2025-03-08 07:44:37,831 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:44:37,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 07:44:37,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 07:44:37,833 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 07:44:37,834 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 07:44:38,335 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 215 statements into 1 equivalence classes. [2025-03-08 07:44:38,547 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 215 of 215 statements. [2025-03-08 07:44:38,548 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:44:38,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:44:38,559 INFO L256 TraceCheckSpWp]: Trace formula consists of 2385 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-08 07:44:38,567 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 07:44:38,943 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 8 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:44:38,944 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 07:44:39,105 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-08 07:44:39,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [811464245] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-08 07:44:39,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-08 07:44:39,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [12, 6] total 17 [2025-03-08 07:44:39,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066699494] [2025-03-08 07:44:39,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:44:39,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 07:44:39,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:44:39,107 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 07:44:39,107 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2025-03-08 07:44:39,107 INFO L87 Difference]: Start difference. First operand 491 states and 700 transitions. Second operand has 5 states, 5 states have (on average 40.2) internal successors, (201), 5 states have internal predecessors, (201), 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-03-08 07:44:39,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:44:39,459 INFO L93 Difference]: Finished difference Result 1099 states and 1596 transitions. [2025-03-08 07:44:39,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 07:44:39,459 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 40.2) internal successors, (201), 5 states have internal predecessors, (201), 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 215 [2025-03-08 07:44:39,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:44:39,461 INFO L225 Difference]: With dead ends: 1099 [2025-03-08 07:44:39,461 INFO L226 Difference]: Without dead ends: 676 [2025-03-08 07:44:39,461 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 442 GetRequests, 426 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2025-03-08 07:44:39,461 INFO L435 NwaCegarLoop]: 373 mSDtfsCounter, 221 mSDsluCounter, 575 mSDsCounter, 0 mSdLazyCounter, 616 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 948 SdHoareTripleChecker+Invalid, 617 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 616 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 07:44:39,462 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 948 Invalid, 617 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 616 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 07:44:39,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 676 states. [2025-03-08 07:44:39,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 676 to 489. [2025-03-08 07:44:39,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 489 states, 488 states have (on average 1.4282786885245902) internal successors, (697), 488 states have internal predecessors, (697), 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-03-08 07:44:39,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 697 transitions. [2025-03-08 07:44:39,467 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 697 transitions. Word has length 215 [2025-03-08 07:44:39,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:44:39,467 INFO L471 AbstractCegarLoop]: Abstraction has 489 states and 697 transitions. [2025-03-08 07:44:39,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 40.2) internal successors, (201), 5 states have internal predecessors, (201), 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-03-08 07:44:39,467 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 697 transitions. [2025-03-08 07:44:39,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2025-03-08 07:44:39,468 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:44:39,468 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:44:39,481 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 07:44:39,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2025-03-08 07:44:39,669 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:44:39,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:44:39,669 INFO L85 PathProgramCache]: Analyzing trace with hash -1328740624, now seen corresponding path program 1 times [2025-03-08 07:44:39,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:44:39,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837371144] [2025-03-08 07:44:39,669 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:44:39,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:44:39,729 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 215 statements into 1 equivalence classes. [2025-03-08 07:44:40,110 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 215 of 215 statements. [2025-03-08 07:44:40,110 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:44:40,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:44:41,767 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 44 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:44:41,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:44:41,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837371144] [2025-03-08 07:44:41,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837371144] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 07:44:41,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [956128535] [2025-03-08 07:44:41,767 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:44:41,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 07:44:41,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 07:44:41,769 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 07:44:41,772 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 07:44:42,310 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 215 statements into 1 equivalence classes. [2025-03-08 07:44:42,538 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 215 of 215 statements. [2025-03-08 07:44:42,538 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:44:42,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:44:42,550 INFO L256 TraceCheckSpWp]: Trace formula consists of 2385 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-08 07:44:42,556 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 07:44:42,728 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-08 07:44:42,728 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 07:44:42,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [956128535] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:44:42,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 07:44:42,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 14 [2025-03-08 07:44:42,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158777833] [2025-03-08 07:44:42,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:44:42,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 07:44:42,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:44:42,729 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 07:44:42,729 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2025-03-08 07:44:42,729 INFO L87 Difference]: Start difference. First operand 489 states and 697 transitions. Second operand has 5 states, 5 states have (on average 39.4) internal successors, (197), 5 states have internal predecessors, (197), 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-03-08 07:44:43,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:44:43,133 INFO L93 Difference]: Finished difference Result 1079 states and 1566 transitions. [2025-03-08 07:44:43,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 07:44:43,133 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 39.4) internal successors, (197), 5 states have internal predecessors, (197), 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 215 [2025-03-08 07:44:43,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:44:43,135 INFO L225 Difference]: With dead ends: 1079 [2025-03-08 07:44:43,135 INFO L226 Difference]: Without dead ends: 658 [2025-03-08 07:44:43,135 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 214 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2025-03-08 07:44:43,136 INFO L435 NwaCegarLoop]: 373 mSDtfsCounter, 105 mSDsluCounter, 803 mSDsCounter, 0 mSdLazyCounter, 922 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 1176 SdHoareTripleChecker+Invalid, 923 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 922 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 07:44:43,136 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 1176 Invalid, 923 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 922 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 07:44:43,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 658 states. [2025-03-08 07:44:43,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 658 to 487. [2025-03-08 07:44:43,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 487 states, 486 states have (on average 1.4279835390946503) internal successors, (694), 486 states have internal predecessors, (694), 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-03-08 07:44:43,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 694 transitions. [2025-03-08 07:44:43,141 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 694 transitions. Word has length 215 [2025-03-08 07:44:43,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:44:43,142 INFO L471 AbstractCegarLoop]: Abstraction has 487 states and 694 transitions. [2025-03-08 07:44:43,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 39.4) internal successors, (197), 5 states have internal predecessors, (197), 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-03-08 07:44:43,142 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 694 transitions. [2025-03-08 07:44:43,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2025-03-08 07:44:43,142 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:44:43,143 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:44:43,155 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-08 07:44:43,343 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 07:44:43,343 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:44:43,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:44:43,344 INFO L85 PathProgramCache]: Analyzing trace with hash -884443977, now seen corresponding path program 1 times [2025-03-08 07:44:43,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:44:43,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742392743] [2025-03-08 07:44:43,344 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:44:43,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:44:43,409 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 215 statements into 1 equivalence classes. [2025-03-08 07:44:43,571 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 215 of 215 statements. [2025-03-08 07:44:43,571 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:44:43,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:44:44,825 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 6 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:44:44,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:44:44,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742392743] [2025-03-08 07:44:44,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742392743] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 07:44:44,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1979964640] [2025-03-08 07:44:44,825 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:44:44,825 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 07:44:44,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 07:44:44,827 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 07:44:44,840 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 07:44:45,413 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 215 statements into 1 equivalence classes. [2025-03-08 07:44:45,624 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 215 of 215 statements. [2025-03-08 07:44:45,624 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:44:45,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:44:45,636 INFO L256 TraceCheckSpWp]: Trace formula consists of 2385 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-08 07:44:45,641 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 07:44:45,753 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2025-03-08 07:44:45,753 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 07:44:45,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1979964640] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:44:45,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 07:44:45,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2025-03-08 07:44:45,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908744737] [2025-03-08 07:44:45,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:44:45,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 07:44:45,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:44:45,753 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 07:44:45,754 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-03-08 07:44:45,754 INFO L87 Difference]: Start difference. First operand 487 states and 694 transitions. Second operand has 5 states, 5 states have (on average 37.4) internal successors, (187), 5 states have internal predecessors, (187), 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-03-08 07:44:46,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:44:46,127 INFO L93 Difference]: Finished difference Result 1035 states and 1500 transitions. [2025-03-08 07:44:46,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 07:44:46,127 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 37.4) internal successors, (187), 5 states have internal predecessors, (187), 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 215 [2025-03-08 07:44:46,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:44:46,129 INFO L225 Difference]: With dead ends: 1035 [2025-03-08 07:44:46,129 INFO L226 Difference]: Without dead ends: 616 [2025-03-08 07:44:46,129 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 214 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2025-03-08 07:44:46,130 INFO L435 NwaCegarLoop]: 373 mSDtfsCounter, 85 mSDsluCounter, 803 mSDsCounter, 0 mSdLazyCounter, 832 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 1176 SdHoareTripleChecker+Invalid, 833 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 832 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 07:44:46,130 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 1176 Invalid, 833 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 832 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 07:44:46,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2025-03-08 07:44:46,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 485. [2025-03-08 07:44:46,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 485 states, 484 states have (on average 1.427685950413223) internal successors, (691), 484 states have internal predecessors, (691), 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-03-08 07:44:46,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 691 transitions. [2025-03-08 07:44:46,136 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 691 transitions. Word has length 215 [2025-03-08 07:44:46,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:44:46,136 INFO L471 AbstractCegarLoop]: Abstraction has 485 states and 691 transitions. [2025-03-08 07:44:46,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 37.4) internal successors, (187), 5 states have internal predecessors, (187), 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-03-08 07:44:46,136 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 691 transitions. [2025-03-08 07:44:46,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2025-03-08 07:44:46,137 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:44:46,137 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:44:46,150 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-08 07:44:46,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 07:44:46,339 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:44:46,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:44:46,340 INFO L85 PathProgramCache]: Analyzing trace with hash -1490372435, now seen corresponding path program 1 times [2025-03-08 07:44:46,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:44:46,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450234422] [2025-03-08 07:44:46,340 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:44:46,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:44:46,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 215 statements into 1 equivalence classes. [2025-03-08 07:44:46,650 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 215 of 215 statements. [2025-03-08 07:44:46,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:44:46,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:44:47,771 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 6 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:44:47,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:44:47,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450234422] [2025-03-08 07:44:47,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450234422] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 07:44:47,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [308265693] [2025-03-08 07:44:47,771 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:44:47,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 07:44:47,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 07:44:47,773 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 07:44:47,774 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-08 07:44:48,383 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 215 statements into 1 equivalence classes. [2025-03-08 07:44:48,581 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 215 of 215 statements. [2025-03-08 07:44:48,581 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:44:48,581 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:44:48,591 INFO L256 TraceCheckSpWp]: Trace formula consists of 2385 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-08 07:44:48,595 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 07:44:48,692 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-08 07:44:48,692 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 07:44:48,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [308265693] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:44:48,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 07:44:48,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2025-03-08 07:44:48,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479992134] [2025-03-08 07:44:48,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:44:48,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 07:44:48,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:44:48,693 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 07:44:48,693 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-03-08 07:44:48,693 INFO L87 Difference]: Start difference. First operand 485 states and 691 transitions. Second operand has 5 states, 5 states have (on average 36.6) internal successors, (183), 5 states have internal predecessors, (183), 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-03-08 07:44:49,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:44:49,032 INFO L93 Difference]: Finished difference Result 1015 states and 1470 transitions. [2025-03-08 07:44:49,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 07:44:49,033 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 36.6) internal successors, (183), 5 states have internal predecessors, (183), 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 215 [2025-03-08 07:44:49,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:44:49,034 INFO L225 Difference]: With dead ends: 1015 [2025-03-08 07:44:49,034 INFO L226 Difference]: Without dead ends: 598 [2025-03-08 07:44:49,034 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 214 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2025-03-08 07:44:49,035 INFO L435 NwaCegarLoop]: 373 mSDtfsCounter, 77 mSDsluCounter, 803 mSDsCounter, 0 mSdLazyCounter, 796 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 1176 SdHoareTripleChecker+Invalid, 797 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 796 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 07:44:49,035 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 1176 Invalid, 797 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 796 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 07:44:49,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2025-03-08 07:44:49,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 483. [2025-03-08 07:44:49,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 483 states, 482 states have (on average 1.4273858921161826) internal successors, (688), 482 states have internal predecessors, (688), 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-03-08 07:44:49,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 483 states and 688 transitions. [2025-03-08 07:44:49,040 INFO L78 Accepts]: Start accepts. Automaton has 483 states and 688 transitions. Word has length 215 [2025-03-08 07:44:49,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:44:49,040 INFO L471 AbstractCegarLoop]: Abstraction has 483 states and 688 transitions. [2025-03-08 07:44:49,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 36.6) internal successors, (183), 5 states have internal predecessors, (183), 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-03-08 07:44:49,041 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 688 transitions. [2025-03-08 07:44:49,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2025-03-08 07:44:49,041 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:44:49,041 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:44:49,054 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-08 07:44:49,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2025-03-08 07:44:49,242 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:44:49,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:44:49,242 INFO L85 PathProgramCache]: Analyzing trace with hash -1666662732, now seen corresponding path program 1 times [2025-03-08 07:44:49,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:44:49,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186317759] [2025-03-08 07:44:49,243 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:44:49,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:44:49,301 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 215 statements into 1 equivalence classes. [2025-03-08 07:44:49,574 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 215 of 215 statements. [2025-03-08 07:44:49,575 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:44:49,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:44:51,289 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 20 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:44:51,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:44:51,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186317759] [2025-03-08 07:44:51,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1186317759] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 07:44:51,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1089481055] [2025-03-08 07:44:51,290 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:44:51,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 07:44:51,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 07:44:51,292 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 07:44:51,293 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-08 07:44:51,953 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 215 statements into 1 equivalence classes. [2025-03-08 07:44:52,154 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 215 of 215 statements. [2025-03-08 07:44:52,154 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:44:52,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:44:52,166 INFO L256 TraceCheckSpWp]: Trace formula consists of 2385 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-08 07:44:52,172 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 07:44:52,434 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 8 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:44:52,434 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 07:44:52,503 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-03-08 07:44:52,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1089481055] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-08 07:44:52,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-08 07:44:52,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [12, 6] total 17 [2025-03-08 07:44:52,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432682486] [2025-03-08 07:44:52,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:44:52,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 07:44:52,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:44:52,505 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 07:44:52,505 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2025-03-08 07:44:52,505 INFO L87 Difference]: Start difference. First operand 483 states and 688 transitions. Second operand has 5 states, 5 states have (on average 34.6) internal successors, (173), 5 states have internal predecessors, (173), 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-03-08 07:44:52,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:44:52,757 INFO L93 Difference]: Finished difference Result 971 states and 1404 transitions. [2025-03-08 07:44:52,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 07:44:52,758 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 34.6) internal successors, (173), 5 states have internal predecessors, (173), 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 215 [2025-03-08 07:44:52,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:44:52,759 INFO L225 Difference]: With dead ends: 971 [2025-03-08 07:44:52,759 INFO L226 Difference]: Without dead ends: 556 [2025-03-08 07:44:52,760 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 442 GetRequests, 426 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2025-03-08 07:44:52,760 INFO L435 NwaCegarLoop]: 373 mSDtfsCounter, 109 mSDsluCounter, 575 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 948 SdHoareTripleChecker+Invalid, 449 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 07:44:52,760 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 948 Invalid, 449 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 448 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 07:44:52,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2025-03-08 07:44:52,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 481. [2025-03-08 07:44:52,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 481 states, 480 states have (on average 1.4270833333333333) internal successors, (685), 480 states have internal predecessors, (685), 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-03-08 07:44:52,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 685 transitions. [2025-03-08 07:44:52,765 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 685 transitions. Word has length 215 [2025-03-08 07:44:52,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:44:52,765 INFO L471 AbstractCegarLoop]: Abstraction has 481 states and 685 transitions. [2025-03-08 07:44:52,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 34.6) internal successors, (173), 5 states have internal predecessors, (173), 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-03-08 07:44:52,766 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 685 transitions. [2025-03-08 07:44:52,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2025-03-08 07:44:52,766 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:44:52,766 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:44:52,780 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-08 07:44:52,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2025-03-08 07:44:52,967 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:44:52,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:44:52,967 INFO L85 PathProgramCache]: Analyzing trace with hash -1584297686, now seen corresponding path program 1 times [2025-03-08 07:44:52,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:44:52,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344349176] [2025-03-08 07:44:52,968 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:44:52,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:44:53,032 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 215 statements into 1 equivalence classes. [2025-03-08 07:44:53,264 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 215 of 215 statements. [2025-03-08 07:44:53,264 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:44:53,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:44:54,725 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 16 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:44:54,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:44:54,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344349176] [2025-03-08 07:44:54,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344349176] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 07:44:54,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [396875768] [2025-03-08 07:44:54,726 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:44:54,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 07:44:54,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 07:44:54,728 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 07:44:54,729 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-08 07:44:55,429 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 215 statements into 1 equivalence classes. [2025-03-08 07:44:55,623 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 215 of 215 statements. [2025-03-08 07:44:55,623 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:44:55,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:44:55,633 INFO L256 TraceCheckSpWp]: Trace formula consists of 2385 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-08 07:44:55,638 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 07:44:55,827 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 8 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:44:55,827 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 07:44:55,873 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2025-03-08 07:44:55,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [396875768] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-08 07:44:55,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-08 07:44:55,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [11, 6] total 16 [2025-03-08 07:44:55,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941205656] [2025-03-08 07:44:55,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:44:55,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 07:44:55,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:44:55,874 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 07:44:55,874 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2025-03-08 07:44:55,874 INFO L87 Difference]: Start difference. First operand 481 states and 685 transitions. Second operand has 5 states, 5 states have (on average 33.8) internal successors, (169), 5 states have internal predecessors, (169), 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-03-08 07:44:56,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:44:56,185 INFO L93 Difference]: Finished difference Result 951 states and 1374 transitions. [2025-03-08 07:44:56,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 07:44:56,185 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.8) internal successors, (169), 5 states have internal predecessors, (169), 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 215 [2025-03-08 07:44:56,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:44:56,187 INFO L225 Difference]: With dead ends: 951 [2025-03-08 07:44:56,187 INFO L226 Difference]: Without dead ends: 538 [2025-03-08 07:44:56,187 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 441 GetRequests, 426 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2025-03-08 07:44:56,188 INFO L435 NwaCegarLoop]: 373 mSDtfsCounter, 47 mSDsluCounter, 780 mSDsCounter, 0 mSdLazyCounter, 641 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 1153 SdHoareTripleChecker+Invalid, 642 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 641 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 07:44:56,188 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 1153 Invalid, 642 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 641 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 07:44:56,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2025-03-08 07:44:56,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 479. [2025-03-08 07:44:56,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 479 states, 478 states have (on average 1.4267782426778242) internal successors, (682), 478 states have internal predecessors, (682), 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-03-08 07:44:56,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 682 transitions. [2025-03-08 07:44:56,193 INFO L78 Accepts]: Start accepts. Automaton has 479 states and 682 transitions. Word has length 215 [2025-03-08 07:44:56,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:44:56,193 INFO L471 AbstractCegarLoop]: Abstraction has 479 states and 682 transitions. [2025-03-08 07:44:56,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.8) internal successors, (169), 5 states have internal predecessors, (169), 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-03-08 07:44:56,194 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 682 transitions. [2025-03-08 07:44:56,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2025-03-08 07:44:56,194 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:44:56,194 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:44:56,209 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-08 07:44:56,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 07:44:56,395 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:44:56,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:44:56,396 INFO L85 PathProgramCache]: Analyzing trace with hash -448921952, now seen corresponding path program 1 times [2025-03-08 07:44:56,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:44:56,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548016259] [2025-03-08 07:44:56,397 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:44:56,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:44:56,465 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 215 statements into 1 equivalence classes. [2025-03-08 07:44:56,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 215 of 215 statements. [2025-03-08 07:44:56,726 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:44:56,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat