./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.BOUNDED-12.pals.c.v+nlh-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.BOUNDED-12.pals.c.v+nlh-reducer.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash bb7f3b8fa32d5493bfca7086e69548af9d6372d67a054dd07846784fcdf24eca --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 04:53:04,863 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 04:53:04,900 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 04:53:04,906 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 04:53:04,907 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 04:53:04,932 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 04:53:04,933 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 04:53:04,933 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 04:53:04,934 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 04:53:04,934 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 04:53:04,934 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 04:53:04,934 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 04:53:04,934 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 04:53:04,934 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 04:53:04,934 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 04:53:04,934 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 04:53:04,934 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 04:53:04,935 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 04:53:04,935 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 04:53:04,935 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 04:53:04,935 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 04:53:04,935 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 04:53:04,935 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 04:53:04,935 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 04:53:04,935 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 04:53:04,935 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 04:53:04,935 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 04:53:04,935 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 04:53:04,936 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 04:53:04,936 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 04:53:04,936 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 04:53:04,936 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 04:53:04,936 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:53:04,936 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 04:53:04,936 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 04:53:04,936 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 04:53:04,936 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 04:53:04,936 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:53:04,936 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 04:53:04,936 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 04:53:04,936 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 04:53:04,936 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 04:53:04,936 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 04:53:04,936 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 04:53:04,936 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 04:53:04,936 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 04:53:04,937 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 04:53:04,937 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 04:53:04,937 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> bb7f3b8fa32d5493bfca7086e69548af9d6372d67a054dd07846784fcdf24eca [2025-01-09 04:53:05,153 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 04:53:05,163 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 04:53:05,167 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 04:53:05,168 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 04:53:05,168 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 04:53:05,169 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.BOUNDED-12.pals.c.v+nlh-reducer.c [2025-01-09 04:53:06,458 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/26f9f994d/f0e15f8568ce4bf69c57921ff81d1c60/FLAGcfb80b56e [2025-01-09 04:53:06,739 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 04:53:06,740 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.BOUNDED-12.pals.c.v+nlh-reducer.c [2025-01-09 04:53:06,756 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/26f9f994d/f0e15f8568ce4bf69c57921ff81d1c60/FLAGcfb80b56e [2025-01-09 04:53:07,026 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/26f9f994d/f0e15f8568ce4bf69c57921ff81d1c60 [2025-01-09 04:53:07,028 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 04:53:07,028 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 04:53:07,029 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 04:53:07,030 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 04:53:07,032 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 04:53:07,033 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:53:07" (1/1) ... [2025-01-09 04:53:07,034 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2097ff5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:53:07, skipping insertion in model container [2025-01-09 04:53:07,034 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:53:07" (1/1) ... [2025-01-09 04:53:07,056 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 04:53:07,218 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.BOUNDED-12.pals.c.v+nlh-reducer.c[9241,9254] [2025-01-09 04:53:07,251 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 04:53:07,263 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 04:53:07,335 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.BOUNDED-12.pals.c.v+nlh-reducer.c[9241,9254] [2025-01-09 04:53:07,371 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 04:53:07,393 INFO L204 MainTranslator]: Completed translation [2025-01-09 04:53:07,396 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:53:07 WrapperNode [2025-01-09 04:53:07,399 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 04:53:07,400 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 04:53:07,400 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 04:53:07,400 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 04:53:07,407 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:53:07" (1/1) ... [2025-01-09 04:53:07,415 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:53:07" (1/1) ... [2025-01-09 04:53:07,443 INFO L138 Inliner]: procedures = 25, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 809 [2025-01-09 04:53:07,444 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 04:53:07,444 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 04:53:07,444 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 04:53:07,445 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 04:53:07,452 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:53:07" (1/1) ... [2025-01-09 04:53:07,452 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:53:07" (1/1) ... [2025-01-09 04:53:07,455 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:53:07" (1/1) ... [2025-01-09 04:53:07,468 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-01-09 04:53:07,468 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:53:07" (1/1) ... [2025-01-09 04:53:07,469 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:53:07" (1/1) ... [2025-01-09 04:53:07,475 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:53:07" (1/1) ... [2025-01-09 04:53:07,477 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:53:07" (1/1) ... [2025-01-09 04:53:07,480 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:53:07" (1/1) ... [2025-01-09 04:53:07,481 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:53:07" (1/1) ... [2025-01-09 04:53:07,483 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:53:07" (1/1) ... [2025-01-09 04:53:07,485 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 04:53:07,486 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 04:53:07,486 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 04:53:07,486 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 04:53:07,487 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:53:07" (1/1) ... [2025-01-09 04:53:07,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:53:07,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:53:07,510 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 04:53:07,518 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 04:53:07,544 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 04:53:07,544 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 04:53:07,544 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 04:53:07,544 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 04:53:07,641 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 04:53:07,643 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 04:53:08,211 INFO L? ?]: Removed 99 outVars from TransFormulas that were not future-live. [2025-01-09 04:53:08,212 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 04:53:08,222 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 04:53:08,223 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 04:53:08,223 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:53:08 BoogieIcfgContainer [2025-01-09 04:53:08,223 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 04:53:08,225 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 04:53:08,225 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 04:53:08,229 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 04:53:08,229 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:53:07" (1/3) ... [2025-01-09 04:53:08,229 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22c5e32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:53:08, skipping insertion in model container [2025-01-09 04:53:08,230 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:53:07" (2/3) ... [2025-01-09 04:53:08,230 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22c5e32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:53:08, skipping insertion in model container [2025-01-09 04:53:08,230 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:53:08" (3/3) ... [2025-01-09 04:53:08,231 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.6.ufo.BOUNDED-12.pals.c.v+nlh-reducer.c [2025-01-09 04:53:08,242 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 04:53:08,245 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.6.ufo.BOUNDED-12.pals.c.v+nlh-reducer.c that has 1 procedures, 178 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-01-09 04:53:08,302 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 04:53:08,312 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;@56bda0fa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 04:53:08,312 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 04:53:08,315 INFO L276 IsEmpty]: Start isEmpty. Operand has 178 states, 176 states have (on average 1.7613636363636365) internal successors, (310), 177 states have internal predecessors, (310), 0 states have call successors, (0), 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-01-09 04:53:08,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-01-09 04:53:08,320 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:53:08,320 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:53:08,320 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:53:08,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:53:08,323 INFO L85 PathProgramCache]: Analyzing trace with hash 2136906399, now seen corresponding path program 1 times [2025-01-09 04:53:08,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:53:08,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715143172] [2025-01-09 04:53:08,328 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:53:08,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:53:08,393 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-01-09 04:53:08,505 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-01-09 04:53:08,505 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:53:08,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:53:08,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:53:08,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:53:08,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715143172] [2025-01-09 04:53:08,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715143172] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:53:08,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:53:08,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:53:08,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394374123] [2025-01-09 04:53:08,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:53:08,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 04:53:08,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:53:08,969 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 04:53:08,970 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 04:53:08,973 INFO L87 Difference]: Start difference. First operand has 178 states, 176 states have (on average 1.7613636363636365) internal successors, (310), 177 states have internal predecessors, (310), 0 states have call successors, (0), 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 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 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-01-09 04:53:09,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:53:09,442 INFO L93 Difference]: Finished difference Result 1147 states and 1843 transitions. [2025-01-09 04:53:09,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 04:53:09,444 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 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 91 [2025-01-09 04:53:09,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:53:09,460 INFO L225 Difference]: With dead ends: 1147 [2025-01-09 04:53:09,460 INFO L226 Difference]: Without dead ends: 1037 [2025-01-09 04:53:09,464 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=181, Unknown=0, NotChecked=0, Total=272 [2025-01-09 04:53:09,467 INFO L435 NwaCegarLoop]: 719 mSDtfsCounter, 2029 mSDsluCounter, 3070 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2029 SdHoareTripleChecker+Valid, 3789 SdHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 04:53:09,468 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2029 Valid, 3789 Invalid, 315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 04:53:09,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1037 states. [2025-01-09 04:53:09,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1037 to 270. [2025-01-09 04:53:09,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 269 states have (on average 1.449814126394052) internal successors, (390), 269 states have internal predecessors, (390), 0 states have call successors, (0), 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-01-09 04:53:09,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 390 transitions. [2025-01-09 04:53:09,525 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 390 transitions. Word has length 91 [2025-01-09 04:53:09,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:53:09,525 INFO L471 AbstractCegarLoop]: Abstraction has 270 states and 390 transitions. [2025-01-09 04:53:09,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 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-01-09 04:53:09,526 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 390 transitions. [2025-01-09 04:53:09,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-01-09 04:53:09,528 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:53:09,528 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:53:09,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 04:53:09,529 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:53:09,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:53:09,530 INFO L85 PathProgramCache]: Analyzing trace with hash -1446649810, now seen corresponding path program 1 times [2025-01-09 04:53:09,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:53:09,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67754555] [2025-01-09 04:53:09,530 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:53:09,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:53:09,552 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-01-09 04:53:09,571 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-01-09 04:53:09,571 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:53:09,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:53:09,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:53:09,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:53:09,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67754555] [2025-01-09 04:53:09,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67754555] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:53:09,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:53:09,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:53:09,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746204971] [2025-01-09 04:53:09,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:53:09,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 04:53:09,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:53:09,847 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 04:53:09,848 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 04:53:09,848 INFO L87 Difference]: Start difference. First operand 270 states and 390 transitions. Second operand has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 states have internal predecessors, (93), 0 states have call successors, (0), 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-01-09 04:53:10,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:53:10,062 INFO L93 Difference]: Finished difference Result 1236 states and 1911 transitions. [2025-01-09 04:53:10,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 04:53:10,062 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 states have internal predecessors, (93), 0 states have call successors, (0), 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 93 [2025-01-09 04:53:10,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:53:10,068 INFO L225 Difference]: With dead ends: 1236 [2025-01-09 04:53:10,068 INFO L226 Difference]: Without dead ends: 1096 [2025-01-09 04:53:10,069 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-01-09 04:53:10,070 INFO L435 NwaCegarLoop]: 674 mSDtfsCounter, 1353 mSDsluCounter, 1417 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1353 SdHoareTripleChecker+Valid, 2091 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:53:10,070 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1353 Valid, 2091 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:53:10,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1096 states. [2025-01-09 04:53:10,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1096 to 429. [2025-01-09 04:53:10,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 429 states, 428 states have (on average 1.5) internal successors, (642), 428 states have internal predecessors, (642), 0 states have call successors, (0), 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-01-09 04:53:10,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 642 transitions. [2025-01-09 04:53:10,097 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 642 transitions. Word has length 93 [2025-01-09 04:53:10,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:53:10,097 INFO L471 AbstractCegarLoop]: Abstraction has 429 states and 642 transitions. [2025-01-09 04:53:10,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 states have internal predecessors, (93), 0 states have call successors, (0), 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-01-09 04:53:10,098 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 642 transitions. [2025-01-09 04:53:10,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-01-09 04:53:10,099 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:53:10,099 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:53:10,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 04:53:10,100 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:53:10,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:53:10,100 INFO L85 PathProgramCache]: Analyzing trace with hash 529896762, now seen corresponding path program 1 times [2025-01-09 04:53:10,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:53:10,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396674669] [2025-01-09 04:53:10,101 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:53:10,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:53:10,121 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-01-09 04:53:10,137 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-01-09 04:53:10,138 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:53:10,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:53:10,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:53:10,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:53:10,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396674669] [2025-01-09 04:53:10,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396674669] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:53:10,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:53:10,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:53:10,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378496476] [2025-01-09 04:53:10,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:53:10,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 04:53:10,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:53:10,363 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 04:53:10,363 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 04:53:10,363 INFO L87 Difference]: Start difference. First operand 429 states and 642 transitions. Second operand has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 states have internal predecessors, (93), 0 states have call successors, (0), 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-01-09 04:53:10,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:53:10,544 INFO L93 Difference]: Finished difference Result 1390 states and 2155 transitions. [2025-01-09 04:53:10,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 04:53:10,545 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 states have internal predecessors, (93), 0 states have call successors, (0), 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 93 [2025-01-09 04:53:10,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:53:10,549 INFO L225 Difference]: With dead ends: 1390 [2025-01-09 04:53:10,549 INFO L226 Difference]: Without dead ends: 1250 [2025-01-09 04:53:10,550 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-01-09 04:53:10,550 INFO L435 NwaCegarLoop]: 565 mSDtfsCounter, 1559 mSDsluCounter, 1221 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1559 SdHoareTripleChecker+Valid, 1786 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:53:10,551 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1559 Valid, 1786 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:53:10,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1250 states. [2025-01-09 04:53:10,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1250 to 652. [2025-01-09 04:53:10,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 652 states, 651 states have (on average 1.5284178187403994) internal successors, (995), 651 states have internal predecessors, (995), 0 states have call successors, (0), 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-01-09 04:53:10,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 652 states to 652 states and 995 transitions. [2025-01-09 04:53:10,573 INFO L78 Accepts]: Start accepts. Automaton has 652 states and 995 transitions. Word has length 93 [2025-01-09 04:53:10,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:53:10,574 INFO L471 AbstractCegarLoop]: Abstraction has 652 states and 995 transitions. [2025-01-09 04:53:10,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 states have internal predecessors, (93), 0 states have call successors, (0), 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-01-09 04:53:10,574 INFO L276 IsEmpty]: Start isEmpty. Operand 652 states and 995 transitions. [2025-01-09 04:53:10,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-01-09 04:53:10,575 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:53:10,575 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:53:10,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 04:53:10,576 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:53:10,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:53:10,576 INFO L85 PathProgramCache]: Analyzing trace with hash -1234930226, now seen corresponding path program 1 times [2025-01-09 04:53:10,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:53:10,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922858630] [2025-01-09 04:53:10,576 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:53:10,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:53:10,597 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-01-09 04:53:10,611 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-01-09 04:53:10,611 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:53:10,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:53:10,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:53:10,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:53:10,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922858630] [2025-01-09 04:53:10,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922858630] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:53:10,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:53:10,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:53:10,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884219972] [2025-01-09 04:53:10,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:53:10,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 04:53:10,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:53:10,780 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 04:53:10,780 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 04:53:10,780 INFO L87 Difference]: Start difference. First operand 652 states and 995 transitions. Second operand has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 states have internal predecessors, (93), 0 states have call successors, (0), 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-01-09 04:53:10,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:53:10,961 INFO L93 Difference]: Finished difference Result 1539 states and 2391 transitions. [2025-01-09 04:53:10,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 04:53:10,961 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 states have internal predecessors, (93), 0 states have call successors, (0), 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 93 [2025-01-09 04:53:10,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:53:10,966 INFO L225 Difference]: With dead ends: 1539 [2025-01-09 04:53:10,966 INFO L226 Difference]: Without dead ends: 1399 [2025-01-09 04:53:10,966 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-01-09 04:53:10,967 INFO L435 NwaCegarLoop]: 448 mSDtfsCounter, 1757 mSDsluCounter, 1486 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1757 SdHoareTripleChecker+Valid, 1934 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:53:10,967 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1757 Valid, 1934 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:53:10,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1399 states. [2025-01-09 04:53:10,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1399 to 796. [2025-01-09 04:53:10,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 796 states, 795 states have (on average 1.538364779874214) internal successors, (1223), 795 states have internal predecessors, (1223), 0 states have call successors, (0), 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-01-09 04:53:10,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 1223 transitions. [2025-01-09 04:53:10,989 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 1223 transitions. Word has length 93 [2025-01-09 04:53:10,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:53:10,989 INFO L471 AbstractCegarLoop]: Abstraction has 796 states and 1223 transitions. [2025-01-09 04:53:10,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 states have internal predecessors, (93), 0 states have call successors, (0), 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-01-09 04:53:10,990 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 1223 transitions. [2025-01-09 04:53:10,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-01-09 04:53:10,991 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:53:10,991 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:53:10,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 04:53:10,991 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:53:10,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:53:10,992 INFO L85 PathProgramCache]: Analyzing trace with hash -1576423674, now seen corresponding path program 1 times [2025-01-09 04:53:10,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:53:10,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539253796] [2025-01-09 04:53:10,992 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:53:10,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:53:11,008 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-01-09 04:53:11,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-01-09 04:53:11,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:53:11,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:53:11,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:53:11,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:53:11,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539253796] [2025-01-09 04:53:11,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539253796] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:53:11,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:53:11,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:53:11,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123444683] [2025-01-09 04:53:11,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:53:11,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 04:53:11,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:53:11,159 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 04:53:11,159 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 04:53:11,159 INFO L87 Difference]: Start difference. First operand 796 states and 1223 transitions. Second operand has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 states have internal predecessors, (93), 0 states have call successors, (0), 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-01-09 04:53:11,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:53:11,303 INFO L93 Difference]: Finished difference Result 1678 states and 2611 transitions. [2025-01-09 04:53:11,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 04:53:11,304 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 states have internal predecessors, (93), 0 states have call successors, (0), 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 93 [2025-01-09 04:53:11,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:53:11,308 INFO L225 Difference]: With dead ends: 1678 [2025-01-09 04:53:11,308 INFO L226 Difference]: Without dead ends: 1538 [2025-01-09 04:53:11,309 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-01-09 04:53:11,310 INFO L435 NwaCegarLoop]: 339 mSDtfsCounter, 1864 mSDsluCounter, 1469 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1864 SdHoareTripleChecker+Valid, 1808 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:53:11,310 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1864 Valid, 1808 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:53:11,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1538 states. [2025-01-09 04:53:11,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1538 to 935. [2025-01-09 04:53:11,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 935 states, 934 states have (on average 1.544967880085653) internal successors, (1443), 934 states have internal predecessors, (1443), 0 states have call successors, (0), 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-01-09 04:53:11,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 935 states to 935 states and 1443 transitions. [2025-01-09 04:53:11,328 INFO L78 Accepts]: Start accepts. Automaton has 935 states and 1443 transitions. Word has length 93 [2025-01-09 04:53:11,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:53:11,328 INFO L471 AbstractCegarLoop]: Abstraction has 935 states and 1443 transitions. [2025-01-09 04:53:11,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 states have internal predecessors, (93), 0 states have call successors, (0), 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-01-09 04:53:11,328 INFO L276 IsEmpty]: Start isEmpty. Operand 935 states and 1443 transitions. [2025-01-09 04:53:11,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-01-09 04:53:11,329 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:53:11,329 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:53:11,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 04:53:11,329 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:53:11,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:53:11,330 INFO L85 PathProgramCache]: Analyzing trace with hash 1813331907, now seen corresponding path program 1 times [2025-01-09 04:53:11,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:53:11,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006405674] [2025-01-09 04:53:11,330 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:53:11,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:53:11,343 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-01-09 04:53:11,354 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-01-09 04:53:11,355 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:53:11,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:53:11,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:53:11,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:53:11,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006405674] [2025-01-09 04:53:11,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006405674] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:53:11,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:53:11,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:53:11,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271714017] [2025-01-09 04:53:11,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:53:11,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 04:53:11,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:53:11,697 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 04:53:11,697 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-01-09 04:53:11,697 INFO L87 Difference]: Start difference. First operand 935 states and 1443 transitions. Second operand has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 states have internal predecessors, (93), 0 states have call successors, (0), 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-01-09 04:53:11,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:53:11,909 INFO L93 Difference]: Finished difference Result 1698 states and 2650 transitions. [2025-01-09 04:53:11,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 04:53:11,910 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 states have internal predecessors, (93), 0 states have call successors, (0), 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 93 [2025-01-09 04:53:11,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:53:11,912 INFO L225 Difference]: With dead ends: 1698 [2025-01-09 04:53:11,912 INFO L226 Difference]: Without dead ends: 937 [2025-01-09 04:53:11,913 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2025-01-09 04:53:11,914 INFO L435 NwaCegarLoop]: 230 mSDtfsCounter, 448 mSDsluCounter, 726 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 448 SdHoareTripleChecker+Valid, 956 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:53:11,914 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [448 Valid, 956 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:53:11,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 937 states. [2025-01-09 04:53:11,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 937 to 935. [2025-01-09 04:53:11,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 935 states, 934 states have (on average 1.5385438972162742) internal successors, (1437), 934 states have internal predecessors, (1437), 0 states have call successors, (0), 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-01-09 04:53:11,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 935 states to 935 states and 1437 transitions. [2025-01-09 04:53:11,929 INFO L78 Accepts]: Start accepts. Automaton has 935 states and 1437 transitions. Word has length 93 [2025-01-09 04:53:11,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:53:11,929 INFO L471 AbstractCegarLoop]: Abstraction has 935 states and 1437 transitions. [2025-01-09 04:53:11,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 states have internal predecessors, (93), 0 states have call successors, (0), 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-01-09 04:53:11,929 INFO L276 IsEmpty]: Start isEmpty. Operand 935 states and 1437 transitions. [2025-01-09 04:53:11,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-01-09 04:53:11,930 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:53:11,930 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:53:11,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 04:53:11,930 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:53:11,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:53:11,931 INFO L85 PathProgramCache]: Analyzing trace with hash 1570207556, now seen corresponding path program 1 times [2025-01-09 04:53:11,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:53:11,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38602440] [2025-01-09 04:53:11,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:53:11,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:53:11,944 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-01-09 04:53:11,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-01-09 04:53:11,953 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:53:11,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:53:11,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:53:11,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:53:11,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38602440] [2025-01-09 04:53:11,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38602440] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:53:11,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:53:11,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:53:11,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888377813] [2025-01-09 04:53:11,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:53:11,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:53:11,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:53:11,984 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:53:11,984 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:53:11,985 INFO L87 Difference]: Start difference. First operand 935 states and 1437 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 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-01-09 04:53:12,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:53:12,011 INFO L93 Difference]: Finished difference Result 2386 states and 3718 transitions. [2025-01-09 04:53:12,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:53:12,011 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 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 93 [2025-01-09 04:53:12,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:53:12,018 INFO L225 Difference]: With dead ends: 2386 [2025-01-09 04:53:12,018 INFO L226 Difference]: Without dead ends: 1625 [2025-01-09 04:53:12,019 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:53:12,019 INFO L435 NwaCegarLoop]: 335 mSDtfsCounter, 99 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 562 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:53:12,020 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 562 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:53:12,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1625 states. [2025-01-09 04:53:12,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1625 to 1623. [2025-01-09 04:53:12,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1623 states, 1622 states have (on average 1.5382244143033292) internal successors, (2495), 1622 states have internal predecessors, (2495), 0 states have call successors, (0), 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-01-09 04:53:12,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1623 states to 1623 states and 2495 transitions. [2025-01-09 04:53:12,049 INFO L78 Accepts]: Start accepts. Automaton has 1623 states and 2495 transitions. Word has length 93 [2025-01-09 04:53:12,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:53:12,050 INFO L471 AbstractCegarLoop]: Abstraction has 1623 states and 2495 transitions. [2025-01-09 04:53:12,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 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-01-09 04:53:12,050 INFO L276 IsEmpty]: Start isEmpty. Operand 1623 states and 2495 transitions. [2025-01-09 04:53:12,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-01-09 04:53:12,050 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:53:12,051 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:53:12,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 04:53:12,051 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:53:12,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:53:12,051 INFO L85 PathProgramCache]: Analyzing trace with hash -906608998, now seen corresponding path program 1 times [2025-01-09 04:53:12,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:53:12,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015669229] [2025-01-09 04:53:12,051 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:53:12,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:53:12,066 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-01-09 04:53:12,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-01-09 04:53:12,076 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:53:12,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:53:12,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:53:12,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:53:12,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015669229] [2025-01-09 04:53:12,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015669229] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:53:12,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:53:12,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:53:12,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404274533] [2025-01-09 04:53:12,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:53:12,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 04:53:12,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:53:12,227 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 04:53:12,227 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 04:53:12,227 INFO L87 Difference]: Start difference. First operand 1623 states and 2495 transitions. Second operand has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 states have internal predecessors, (93), 0 states have call successors, (0), 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-01-09 04:53:12,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:53:12,413 INFO L93 Difference]: Finished difference Result 3260 states and 5043 transitions. [2025-01-09 04:53:12,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 04:53:12,413 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 states have internal predecessors, (93), 0 states have call successors, (0), 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 93 [2025-01-09 04:53:12,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:53:12,422 INFO L225 Difference]: With dead ends: 3260 [2025-01-09 04:53:12,422 INFO L226 Difference]: Without dead ends: 2995 [2025-01-09 04:53:12,423 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-01-09 04:53:12,423 INFO L435 NwaCegarLoop]: 457 mSDtfsCounter, 1630 mSDsluCounter, 2043 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1630 SdHoareTripleChecker+Valid, 2500 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:53:12,424 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1630 Valid, 2500 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:53:12,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2995 states. [2025-01-09 04:53:12,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2995 to 1897. [2025-01-09 04:53:12,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1897 states, 1896 states have (on average 1.5411392405063291) internal successors, (2922), 1896 states have internal predecessors, (2922), 0 states have call successors, (0), 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-01-09 04:53:12,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1897 states to 1897 states and 2922 transitions. [2025-01-09 04:53:12,479 INFO L78 Accepts]: Start accepts. Automaton has 1897 states and 2922 transitions. Word has length 93 [2025-01-09 04:53:12,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:53:12,480 INFO L471 AbstractCegarLoop]: Abstraction has 1897 states and 2922 transitions. [2025-01-09 04:53:12,480 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 states have internal predecessors, (93), 0 states have call successors, (0), 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-01-09 04:53:12,480 INFO L276 IsEmpty]: Start isEmpty. Operand 1897 states and 2922 transitions. [2025-01-09 04:53:12,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-01-09 04:53:12,481 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:53:12,481 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:53:12,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 04:53:12,481 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:53:12,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:53:12,482 INFO L85 PathProgramCache]: Analyzing trace with hash 861848230, now seen corresponding path program 1 times [2025-01-09 04:53:12,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:53:12,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934241263] [2025-01-09 04:53:12,482 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:53:12,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:53:12,495 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-01-09 04:53:12,503 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-01-09 04:53:12,503 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:53:12,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:53:12,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:53:12,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:53:12,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934241263] [2025-01-09 04:53:12,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934241263] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:53:12,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:53:12,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:53:12,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170970484] [2025-01-09 04:53:12,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:53:12,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 04:53:12,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:53:12,632 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 04:53:12,632 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 04:53:12,632 INFO L87 Difference]: Start difference. First operand 1897 states and 2922 transitions. Second operand has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 states have internal predecessors, (93), 0 states have call successors, (0), 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-01-09 04:53:12,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:53:12,794 INFO L93 Difference]: Finished difference Result 3544 states and 5486 transitions. [2025-01-09 04:53:12,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 04:53:12,794 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 states have internal predecessors, (93), 0 states have call successors, (0), 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 93 [2025-01-09 04:53:12,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:53:12,801 INFO L225 Difference]: With dead ends: 3544 [2025-01-09 04:53:12,802 INFO L226 Difference]: Without dead ends: 3279 [2025-01-09 04:53:12,802 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-01-09 04:53:12,803 INFO L435 NwaCegarLoop]: 382 mSDtfsCounter, 1746 mSDsluCounter, 1885 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1746 SdHoareTripleChecker+Valid, 2267 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:53:12,803 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1746 Valid, 2267 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:53:12,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3279 states. [2025-01-09 04:53:12,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3279 to 2181. [2025-01-09 04:53:12,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2181 states, 2180 states have (on average 1.5435779816513762) internal successors, (3365), 2180 states have internal predecessors, (3365), 0 states have call successors, (0), 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-01-09 04:53:12,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2181 states to 2181 states and 3365 transitions. [2025-01-09 04:53:12,842 INFO L78 Accepts]: Start accepts. Automaton has 2181 states and 3365 transitions. Word has length 93 [2025-01-09 04:53:12,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:53:12,842 INFO L471 AbstractCegarLoop]: Abstraction has 2181 states and 3365 transitions. [2025-01-09 04:53:12,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 states have internal predecessors, (93), 0 states have call successors, (0), 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-01-09 04:53:12,842 INFO L276 IsEmpty]: Start isEmpty. Operand 2181 states and 3365 transitions. [2025-01-09 04:53:12,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-01-09 04:53:12,843 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:53:12,843 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:53:12,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 04:53:12,843 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:53:12,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:53:12,844 INFO L85 PathProgramCache]: Analyzing trace with hash 376805043, now seen corresponding path program 1 times [2025-01-09 04:53:12,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:53:12,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175450141] [2025-01-09 04:53:12,844 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:53:12,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:53:12,856 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-01-09 04:53:12,867 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-01-09 04:53:12,867 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:53:12,867 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:53:12,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:53:12,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:53:12,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175450141] [2025-01-09 04:53:12,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175450141] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:53:12,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:53:12,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:53:12,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469440668] [2025-01-09 04:53:12,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:53:12,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:53:12,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:53:12,926 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:53:12,926 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:53:12,926 INFO L87 Difference]: Start difference. First operand 2181 states and 3365 transitions. Second operand has 5 states, 5 states have (on average 18.8) internal successors, (94), 4 states have internal predecessors, (94), 0 states have call successors, (0), 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-01-09 04:53:13,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:53:13,077 INFO L93 Difference]: Finished difference Result 4311 states and 6677 transitions. [2025-01-09 04:53:13,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:53:13,078 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 4 states have internal predecessors, (94), 0 states have call successors, (0), 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 94 [2025-01-09 04:53:13,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:53:13,085 INFO L225 Difference]: With dead ends: 4311 [2025-01-09 04:53:13,085 INFO L226 Difference]: Without dead ends: 2181 [2025-01-09 04:53:13,088 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:53:13,089 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 648 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 648 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:53:13,089 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [648 Valid, 139 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:53:13,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2181 states. [2025-01-09 04:53:13,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2181 to 2181. [2025-01-09 04:53:13,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2181 states, 2180 states have (on average 1.5293577981651376) internal successors, (3334), 2180 states have internal predecessors, (3334), 0 states have call successors, (0), 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-01-09 04:53:13,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2181 states to 2181 states and 3334 transitions. [2025-01-09 04:53:13,138 INFO L78 Accepts]: Start accepts. Automaton has 2181 states and 3334 transitions. Word has length 94 [2025-01-09 04:53:13,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:53:13,139 INFO L471 AbstractCegarLoop]: Abstraction has 2181 states and 3334 transitions. [2025-01-09 04:53:13,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 4 states have internal predecessors, (94), 0 states have call successors, (0), 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-01-09 04:53:13,139 INFO L276 IsEmpty]: Start isEmpty. Operand 2181 states and 3334 transitions. [2025-01-09 04:53:13,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-01-09 04:53:13,140 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:53:13,141 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:53:13,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 04:53:13,141 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:53:13,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:53:13,141 INFO L85 PathProgramCache]: Analyzing trace with hash -1521549230, now seen corresponding path program 1 times [2025-01-09 04:53:13,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:53:13,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275917544] [2025-01-09 04:53:13,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:53:13,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:53:13,154 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-01-09 04:53:13,167 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-01-09 04:53:13,168 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:53:13,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:53:13,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:53:13,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:53:13,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275917544] [2025-01-09 04:53:13,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275917544] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:53:13,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:53:13,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:53:13,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171930133] [2025-01-09 04:53:13,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:53:13,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:53:13,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:53:13,239 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:53:13,239 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:53:13,239 INFO L87 Difference]: Start difference. First operand 2181 states and 3334 transitions. Second operand has 5 states, 5 states have (on average 19.0) internal successors, (95), 4 states have internal predecessors, (95), 0 states have call successors, (0), 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-01-09 04:53:13,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:53:13,377 INFO L93 Difference]: Finished difference Result 4315 states and 6620 transitions. [2025-01-09 04:53:13,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:53:13,379 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 4 states have internal predecessors, (95), 0 states have call successors, (0), 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 95 [2025-01-09 04:53:13,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:53:13,384 INFO L225 Difference]: With dead ends: 4315 [2025-01-09 04:53:13,384 INFO L226 Difference]: Without dead ends: 2181 [2025-01-09 04:53:13,386 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:53:13,386 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 653 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 653 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:53:13,386 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [653 Valid, 131 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:53:13,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2181 states. [2025-01-09 04:53:13,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2181 to 2181. [2025-01-09 04:53:13,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2181 states, 2180 states have (on average 1.515137614678899) internal successors, (3303), 2180 states have internal predecessors, (3303), 0 states have call successors, (0), 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-01-09 04:53:13,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2181 states to 2181 states and 3303 transitions. [2025-01-09 04:53:13,418 INFO L78 Accepts]: Start accepts. Automaton has 2181 states and 3303 transitions. Word has length 95 [2025-01-09 04:53:13,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:53:13,418 INFO L471 AbstractCegarLoop]: Abstraction has 2181 states and 3303 transitions. [2025-01-09 04:53:13,419 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 4 states have internal predecessors, (95), 0 states have call successors, (0), 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-01-09 04:53:13,419 INFO L276 IsEmpty]: Start isEmpty. Operand 2181 states and 3303 transitions. [2025-01-09 04:53:13,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-01-09 04:53:13,420 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:53:13,420 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:53:13,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 04:53:13,420 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:53:13,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:53:13,420 INFO L85 PathProgramCache]: Analyzing trace with hash -824700769, now seen corresponding path program 1 times [2025-01-09 04:53:13,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:53:13,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395609776] [2025-01-09 04:53:13,420 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:53:13,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:53:13,432 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-01-09 04:53:13,441 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-01-09 04:53:13,441 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:53:13,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:53:13,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:53:13,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:53:13,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395609776] [2025-01-09 04:53:13,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395609776] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:53:13,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:53:13,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:53:13,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214138195] [2025-01-09 04:53:13,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:53:13,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:53:13,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:53:13,494 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:53:13,494 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:53:13,494 INFO L87 Difference]: Start difference. First operand 2181 states and 3303 transitions. Second operand has 5 states, 5 states have (on average 19.2) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 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-01-09 04:53:13,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:53:13,612 INFO L93 Difference]: Finished difference Result 4299 states and 6540 transitions. [2025-01-09 04:53:13,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:53:13,612 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 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 96 [2025-01-09 04:53:13,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:53:13,617 INFO L225 Difference]: With dead ends: 4299 [2025-01-09 04:53:13,617 INFO L226 Difference]: Without dead ends: 2181 [2025-01-09 04:53:13,618 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:53:13,619 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 601 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 601 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:53:13,619 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [601 Valid, 163 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:53:13,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2181 states. [2025-01-09 04:53:13,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2181 to 2181. [2025-01-09 04:53:13,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2181 states, 2180 states have (on average 1.5009174311926605) internal successors, (3272), 2180 states have internal predecessors, (3272), 0 states have call successors, (0), 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-01-09 04:53:13,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2181 states to 2181 states and 3272 transitions. [2025-01-09 04:53:13,678 INFO L78 Accepts]: Start accepts. Automaton has 2181 states and 3272 transitions. Word has length 96 [2025-01-09 04:53:13,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:53:13,679 INFO L471 AbstractCegarLoop]: Abstraction has 2181 states and 3272 transitions. [2025-01-09 04:53:13,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 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-01-09 04:53:13,679 INFO L276 IsEmpty]: Start isEmpty. Operand 2181 states and 3272 transitions. [2025-01-09 04:53:13,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-01-09 04:53:13,681 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:53:13,681 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:53:13,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 04:53:13,681 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:53:13,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:53:13,682 INFO L85 PathProgramCache]: Analyzing trace with hash -1248287654, now seen corresponding path program 1 times [2025-01-09 04:53:13,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:53:13,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447791259] [2025-01-09 04:53:13,682 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:53:13,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:53:13,695 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-01-09 04:53:13,708 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-01-09 04:53:13,708 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:53:13,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:53:13,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:53:13,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:53:13,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447791259] [2025-01-09 04:53:13,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447791259] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:53:13,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:53:13,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:53:13,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047073118] [2025-01-09 04:53:13,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:53:13,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:53:13,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:53:13,802 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:53:13,802 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:53:13,802 INFO L87 Difference]: Start difference. First operand 2181 states and 3272 transitions. Second operand has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 0 states have call successors, (0), 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-01-09 04:53:13,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:53:13,946 INFO L93 Difference]: Finished difference Result 4303 states and 6483 transitions. [2025-01-09 04:53:13,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:53:13,946 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 0 states have call successors, (0), 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 97 [2025-01-09 04:53:13,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:53:13,953 INFO L225 Difference]: With dead ends: 4303 [2025-01-09 04:53:13,953 INFO L226 Difference]: Without dead ends: 2181 [2025-01-09 04:53:13,959 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:53:13,959 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 606 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 606 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:53:13,959 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [606 Valid, 155 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:53:13,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2181 states. [2025-01-09 04:53:13,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2181 to 2181. [2025-01-09 04:53:14,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2181 states, 2180 states have (on average 1.486697247706422) internal successors, (3241), 2180 states have internal predecessors, (3241), 0 states have call successors, (0), 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-01-09 04:53:14,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2181 states to 2181 states and 3241 transitions. [2025-01-09 04:53:14,010 INFO L78 Accepts]: Start accepts. Automaton has 2181 states and 3241 transitions. Word has length 97 [2025-01-09 04:53:14,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:53:14,010 INFO L471 AbstractCegarLoop]: Abstraction has 2181 states and 3241 transitions. [2025-01-09 04:53:14,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 0 states have call successors, (0), 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-01-09 04:53:14,010 INFO L276 IsEmpty]: Start isEmpty. Operand 2181 states and 3241 transitions. [2025-01-09 04:53:14,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-01-09 04:53:14,011 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:53:14,012 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:53:14,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 04:53:14,012 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:53:14,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:53:14,012 INFO L85 PathProgramCache]: Analyzing trace with hash -1071880717, now seen corresponding path program 1 times [2025-01-09 04:53:14,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:53:14,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224452644] [2025-01-09 04:53:14,013 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:53:14,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:53:14,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-01-09 04:53:14,041 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-01-09 04:53:14,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:53:14,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:53:14,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:53:14,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:53:14,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224452644] [2025-01-09 04:53:14,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224452644] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:53:14,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:53:14,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:53:14,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85448840] [2025-01-09 04:53:14,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:53:14,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:53:14,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:53:14,116 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:53:14,116 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:53:14,117 INFO L87 Difference]: Start difference. First operand 2181 states and 3241 transitions. Second operand has 5 states, 5 states have (on average 19.6) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 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-01-09 04:53:14,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:53:14,252 INFO L93 Difference]: Finished difference Result 4307 states and 6426 transitions. [2025-01-09 04:53:14,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:53:14,252 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 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 98 [2025-01-09 04:53:14,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:53:14,263 INFO L225 Difference]: With dead ends: 4307 [2025-01-09 04:53:14,263 INFO L226 Difference]: Without dead ends: 2181 [2025-01-09 04:53:14,268 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:53:14,268 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 611 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 611 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:53:14,268 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [611 Valid, 147 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:53:14,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2181 states. [2025-01-09 04:53:14,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2181 to 2181. [2025-01-09 04:53:14,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2181 states, 2180 states have (on average 1.4724770642201834) internal successors, (3210), 2180 states have internal predecessors, (3210), 0 states have call successors, (0), 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-01-09 04:53:14,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2181 states to 2181 states and 3210 transitions. [2025-01-09 04:53:14,298 INFO L78 Accepts]: Start accepts. Automaton has 2181 states and 3210 transitions. Word has length 98 [2025-01-09 04:53:14,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:53:14,299 INFO L471 AbstractCegarLoop]: Abstraction has 2181 states and 3210 transitions. [2025-01-09 04:53:14,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 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-01-09 04:53:14,299 INFO L276 IsEmpty]: Start isEmpty. Operand 2181 states and 3210 transitions. [2025-01-09 04:53:14,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-01-09 04:53:14,300 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:53:14,300 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:53:14,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 04:53:14,300 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:53:14,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:53:14,301 INFO L85 PathProgramCache]: Analyzing trace with hash -2092778770, now seen corresponding path program 1 times [2025-01-09 04:53:14,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:53:14,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542749449] [2025-01-09 04:53:14,301 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:53:14,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:53:14,316 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-01-09 04:53:14,326 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-01-09 04:53:14,326 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:53:14,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:53:14,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:53:14,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:53:14,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542749449] [2025-01-09 04:53:14,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542749449] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:53:14,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:53:14,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:53:14,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096914608] [2025-01-09 04:53:14,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:53:14,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:53:14,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:53:14,389 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:53:14,389 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:53:14,389 INFO L87 Difference]: Start difference. First operand 2181 states and 3210 transitions. Second operand has 5 states, 5 states have (on average 19.8) internal successors, (99), 4 states have internal predecessors, (99), 0 states have call successors, (0), 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-01-09 04:53:14,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:53:14,510 INFO L93 Difference]: Finished difference Result 4295 states and 6352 transitions. [2025-01-09 04:53:14,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:53:14,511 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 4 states have internal predecessors, (99), 0 states have call successors, (0), 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 99 [2025-01-09 04:53:14,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:53:14,515 INFO L225 Difference]: With dead ends: 4295 [2025-01-09 04:53:14,515 INFO L226 Difference]: Without dead ends: 2181 [2025-01-09 04:53:14,520 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:53:14,521 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 569 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 569 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:53:14,521 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [569 Valid, 171 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:53:14,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2181 states. [2025-01-09 04:53:14,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2181 to 2181. [2025-01-09 04:53:14,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2181 states, 2180 states have (on average 1.4582568807339449) internal successors, (3179), 2180 states have internal predecessors, (3179), 0 states have call successors, (0), 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-01-09 04:53:14,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2181 states to 2181 states and 3179 transitions. [2025-01-09 04:53:14,551 INFO L78 Accepts]: Start accepts. Automaton has 2181 states and 3179 transitions. Word has length 99 [2025-01-09 04:53:14,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:53:14,551 INFO L471 AbstractCegarLoop]: Abstraction has 2181 states and 3179 transitions. [2025-01-09 04:53:14,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 4 states have internal predecessors, (99), 0 states have call successors, (0), 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-01-09 04:53:14,556 INFO L276 IsEmpty]: Start isEmpty. Operand 2181 states and 3179 transitions. [2025-01-09 04:53:14,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-01-09 04:53:14,557 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:53:14,557 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:53:14,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 04:53:14,557 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:53:14,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:53:14,557 INFO L85 PathProgramCache]: Analyzing trace with hash -1190401161, now seen corresponding path program 1 times [2025-01-09 04:53:14,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:53:14,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785749060] [2025-01-09 04:53:14,557 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:53:14,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:53:14,572 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-01-09 04:53:14,590 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-01-09 04:53:14,590 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:53:14,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:53:15,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:53:15,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:53:15,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785749060] [2025-01-09 04:53:15,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785749060] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:53:15,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:53:15,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 04:53:15,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038017965] [2025-01-09 04:53:15,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:53:15,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 04:53:15,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:53:15,173 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 04:53:15,173 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-01-09 04:53:15,173 INFO L87 Difference]: Start difference. First operand 2181 states and 3179 transitions. Second operand has 13 states, 13 states have (on average 7.6923076923076925) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 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-01-09 04:53:15,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:53:15,817 INFO L93 Difference]: Finished difference Result 6290 states and 9185 transitions. [2025-01-09 04:53:15,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 04:53:15,818 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 7.6923076923076925) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 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 100 [2025-01-09 04:53:15,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:53:15,832 INFO L225 Difference]: With dead ends: 6290 [2025-01-09 04:53:15,833 INFO L226 Difference]: Without dead ends: 4278 [2025-01-09 04:53:15,835 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=146, Invalid=454, Unknown=0, NotChecked=0, Total=600 [2025-01-09 04:53:15,839 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 783 mSDsluCounter, 553 mSDsCounter, 0 mSdLazyCounter, 631 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 783 SdHoareTripleChecker+Valid, 675 SdHoareTripleChecker+Invalid, 644 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 631 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 04:53:15,840 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [783 Valid, 675 Invalid, 644 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 631 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 04:53:15,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4278 states. [2025-01-09 04:53:15,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4278 to 2181. [2025-01-09 04:53:15,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2181 states, 2180 states have (on average 1.4555045871559633) internal successors, (3173), 2180 states have internal predecessors, (3173), 0 states have call successors, (0), 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-01-09 04:53:15,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2181 states to 2181 states and 3173 transitions. [2025-01-09 04:53:15,874 INFO L78 Accepts]: Start accepts. Automaton has 2181 states and 3173 transitions. Word has length 100 [2025-01-09 04:53:15,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:53:15,874 INFO L471 AbstractCegarLoop]: Abstraction has 2181 states and 3173 transitions. [2025-01-09 04:53:15,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 7.6923076923076925) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 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-01-09 04:53:15,874 INFO L276 IsEmpty]: Start isEmpty. Operand 2181 states and 3173 transitions. [2025-01-09 04:53:15,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-01-09 04:53:15,875 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:53:15,875 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:53:15,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 04:53:15,875 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:53:15,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:53:15,875 INFO L85 PathProgramCache]: Analyzing trace with hash -1807427751, now seen corresponding path program 1 times [2025-01-09 04:53:15,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:53:15,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387519299] [2025-01-09 04:53:15,876 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:53:15,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:53:15,887 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-01-09 04:53:15,918 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-01-09 04:53:15,919 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:53:15,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:53:16,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:53:16,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:53:16,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387519299] [2025-01-09 04:53:16,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387519299] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:53:16,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:53:16,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 04:53:16,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497874304] [2025-01-09 04:53:16,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:53:16,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 04:53:16,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:53:16,210 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 04:53:16,211 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-01-09 04:53:16,211 INFO L87 Difference]: Start difference. First operand 2181 states and 3173 transitions. Second operand has 13 states, 13 states have (on average 7.769230769230769) internal successors, (101), 12 states have internal predecessors, (101), 0 states have call successors, (0), 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-01-09 04:53:16,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:53:16,735 INFO L93 Difference]: Finished difference Result 6365 states and 9289 transitions. [2025-01-09 04:53:16,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 04:53:16,736 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 7.769230769230769) internal successors, (101), 12 states have internal predecessors, (101), 0 states have call successors, (0), 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 101 [2025-01-09 04:53:16,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:53:16,742 INFO L225 Difference]: With dead ends: 6365 [2025-01-09 04:53:16,742 INFO L226 Difference]: Without dead ends: 4308 [2025-01-09 04:53:16,745 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=146, Invalid=454, Unknown=0, NotChecked=0, Total=600 [2025-01-09 04:53:16,745 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 1165 mSDsluCounter, 637 mSDsCounter, 0 mSdLazyCounter, 726 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1165 SdHoareTripleChecker+Valid, 759 SdHoareTripleChecker+Invalid, 736 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 726 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 04:53:16,745 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1165 Valid, 759 Invalid, 736 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 726 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 04:53:16,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4308 states. [2025-01-09 04:53:16,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4308 to 2181. [2025-01-09 04:53:16,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2181 states, 2180 states have (on average 1.4536697247706423) internal successors, (3169), 2180 states have internal predecessors, (3169), 0 states have call successors, (0), 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-01-09 04:53:16,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2181 states to 2181 states and 3169 transitions. [2025-01-09 04:53:16,813 INFO L78 Accepts]: Start accepts. Automaton has 2181 states and 3169 transitions. Word has length 101 [2025-01-09 04:53:16,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:53:16,813 INFO L471 AbstractCegarLoop]: Abstraction has 2181 states and 3169 transitions. [2025-01-09 04:53:16,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 7.769230769230769) internal successors, (101), 12 states have internal predecessors, (101), 0 states have call successors, (0), 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-01-09 04:53:16,813 INFO L276 IsEmpty]: Start isEmpty. Operand 2181 states and 3169 transitions. [2025-01-09 04:53:16,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-01-09 04:53:16,814 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:53:16,814 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:53:16,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 04:53:16,814 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:53:16,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:53:16,815 INFO L85 PathProgramCache]: Analyzing trace with hash -721716891, now seen corresponding path program 1 times [2025-01-09 04:53:16,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:53:16,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086071351] [2025-01-09 04:53:16,815 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:53:16,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:53:16,827 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-01-09 04:53:16,842 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-01-09 04:53:16,843 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:53:16,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:53:17,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:53:17,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:53:17,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086071351] [2025-01-09 04:53:17,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086071351] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:53:17,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:53:17,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 04:53:17,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085289401] [2025-01-09 04:53:17,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:53:17,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 04:53:17,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:53:17,172 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 04:53:17,172 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-01-09 04:53:17,172 INFO L87 Difference]: Start difference. First operand 2181 states and 3169 transitions. Second operand has 13 states, 13 states have (on average 7.769230769230769) internal successors, (101), 12 states have internal predecessors, (101), 0 states have call successors, (0), 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-01-09 04:53:17,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:53:17,707 INFO L93 Difference]: Finished difference Result 6380 states and 9305 transitions. [2025-01-09 04:53:17,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 04:53:17,708 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 7.769230769230769) internal successors, (101), 12 states have internal predecessors, (101), 0 states have call successors, (0), 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 101 [2025-01-09 04:53:17,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:53:17,713 INFO L225 Difference]: With dead ends: 6380 [2025-01-09 04:53:17,713 INFO L226 Difference]: Without dead ends: 4313 [2025-01-09 04:53:17,715 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=146, Invalid=454, Unknown=0, NotChecked=0, Total=600 [2025-01-09 04:53:17,716 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 1056 mSDsluCounter, 642 mSDsCounter, 0 mSdLazyCounter, 726 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1056 SdHoareTripleChecker+Valid, 764 SdHoareTripleChecker+Invalid, 738 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 726 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 04:53:17,716 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1056 Valid, 764 Invalid, 738 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 726 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 04:53:17,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4313 states. [2025-01-09 04:53:17,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4313 to 2181. [2025-01-09 04:53:17,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2181 states, 2180 states have (on average 1.4527522935779817) internal successors, (3167), 2180 states have internal predecessors, (3167), 0 states have call successors, (0), 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-01-09 04:53:17,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2181 states to 2181 states and 3167 transitions. [2025-01-09 04:53:17,776 INFO L78 Accepts]: Start accepts. Automaton has 2181 states and 3167 transitions. Word has length 101 [2025-01-09 04:53:17,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:53:17,776 INFO L471 AbstractCegarLoop]: Abstraction has 2181 states and 3167 transitions. [2025-01-09 04:53:17,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 7.769230769230769) internal successors, (101), 12 states have internal predecessors, (101), 0 states have call successors, (0), 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-01-09 04:53:17,776 INFO L276 IsEmpty]: Start isEmpty. Operand 2181 states and 3167 transitions. [2025-01-09 04:53:17,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-01-09 04:53:17,777 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:53:17,777 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:53:17,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 04:53:17,778 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:53:17,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:53:17,778 INFO L85 PathProgramCache]: Analyzing trace with hash -1570910188, now seen corresponding path program 1 times [2025-01-09 04:53:17,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:53:17,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84636136] [2025-01-09 04:53:17,778 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:53:17,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:53:17,796 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-01-09 04:53:17,812 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-01-09 04:53:17,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:53:17,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:53:18,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:53:18,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:53:18,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84636136] [2025-01-09 04:53:18,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84636136] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:53:18,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:53:18,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:53:18,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931974731] [2025-01-09 04:53:18,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:53:18,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 04:53:18,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:53:18,042 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 04:53:18,042 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:53:18,043 INFO L87 Difference]: Start difference. First operand 2181 states and 3167 transitions. Second operand has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 8 states have internal predecessors, (102), 0 states have call successors, (0), 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-01-09 04:53:18,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:53:18,333 INFO L93 Difference]: Finished difference Result 6235 states and 9113 transitions. [2025-01-09 04:53:18,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 04:53:18,334 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 8 states have internal predecessors, (102), 0 states have call successors, (0), 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 102 [2025-01-09 04:53:18,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:53:18,338 INFO L225 Difference]: With dead ends: 6235 [2025-01-09 04:53:18,339 INFO L226 Difference]: Without dead ends: 4163 [2025-01-09 04:53:18,341 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2025-01-09 04:53:18,341 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 770 mSDsluCounter, 424 mSDsCounter, 0 mSdLazyCounter, 451 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 770 SdHoareTripleChecker+Valid, 546 SdHoareTripleChecker+Invalid, 454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:53:18,341 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [770 Valid, 546 Invalid, 454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 451 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 04:53:18,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4163 states. [2025-01-09 04:53:18,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4163 to 2181. [2025-01-09 04:53:18,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2181 states, 2180 states have (on average 1.4522935779816515) internal successors, (3166), 2180 states have internal predecessors, (3166), 0 states have call successors, (0), 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-01-09 04:53:18,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2181 states to 2181 states and 3166 transitions. [2025-01-09 04:53:18,371 INFO L78 Accepts]: Start accepts. Automaton has 2181 states and 3166 transitions. Word has length 102 [2025-01-09 04:53:18,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:53:18,371 INFO L471 AbstractCegarLoop]: Abstraction has 2181 states and 3166 transitions. [2025-01-09 04:53:18,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 8 states have internal predecessors, (102), 0 states have call successors, (0), 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-01-09 04:53:18,372 INFO L276 IsEmpty]: Start isEmpty. Operand 2181 states and 3166 transitions. [2025-01-09 04:53:18,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-01-09 04:53:18,372 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:53:18,373 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:53:18,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 04:53:18,373 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:53:18,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:53:18,373 INFO L85 PathProgramCache]: Analyzing trace with hash 755224923, now seen corresponding path program 1 times [2025-01-09 04:53:18,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:53:18,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806222396] [2025-01-09 04:53:18,373 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:53:18,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:53:18,385 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-01-09 04:53:18,418 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-01-09 04:53:18,421 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:53:18,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:53:18,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:53:18,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:53:18,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806222396] [2025-01-09 04:53:18,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806222396] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:53:18,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:53:18,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 04:53:18,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966551315] [2025-01-09 04:53:18,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:53:18,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 04:53:18,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:53:18,653 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 04:53:18,653 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-01-09 04:53:18,654 INFO L87 Difference]: Start difference. First operand 2181 states and 3166 transitions. Second operand has 10 states, 10 states have (on average 10.3) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 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-01-09 04:53:19,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:53:19,168 INFO L93 Difference]: Finished difference Result 6335 states and 9234 transitions. [2025-01-09 04:53:19,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 04:53:19,168 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 10.3) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 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 103 [2025-01-09 04:53:19,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:53:19,174 INFO L225 Difference]: With dead ends: 6335 [2025-01-09 04:53:19,175 INFO L226 Difference]: Without dead ends: 4298 [2025-01-09 04:53:19,177 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2025-01-09 04:53:19,179 INFO L435 NwaCegarLoop]: 190 mSDtfsCounter, 810 mSDsluCounter, 752 mSDsCounter, 0 mSdLazyCounter, 846 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 810 SdHoareTripleChecker+Valid, 942 SdHoareTripleChecker+Invalid, 852 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 846 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 04:53:19,179 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [810 Valid, 942 Invalid, 852 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 846 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 04:53:19,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4298 states. [2025-01-09 04:53:19,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4298 to 2181. [2025-01-09 04:53:19,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2181 states, 2180 states have (on average 1.45) internal successors, (3161), 2180 states have internal predecessors, (3161), 0 states have call successors, (0), 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-01-09 04:53:19,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2181 states to 2181 states and 3161 transitions. [2025-01-09 04:53:19,211 INFO L78 Accepts]: Start accepts. Automaton has 2181 states and 3161 transitions. Word has length 103 [2025-01-09 04:53:19,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:53:19,211 INFO L471 AbstractCegarLoop]: Abstraction has 2181 states and 3161 transitions. [2025-01-09 04:53:19,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.3) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 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-01-09 04:53:19,211 INFO L276 IsEmpty]: Start isEmpty. Operand 2181 states and 3161 transitions. [2025-01-09 04:53:19,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-01-09 04:53:19,213 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:53:19,213 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:53:19,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 04:53:19,213 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:53:19,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:53:19,213 INFO L85 PathProgramCache]: Analyzing trace with hash 1394810664, now seen corresponding path program 1 times [2025-01-09 04:53:19,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:53:19,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963492071] [2025-01-09 04:53:19,214 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:53:19,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:53:19,226 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-01-09 04:53:19,257 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-01-09 04:53:19,257 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:53:19,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:53:19,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:53:19,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:53:19,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963492071] [2025-01-09 04:53:19,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963492071] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:53:19,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:53:19,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 04:53:19,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279618237] [2025-01-09 04:53:19,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:53:19,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 04:53:19,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:53:19,655 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 04:53:19,655 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2025-01-09 04:53:19,655 INFO L87 Difference]: Start difference. First operand 2181 states and 3161 transitions. Second operand has 13 states, 13 states have (on average 8.0) internal successors, (104), 12 states have internal predecessors, (104), 0 states have call successors, (0), 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-01-09 04:53:20,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:53:20,387 INFO L93 Difference]: Finished difference Result 11328 states and 16379 transitions. [2025-01-09 04:53:20,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-01-09 04:53:20,387 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 8.0) internal successors, (104), 12 states have internal predecessors, (104), 0 states have call successors, (0), 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 104 [2025-01-09 04:53:20,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:53:20,400 INFO L225 Difference]: With dead ends: 11328 [2025-01-09 04:53:20,401 INFO L226 Difference]: Without dead ends: 9346 [2025-01-09 04:53:20,405 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=225, Invalid=645, Unknown=0, NotChecked=0, Total=870 [2025-01-09 04:53:20,406 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 2481 mSDsluCounter, 696 mSDsCounter, 0 mSdLazyCounter, 746 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2481 SdHoareTripleChecker+Valid, 817 SdHoareTripleChecker+Invalid, 782 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 746 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 04:53:20,407 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2481 Valid, 817 Invalid, 782 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 746 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 04:53:20,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9346 states. [2025-01-09 04:53:20,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9346 to 2199. [2025-01-09 04:53:20,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2199 states, 2198 states have (on average 1.4458598726114649) internal successors, (3178), 2198 states have internal predecessors, (3178), 0 states have call successors, (0), 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-01-09 04:53:20,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2199 states to 2199 states and 3178 transitions. [2025-01-09 04:53:20,479 INFO L78 Accepts]: Start accepts. Automaton has 2199 states and 3178 transitions. Word has length 104 [2025-01-09 04:53:20,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:53:20,479 INFO L471 AbstractCegarLoop]: Abstraction has 2199 states and 3178 transitions. [2025-01-09 04:53:20,479 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 8.0) internal successors, (104), 12 states have internal predecessors, (104), 0 states have call successors, (0), 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-01-09 04:53:20,479 INFO L276 IsEmpty]: Start isEmpty. Operand 2199 states and 3178 transitions. [2025-01-09 04:53:20,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-01-09 04:53:20,484 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:53:20,485 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:53:20,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 04:53:20,485 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:53:20,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:53:20,486 INFO L85 PathProgramCache]: Analyzing trace with hash -294873708, now seen corresponding path program 1 times [2025-01-09 04:53:20,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:53:20,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026703073] [2025-01-09 04:53:20,486 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:53:20,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:53:20,517 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-01-09 04:53:20,568 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-01-09 04:53:20,571 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:53:20,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:53:20,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:53:20,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:53:20,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026703073] [2025-01-09 04:53:20,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026703073] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:53:20,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:53:20,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 04:53:20,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853802924] [2025-01-09 04:53:20,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:53:20,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 04:53:20,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:53:20,869 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 04:53:20,869 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-01-09 04:53:20,869 INFO L87 Difference]: Start difference. First operand 2199 states and 3178 transitions. Second operand has 10 states, 10 states have (on average 10.5) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 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-01-09 04:53:21,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:53:21,349 INFO L93 Difference]: Finished difference Result 6237 states and 9074 transitions. [2025-01-09 04:53:21,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 04:53:21,349 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 10.5) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 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 105 [2025-01-09 04:53:21,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:53:21,354 INFO L225 Difference]: With dead ends: 6237 [2025-01-09 04:53:21,354 INFO L226 Difference]: Without dead ends: 4256 [2025-01-09 04:53:21,356 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=105, Invalid=315, Unknown=0, NotChecked=0, Total=420 [2025-01-09 04:53:21,357 INFO L435 NwaCegarLoop]: 187 mSDtfsCounter, 675 mSDsluCounter, 867 mSDsCounter, 0 mSdLazyCounter, 883 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 675 SdHoareTripleChecker+Valid, 1054 SdHoareTripleChecker+Invalid, 888 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 883 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 04:53:21,357 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [675 Valid, 1054 Invalid, 888 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 883 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 04:53:21,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4256 states. [2025-01-09 04:53:21,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4256 to 2181. [2025-01-09 04:53:21,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2181 states, 2180 states have (on average 1.4467889908256881) internal successors, (3154), 2180 states have internal predecessors, (3154), 0 states have call successors, (0), 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-01-09 04:53:21,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2181 states to 2181 states and 3154 transitions. [2025-01-09 04:53:21,380 INFO L78 Accepts]: Start accepts. Automaton has 2181 states and 3154 transitions. Word has length 105 [2025-01-09 04:53:21,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:53:21,380 INFO L471 AbstractCegarLoop]: Abstraction has 2181 states and 3154 transitions. [2025-01-09 04:53:21,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.5) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 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-01-09 04:53:21,381 INFO L276 IsEmpty]: Start isEmpty. Operand 2181 states and 3154 transitions. [2025-01-09 04:53:21,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-01-09 04:53:21,381 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:53:21,381 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:53:21,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-09 04:53:21,382 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:53:21,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:53:21,382 INFO L85 PathProgramCache]: Analyzing trace with hash 1475383422, now seen corresponding path program 1 times [2025-01-09 04:53:21,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:53:21,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228555790] [2025-01-09 04:53:21,382 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:53:21,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:53:21,393 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-01-09 04:53:21,414 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-01-09 04:53:21,414 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:53:21,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:53:21,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:53:21,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:53:21,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228555790] [2025-01-09 04:53:21,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228555790] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:53:21,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:53:21,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-01-09 04:53:21,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443623922] [2025-01-09 04:53:21,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:53:21,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 04:53:21,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:53:21,997 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 04:53:21,997 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2025-01-09 04:53:21,997 INFO L87 Difference]: Start difference. First operand 2181 states and 3154 transitions. Second operand has 14 states, 14 states have (on average 7.5) internal successors, (105), 14 states have internal predecessors, (105), 0 states have call successors, (0), 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-01-09 04:53:22,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:53:22,770 INFO L93 Difference]: Finished difference Result 8879 states and 12958 transitions. [2025-01-09 04:53:22,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-09 04:53:22,771 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 7.5) internal successors, (105), 14 states have internal predecessors, (105), 0 states have call successors, (0), 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 105 [2025-01-09 04:53:22,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:53:22,782 INFO L225 Difference]: With dead ends: 8879 [2025-01-09 04:53:22,782 INFO L226 Difference]: Without dead ends: 8309 [2025-01-09 04:53:22,785 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=167, Invalid=535, Unknown=0, NotChecked=0, Total=702 [2025-01-09 04:53:22,785 INFO L435 NwaCegarLoop]: 571 mSDtfsCounter, 816 mSDsluCounter, 5050 mSDsCounter, 0 mSdLazyCounter, 727 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 816 SdHoareTripleChecker+Valid, 5621 SdHoareTripleChecker+Invalid, 731 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 727 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 04:53:22,786 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [816 Valid, 5621 Invalid, 731 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 727 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 04:53:22,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8309 states. [2025-01-09 04:53:22,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8309 to 2155. [2025-01-09 04:53:22,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2155 states, 2154 states have (on average 1.44661095636026) internal successors, (3116), 2154 states have internal predecessors, (3116), 0 states have call successors, (0), 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-01-09 04:53:22,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2155 states to 2155 states and 3116 transitions. [2025-01-09 04:53:22,828 INFO L78 Accepts]: Start accepts. Automaton has 2155 states and 3116 transitions. Word has length 105 [2025-01-09 04:53:22,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:53:22,828 INFO L471 AbstractCegarLoop]: Abstraction has 2155 states and 3116 transitions. [2025-01-09 04:53:22,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 7.5) internal successors, (105), 14 states have internal predecessors, (105), 0 states have call successors, (0), 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-01-09 04:53:22,828 INFO L276 IsEmpty]: Start isEmpty. Operand 2155 states and 3116 transitions. [2025-01-09 04:53:22,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-01-09 04:53:22,829 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:53:22,829 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:53:22,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-09 04:53:22,830 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:53:22,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:53:22,830 INFO L85 PathProgramCache]: Analyzing trace with hash 1499355903, now seen corresponding path program 1 times [2025-01-09 04:53:22,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:53:22,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68616151] [2025-01-09 04:53:22,830 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:53:22,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:53:22,842 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-01-09 04:53:22,867 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-01-09 04:53:22,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:53:22,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:53:23,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:53:23,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:53:23,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68616151] [2025-01-09 04:53:23,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68616151] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:53:23,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:53:23,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-01-09 04:53:23,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552592863] [2025-01-09 04:53:23,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:53:23,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 04:53:23,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:53:23,344 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 04:53:23,344 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2025-01-09 04:53:23,344 INFO L87 Difference]: Start difference. First operand 2155 states and 3116 transitions. Second operand has 14 states, 14 states have (on average 7.5) internal successors, (105), 14 states have internal predecessors, (105), 0 states have call successors, (0), 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-01-09 04:53:24,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:53:24,030 INFO L93 Difference]: Finished difference Result 8750 states and 12777 transitions. [2025-01-09 04:53:24,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-09 04:53:24,031 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 7.5) internal successors, (105), 14 states have internal predecessors, (105), 0 states have call successors, (0), 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 105 [2025-01-09 04:53:24,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:53:24,043 INFO L225 Difference]: With dead ends: 8750 [2025-01-09 04:53:24,043 INFO L226 Difference]: Without dead ends: 8200 [2025-01-09 04:53:24,045 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=167, Invalid=535, Unknown=0, NotChecked=0, Total=702 [2025-01-09 04:53:24,046 INFO L435 NwaCegarLoop]: 528 mSDtfsCounter, 1148 mSDsluCounter, 4044 mSDsCounter, 0 mSdLazyCounter, 650 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1148 SdHoareTripleChecker+Valid, 4572 SdHoareTripleChecker+Invalid, 655 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 650 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 04:53:24,046 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1148 Valid, 4572 Invalid, 655 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 650 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 04:53:24,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8200 states. [2025-01-09 04:53:24,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8200 to 2144. [2025-01-09 04:53:24,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2144 states, 2143 states have (on average 1.4451703219785348) internal successors, (3097), 2143 states have internal predecessors, (3097), 0 states have call successors, (0), 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-01-09 04:53:24,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2144 states to 2144 states and 3097 transitions. [2025-01-09 04:53:24,084 INFO L78 Accepts]: Start accepts. Automaton has 2144 states and 3097 transitions. Word has length 105 [2025-01-09 04:53:24,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:53:24,084 INFO L471 AbstractCegarLoop]: Abstraction has 2144 states and 3097 transitions. [2025-01-09 04:53:24,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 7.5) internal successors, (105), 14 states have internal predecessors, (105), 0 states have call successors, (0), 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-01-09 04:53:24,084 INFO L276 IsEmpty]: Start isEmpty. Operand 2144 states and 3097 transitions. [2025-01-09 04:53:24,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-01-09 04:53:24,085 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:53:24,085 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:53:24,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-01-09 04:53:24,085 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:53:24,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:53:24,087 INFO L85 PathProgramCache]: Analyzing trace with hash -285463969, now seen corresponding path program 1 times [2025-01-09 04:53:24,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:53:24,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177159706] [2025-01-09 04:53:24,087 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:53:24,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:53:24,097 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-01-09 04:53:24,123 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-01-09 04:53:24,124 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:53:24,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:53:24,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:53:24,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:53:24,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177159706] [2025-01-09 04:53:24,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177159706] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:53:24,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:53:24,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 04:53:24,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553737344] [2025-01-09 04:53:24,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:53:24,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 04:53:24,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:53:24,534 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 04:53:24,534 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2025-01-09 04:53:24,534 INFO L87 Difference]: Start difference. First operand 2144 states and 3097 transitions. Second operand has 13 states, 13 states have (on average 8.076923076923077) internal successors, (105), 13 states have internal predecessors, (105), 0 states have call successors, (0), 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-01-09 04:53:24,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:53:24,999 INFO L93 Difference]: Finished difference Result 4672 states and 6803 transitions. [2025-01-09 04:53:24,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 04:53:24,999 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 8.076923076923077) internal successors, (105), 13 states have internal predecessors, (105), 0 states have call successors, (0), 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 105 [2025-01-09 04:53:25,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:53:25,006 INFO L225 Difference]: With dead ends: 4672 [2025-01-09 04:53:25,006 INFO L226 Difference]: Without dead ends: 4142 [2025-01-09 04:53:25,007 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=142, Invalid=458, Unknown=0, NotChecked=0, Total=600 [2025-01-09 04:53:25,008 INFO L435 NwaCegarLoop]: 193 mSDtfsCounter, 1112 mSDsluCounter, 1123 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1112 SdHoareTripleChecker+Valid, 1316 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:53:25,009 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1112 Valid, 1316 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 04:53:25,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4142 states. [2025-01-09 04:53:25,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4142 to 2143. [2025-01-09 04:53:25,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2143 states, 2142 states have (on average 1.4430438842203548) internal successors, (3091), 2142 states have internal predecessors, (3091), 0 states have call successors, (0), 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-01-09 04:53:25,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2143 states to 2143 states and 3091 transitions. [2025-01-09 04:53:25,033 INFO L78 Accepts]: Start accepts. Automaton has 2143 states and 3091 transitions. Word has length 105 [2025-01-09 04:53:25,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:53:25,034 INFO L471 AbstractCegarLoop]: Abstraction has 2143 states and 3091 transitions. [2025-01-09 04:53:25,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 8.076923076923077) internal successors, (105), 13 states have internal predecessors, (105), 0 states have call successors, (0), 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-01-09 04:53:25,034 INFO L276 IsEmpty]: Start isEmpty. Operand 2143 states and 3091 transitions. [2025-01-09 04:53:25,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-01-09 04:53:25,034 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:53:25,034 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:53:25,035 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-01-09 04:53:25,035 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:53:25,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:53:25,035 INFO L85 PathProgramCache]: Analyzing trace with hash -344221858, now seen corresponding path program 1 times [2025-01-09 04:53:25,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:53:25,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464602787] [2025-01-09 04:53:25,035 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:53:25,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:53:25,046 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-01-09 04:53:25,069 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-01-09 04:53:25,069 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:53:25,069 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:53:25,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:53:25,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:53:25,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464602787] [2025-01-09 04:53:25,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464602787] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:53:25,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:53:25,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 04:53:25,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971659120] [2025-01-09 04:53:25,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:53:25,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 04:53:25,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:53:25,452 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 04:53:25,452 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2025-01-09 04:53:25,452 INFO L87 Difference]: Start difference. First operand 2143 states and 3091 transitions. Second operand has 13 states, 13 states have (on average 8.076923076923077) internal successors, (105), 13 states have internal predecessors, (105), 0 states have call successors, (0), 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-01-09 04:53:25,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:53:25,935 INFO L93 Difference]: Finished difference Result 4706 states and 6839 transitions. [2025-01-09 04:53:25,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 04:53:25,935 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 8.076923076923077) internal successors, (105), 13 states have internal predecessors, (105), 0 states have call successors, (0), 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 105 [2025-01-09 04:53:25,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:53:25,940 INFO L225 Difference]: With dead ends: 4706 [2025-01-09 04:53:25,941 INFO L226 Difference]: Without dead ends: 4146 [2025-01-09 04:53:25,942 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=142, Invalid=458, Unknown=0, NotChecked=0, Total=600 [2025-01-09 04:53:25,942 INFO L435 NwaCegarLoop]: 302 mSDtfsCounter, 803 mSDsluCounter, 1845 mSDsCounter, 0 mSdLazyCounter, 365 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 803 SdHoareTripleChecker+Valid, 2147 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:53:25,942 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [803 Valid, 2147 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 365 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 04:53:25,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4146 states. [2025-01-09 04:53:25,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4146 to 2117. [2025-01-09 04:53:25,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2117 states, 2116 states have (on average 1.444234404536862) internal successors, (3056), 2116 states have internal predecessors, (3056), 0 states have call successors, (0), 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-01-09 04:53:25,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2117 states to 2117 states and 3056 transitions. [2025-01-09 04:53:25,962 INFO L78 Accepts]: Start accepts. Automaton has 2117 states and 3056 transitions. Word has length 105 [2025-01-09 04:53:25,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:53:25,963 INFO L471 AbstractCegarLoop]: Abstraction has 2117 states and 3056 transitions. [2025-01-09 04:53:25,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 8.076923076923077) internal successors, (105), 13 states have internal predecessors, (105), 0 states have call successors, (0), 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-01-09 04:53:25,963 INFO L276 IsEmpty]: Start isEmpty. Operand 2117 states and 3056 transitions. [2025-01-09 04:53:25,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-01-09 04:53:25,964 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:53:25,964 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:53:25,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-01-09 04:53:25,967 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:53:25,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:53:25,968 INFO L85 PathProgramCache]: Analyzing trace with hash 716052892, now seen corresponding path program 1 times [2025-01-09 04:53:25,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:53:25,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395057613] [2025-01-09 04:53:25,968 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:53:25,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:53:25,978 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-01-09 04:53:25,991 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-01-09 04:53:25,991 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:53:25,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:53:26,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:53:26,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:53:26,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395057613] [2025-01-09 04:53:26,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395057613] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:53:26,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:53:26,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 04:53:26,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374456132] [2025-01-09 04:53:26,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:53:26,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 04:53:26,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:53:26,406 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 04:53:26,406 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2025-01-09 04:53:26,406 INFO L87 Difference]: Start difference. First operand 2117 states and 3056 transitions. Second operand has 12 states, 12 states have (on average 8.75) internal successors, (105), 12 states have internal predecessors, (105), 0 states have call successors, (0), 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-01-09 04:53:26,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:53:26,898 INFO L93 Difference]: Finished difference Result 8606 states and 12568 transitions. [2025-01-09 04:53:26,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 04:53:26,899 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 8.75) internal successors, (105), 12 states have internal predecessors, (105), 0 states have call successors, (0), 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 105 [2025-01-09 04:53:26,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:53:26,909 INFO L225 Difference]: With dead ends: 8606 [2025-01-09 04:53:26,909 INFO L226 Difference]: Without dead ends: 8046 [2025-01-09 04:53:26,912 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=135, Invalid=327, Unknown=0, NotChecked=0, Total=462 [2025-01-09 04:53:26,913 INFO L435 NwaCegarLoop]: 500 mSDtfsCounter, 1020 mSDsluCounter, 2431 mSDsCounter, 0 mSdLazyCounter, 427 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1020 SdHoareTripleChecker+Valid, 2931 SdHoareTripleChecker+Invalid, 431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 427 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:53:26,913 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1020 Valid, 2931 Invalid, 431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 427 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 04:53:26,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8046 states. [2025-01-09 04:53:26,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8046 to 2085. [2025-01-09 04:53:26,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2085 states, 2084 states have (on average 1.4472168905950096) internal successors, (3016), 2084 states have internal predecessors, (3016), 0 states have call successors, (0), 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-01-09 04:53:26,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2085 states to 2085 states and 3016 transitions. [2025-01-09 04:53:26,952 INFO L78 Accepts]: Start accepts. Automaton has 2085 states and 3016 transitions. Word has length 105 [2025-01-09 04:53:26,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:53:26,952 INFO L471 AbstractCegarLoop]: Abstraction has 2085 states and 3016 transitions. [2025-01-09 04:53:26,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.75) internal successors, (105), 12 states have internal predecessors, (105), 0 states have call successors, (0), 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-01-09 04:53:26,952 INFO L276 IsEmpty]: Start isEmpty. Operand 2085 states and 3016 transitions. [2025-01-09 04:53:26,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-01-09 04:53:26,953 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:53:26,953 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:53:26,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-01-09 04:53:26,953 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:53:26,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:53:26,953 INFO L85 PathProgramCache]: Analyzing trace with hash 392357586, now seen corresponding path program 1 times [2025-01-09 04:53:26,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:53:26,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096265355] [2025-01-09 04:53:26,954 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:53:26,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:53:26,963 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-01-09 04:53:26,981 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-01-09 04:53:26,982 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:53:26,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:53:28,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:53:28,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:53:28,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096265355] [2025-01-09 04:53:28,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096265355] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:53:28,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:53:28,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [37] imperfect sequences [] total 37 [2025-01-09 04:53:28,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12221040] [2025-01-09 04:53:28,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:53:28,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-01-09 04:53:28,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:53:28,936 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-01-09 04:53:28,936 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=1255, Unknown=0, NotChecked=0, Total=1332 [2025-01-09 04:53:28,937 INFO L87 Difference]: Start difference. First operand 2085 states and 3016 transitions. Second operand has 37 states, 37 states have (on average 2.864864864864865) internal successors, (106), 37 states have internal predecessors, (106), 0 states have call successors, (0), 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-01-09 04:53:36,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:53:36,871 INFO L93 Difference]: Finished difference Result 16043 states and 23464 transitions. [2025-01-09 04:53:36,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2025-01-09 04:53:36,872 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 2.864864864864865) internal successors, (106), 37 states have internal predecessors, (106), 0 states have call successors, (0), 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 106 [2025-01-09 04:53:36,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:53:36,887 INFO L225 Difference]: With dead ends: 16043 [2025-01-09 04:53:36,888 INFO L226 Difference]: Without dead ends: 14066 [2025-01-09 04:53:36,893 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 544 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=640, Invalid=4190, Unknown=0, NotChecked=0, Total=4830 [2025-01-09 04:53:36,894 INFO L435 NwaCegarLoop]: 648 mSDtfsCounter, 1913 mSDsluCounter, 14690 mSDsCounter, 0 mSdLazyCounter, 9748 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1913 SdHoareTripleChecker+Valid, 15338 SdHoareTripleChecker+Invalid, 9764 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 9748 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:53:36,894 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1913 Valid, 15338 Invalid, 9764 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 9748 Invalid, 0 Unknown, 0 Unchecked, 5.2s Time] [2025-01-09 04:53:36,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14066 states. [2025-01-09 04:53:37,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14066 to 2110. [2025-01-09 04:53:37,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2110 states, 2109 states have (on average 1.4442863916548128) internal successors, (3046), 2109 states have internal predecessors, (3046), 0 states have call successors, (0), 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-01-09 04:53:37,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2110 states to 2110 states and 3046 transitions. [2025-01-09 04:53:37,051 INFO L78 Accepts]: Start accepts. Automaton has 2110 states and 3046 transitions. Word has length 106 [2025-01-09 04:53:37,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:53:37,051 INFO L471 AbstractCegarLoop]: Abstraction has 2110 states and 3046 transitions. [2025-01-09 04:53:37,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 2.864864864864865) internal successors, (106), 37 states have internal predecessors, (106), 0 states have call successors, (0), 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-01-09 04:53:37,055 INFO L276 IsEmpty]: Start isEmpty. Operand 2110 states and 3046 transitions. [2025-01-09 04:53:37,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-01-09 04:53:37,055 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:53:37,055 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:53:37,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-01-09 04:53:37,055 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:53:37,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:53:37,056 INFO L85 PathProgramCache]: Analyzing trace with hash -835958753, now seen corresponding path program 1 times [2025-01-09 04:53:37,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:53:37,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323172029] [2025-01-09 04:53:37,056 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:53:37,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:53:37,069 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-01-09 04:53:37,115 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-01-09 04:53:37,119 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:53:37,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:53:37,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:53:37,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:53:37,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323172029] [2025-01-09 04:53:37,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323172029] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:53:37,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:53:37,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-01-09 04:53:37,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065980873] [2025-01-09 04:53:37,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:53:37,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 04:53:37,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:53:37,763 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 04:53:37,763 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2025-01-09 04:53:37,764 INFO L87 Difference]: Start difference. First operand 2110 states and 3046 transitions. Second operand has 14 states, 14 states have (on average 7.642857142857143) internal successors, (107), 14 states have internal predecessors, (107), 0 states have call successors, (0), 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-01-09 04:53:38,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:53:38,450 INFO L93 Difference]: Finished difference Result 8586 states and 12543 transitions. [2025-01-09 04:53:38,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-09 04:53:38,450 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 7.642857142857143) internal successors, (107), 14 states have internal predecessors, (107), 0 states have call successors, (0), 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 107 [2025-01-09 04:53:38,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:53:38,456 INFO L225 Difference]: With dead ends: 8586 [2025-01-09 04:53:38,456 INFO L226 Difference]: Without dead ends: 8048 [2025-01-09 04:53:38,458 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=167, Invalid=535, Unknown=0, NotChecked=0, Total=702 [2025-01-09 04:53:38,458 INFO L435 NwaCegarLoop]: 497 mSDtfsCounter, 752 mSDsluCounter, 3855 mSDsCounter, 0 mSdLazyCounter, 674 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 752 SdHoareTripleChecker+Valid, 4352 SdHoareTripleChecker+Invalid, 678 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 674 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 04:53:38,459 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [752 Valid, 4352 Invalid, 678 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 674 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 04:53:38,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8048 states. [2025-01-09 04:53:38,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8048 to 2099. [2025-01-09 04:53:38,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2099 states, 2098 states have (on average 1.4451858913250715) internal successors, (3032), 2098 states have internal predecessors, (3032), 0 states have call successors, (0), 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-01-09 04:53:38,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2099 states to 2099 states and 3032 transitions. [2025-01-09 04:53:38,497 INFO L78 Accepts]: Start accepts. Automaton has 2099 states and 3032 transitions. Word has length 107 [2025-01-09 04:53:38,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:53:38,497 INFO L471 AbstractCegarLoop]: Abstraction has 2099 states and 3032 transitions. [2025-01-09 04:53:38,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 7.642857142857143) internal successors, (107), 14 states have internal predecessors, (107), 0 states have call successors, (0), 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-01-09 04:53:38,497 INFO L276 IsEmpty]: Start isEmpty. Operand 2099 states and 3032 transitions. [2025-01-09 04:53:38,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-01-09 04:53:38,497 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:53:38,498 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:53:38,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-01-09 04:53:38,498 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:53:38,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:53:38,498 INFO L85 PathProgramCache]: Analyzing trace with hash -246539873, now seen corresponding path program 1 times [2025-01-09 04:53:38,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:53:38,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925699782] [2025-01-09 04:53:38,498 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:53:38,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:53:38,508 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-01-09 04:53:38,516 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-01-09 04:53:38,516 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:53:38,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:53:38,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:53:38,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:53:38,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925699782] [2025-01-09 04:53:38,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925699782] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:53:38,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:53:38,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:53:38,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030508535] [2025-01-09 04:53:38,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:53:38,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:53:38,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:53:38,631 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:53:38,631 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:53:38,632 INFO L87 Difference]: Start difference. First operand 2099 states and 3032 transitions. Second operand has 5 states, 5 states have (on average 21.4) internal successors, (107), 5 states have internal predecessors, (107), 0 states have call successors, (0), 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-01-09 04:53:38,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:53:38,653 INFO L93 Difference]: Finished difference Result 2115 states and 3054 transitions. [2025-01-09 04:53:38,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:53:38,653 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.4) internal successors, (107), 5 states have internal predecessors, (107), 0 states have call successors, (0), 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 107 [2025-01-09 04:53:38,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:53:38,655 INFO L225 Difference]: With dead ends: 2115 [2025-01-09 04:53:38,655 INFO L226 Difference]: Without dead ends: 2113 [2025-01-09 04:53:38,655 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:53:38,655 INFO L435 NwaCegarLoop]: 213 mSDtfsCounter, 0 mSDsluCounter, 624 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 837 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:53:38,656 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 837 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:53:38,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2113 states. [2025-01-09 04:53:38,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2113 to 2113. [2025-01-09 04:53:38,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2113 states, 2112 states have (on average 1.4384469696969697) internal successors, (3038), 2112 states have internal predecessors, (3038), 0 states have call successors, (0), 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-01-09 04:53:38,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2113 states to 2113 states and 3038 transitions. [2025-01-09 04:53:38,670 INFO L78 Accepts]: Start accepts. Automaton has 2113 states and 3038 transitions. Word has length 107 [2025-01-09 04:53:38,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:53:38,670 INFO L471 AbstractCegarLoop]: Abstraction has 2113 states and 3038 transitions. [2025-01-09 04:53:38,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.4) internal successors, (107), 5 states have internal predecessors, (107), 0 states have call successors, (0), 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-01-09 04:53:38,670 INFO L276 IsEmpty]: Start isEmpty. Operand 2113 states and 3038 transitions. [2025-01-09 04:53:38,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-01-09 04:53:38,671 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:53:38,671 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:53:38,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-01-09 04:53:38,671 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:53:38,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:53:38,671 INFO L85 PathProgramCache]: Analyzing trace with hash 1041143963, now seen corresponding path program 1 times [2025-01-09 04:53:38,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:53:38,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271383708] [2025-01-09 04:53:38,672 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:53:38,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:53:38,684 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-01-09 04:53:38,692 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-01-09 04:53:38,693 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:53:38,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:53:38,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:53:38,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:53:38,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271383708] [2025-01-09 04:53:38,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271383708] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:53:38,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:53:38,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:53:38,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538080897] [2025-01-09 04:53:38,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:53:38,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:53:38,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:53:38,758 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:53:38,758 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:53:38,758 INFO L87 Difference]: Start difference. First operand 2113 states and 3038 transitions. Second operand has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 0 states have call successors, (0), 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-01-09 04:53:38,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:53:38,779 INFO L93 Difference]: Finished difference Result 4930 states and 7153 transitions. [2025-01-09 04:53:38,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 04:53:38,779 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 0 states have call successors, (0), 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 107 [2025-01-09 04:53:38,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:53:38,782 INFO L225 Difference]: With dead ends: 4930 [2025-01-09 04:53:38,782 INFO L226 Difference]: Without dead ends: 2941 [2025-01-09 04:53:38,783 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:53:38,784 INFO L435 NwaCegarLoop]: 290 mSDtfsCounter, 103 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 518 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:53:38,784 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 518 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:53:38,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2941 states. [2025-01-09 04:53:38,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2941 to 2939. [2025-01-09 04:53:38,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2939 states, 2938 states have (on average 1.439074200136147) internal successors, (4228), 2938 states have internal predecessors, (4228), 0 states have call successors, (0), 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-01-09 04:53:38,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2939 states to 2939 states and 4228 transitions. [2025-01-09 04:53:38,830 INFO L78 Accepts]: Start accepts. Automaton has 2939 states and 4228 transitions. Word has length 107 [2025-01-09 04:53:38,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:53:38,830 INFO L471 AbstractCegarLoop]: Abstraction has 2939 states and 4228 transitions. [2025-01-09 04:53:38,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 0 states have call successors, (0), 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-01-09 04:53:38,831 INFO L276 IsEmpty]: Start isEmpty. Operand 2939 states and 4228 transitions. [2025-01-09 04:53:38,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-01-09 04:53:38,832 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:53:38,832 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:53:38,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-01-09 04:53:38,832 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:53:38,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:53:38,833 INFO L85 PathProgramCache]: Analyzing trace with hash 1624576542, now seen corresponding path program 1 times [2025-01-09 04:53:38,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:53:38,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550556358] [2025-01-09 04:53:38,833 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:53:38,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:53:38,847 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-01-09 04:53:38,861 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-01-09 04:53:38,861 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:53:38,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:53:38,946 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:53:38,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:53:38,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550556358] [2025-01-09 04:53:38,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550556358] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:53:38,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:53:38,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:53:38,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167034659] [2025-01-09 04:53:38,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:53:38,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:53:38,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:53:38,949 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:53:38,949 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:53:38,949 INFO L87 Difference]: Start difference. First operand 2939 states and 4228 transitions. Second operand has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 0 states have call successors, (0), 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-01-09 04:53:38,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:53:38,974 INFO L93 Difference]: Finished difference Result 6060 states and 8760 transitions. [2025-01-09 04:53:38,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:53:38,974 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 0 states have call successors, (0), 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 139 [2025-01-09 04:53:38,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:53:38,978 INFO L225 Difference]: With dead ends: 6060 [2025-01-09 04:53:38,978 INFO L226 Difference]: Without dead ends: 4071 [2025-01-09 04:53:38,982 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:53:38,983 INFO L435 NwaCegarLoop]: 295 mSDtfsCounter, 98 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:53:38,983 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 470 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:53:38,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4071 states. [2025-01-09 04:53:39,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4071 to 3945. [2025-01-09 04:53:39,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3945 states, 3944 states have (on average 1.4373732251521298) internal successors, (5669), 3944 states have internal predecessors, (5669), 0 states have call successors, (0), 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-01-09 04:53:39,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3945 states to 3945 states and 5669 transitions. [2025-01-09 04:53:39,043 INFO L78 Accepts]: Start accepts. Automaton has 3945 states and 5669 transitions. Word has length 139 [2025-01-09 04:53:39,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:53:39,043 INFO L471 AbstractCegarLoop]: Abstraction has 3945 states and 5669 transitions. [2025-01-09 04:53:39,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 0 states have call successors, (0), 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-01-09 04:53:39,044 INFO L276 IsEmpty]: Start isEmpty. Operand 3945 states and 5669 transitions. [2025-01-09 04:53:39,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-01-09 04:53:39,045 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:53:39,045 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:53:39,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-01-09 04:53:39,045 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:53:39,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:53:39,046 INFO L85 PathProgramCache]: Analyzing trace with hash 1544847095, now seen corresponding path program 1 times [2025-01-09 04:53:39,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:53:39,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053003218] [2025-01-09 04:53:39,046 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:53:39,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:53:39,061 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-01-09 04:53:39,075 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-01-09 04:53:39,075 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:53:39,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:53:39,157 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:53:39,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:53:39,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053003218] [2025-01-09 04:53:39,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053003218] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:53:39,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:53:39,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:53:39,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023228280] [2025-01-09 04:53:39,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:53:39,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 04:53:39,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:53:39,158 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 04:53:39,158 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:53:39,158 INFO L87 Difference]: Start difference. First operand 3945 states and 5669 transitions. Second operand has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 6 states have internal predecessors, (141), 0 states have call successors, (0), 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-01-09 04:53:39,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:53:39,401 INFO L93 Difference]: Finished difference Result 10598 states and 15381 transitions. [2025-01-09 04:53:39,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 04:53:39,401 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 6 states have internal predecessors, (141), 0 states have call successors, (0), 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 141 [2025-01-09 04:53:39,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:53:39,407 INFO L225 Difference]: With dead ends: 10598 [2025-01-09 04:53:39,407 INFO L226 Difference]: Without dead ends: 6786 [2025-01-09 04:53:39,411 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2025-01-09 04:53:39,411 INFO L435 NwaCegarLoop]: 162 mSDtfsCounter, 1037 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 384 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1037 SdHoareTripleChecker+Valid, 499 SdHoareTripleChecker+Invalid, 396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 384 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:53:39,412 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1037 Valid, 499 Invalid, 396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 384 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 04:53:39,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6786 states. [2025-01-09 04:53:39,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6786 to 4224. [2025-01-09 04:53:39,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4224 states, 4223 states have (on average 1.4304996448022733) internal successors, (6041), 4223 states have internal predecessors, (6041), 0 states have call successors, (0), 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-01-09 04:53:39,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4224 states to 4224 states and 6041 transitions. [2025-01-09 04:53:39,453 INFO L78 Accepts]: Start accepts. Automaton has 4224 states and 6041 transitions. Word has length 141 [2025-01-09 04:53:39,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:53:39,454 INFO L471 AbstractCegarLoop]: Abstraction has 4224 states and 6041 transitions. [2025-01-09 04:53:39,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 6 states have internal predecessors, (141), 0 states have call successors, (0), 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-01-09 04:53:39,454 INFO L276 IsEmpty]: Start isEmpty. Operand 4224 states and 6041 transitions. [2025-01-09 04:53:39,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-01-09 04:53:39,455 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:53:39,455 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:53:39,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-01-09 04:53:39,455 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:53:39,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:53:39,455 INFO L85 PathProgramCache]: Analyzing trace with hash -1628702113, now seen corresponding path program 1 times [2025-01-09 04:53:39,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:53:39,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323796255] [2025-01-09 04:53:39,456 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:53:39,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:53:39,470 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-01-09 04:53:39,479 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-01-09 04:53:39,479 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:53:39,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:53:39,551 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:53:39,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:53:39,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323796255] [2025-01-09 04:53:39,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323796255] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:53:39,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:53:39,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:53:39,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040072238] [2025-01-09 04:53:39,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:53:39,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 04:53:39,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:53:39,554 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 04:53:39,554 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:53:39,554 INFO L87 Difference]: Start difference. First operand 4224 states and 6041 transitions. Second operand has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 6 states have internal predecessors, (141), 0 states have call successors, (0), 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-01-09 04:53:39,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:53:39,781 INFO L93 Difference]: Finished difference Result 14824 states and 21409 transitions. [2025-01-09 04:53:39,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 04:53:39,782 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 6 states have internal predecessors, (141), 0 states have call successors, (0), 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 141 [2025-01-09 04:53:39,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:53:39,792 INFO L225 Difference]: With dead ends: 14824 [2025-01-09 04:53:39,792 INFO L226 Difference]: Without dead ends: 10742 [2025-01-09 04:53:39,797 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2025-01-09 04:53:39,797 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 1058 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1058 SdHoareTripleChecker+Valid, 411 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:53:39,798 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1058 Valid, 411 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 292 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 04:53:39,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10742 states. [2025-01-09 04:53:39,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10742 to 8884. [2025-01-09 04:53:39,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8884 states, 8883 states have (on average 1.4339750084430936) internal successors, (12738), 8883 states have internal predecessors, (12738), 0 states have call successors, (0), 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-01-09 04:53:39,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8884 states to 8884 states and 12738 transitions. [2025-01-09 04:53:39,874 INFO L78 Accepts]: Start accepts. Automaton has 8884 states and 12738 transitions. Word has length 141 [2025-01-09 04:53:39,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:53:39,875 INFO L471 AbstractCegarLoop]: Abstraction has 8884 states and 12738 transitions. [2025-01-09 04:53:39,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 6 states have internal predecessors, (141), 0 states have call successors, (0), 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-01-09 04:53:39,875 INFO L276 IsEmpty]: Start isEmpty. Operand 8884 states and 12738 transitions. [2025-01-09 04:53:39,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-01-09 04:53:39,876 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:53:39,876 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:53:39,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-01-09 04:53:39,876 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:53:39,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:53:39,876 INFO L85 PathProgramCache]: Analyzing trace with hash -1701848944, now seen corresponding path program 1 times [2025-01-09 04:53:39,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:53:39,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203023149] [2025-01-09 04:53:39,877 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:53:39,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:53:39,887 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-01-09 04:53:39,896 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-01-09 04:53:39,896 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:53:39,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:53:40,004 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:53:40,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:53:40,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203023149] [2025-01-09 04:53:40,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203023149] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:53:40,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:53:40,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:53:40,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585363145] [2025-01-09 04:53:40,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:53:40,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 04:53:40,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:53:40,005 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 04:53:40,006 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:53:40,006 INFO L87 Difference]: Start difference. First operand 8884 states and 12738 transitions. Second operand has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 6 states have internal predecessors, (141), 0 states have call successors, (0), 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-01-09 04:53:40,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:53:40,243 INFO L93 Difference]: Finished difference Result 28920 states and 41616 transitions. [2025-01-09 04:53:40,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 04:53:40,244 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 6 states have internal predecessors, (141), 0 states have call successors, (0), 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 141 [2025-01-09 04:53:40,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:53:40,263 INFO L225 Difference]: With dead ends: 28920 [2025-01-09 04:53:40,263 INFO L226 Difference]: Without dead ends: 20178 [2025-01-09 04:53:40,274 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2025-01-09 04:53:40,275 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 973 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 285 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 973 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:53:40,275 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [973 Valid, 409 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 285 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 04:53:40,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20178 states. [2025-01-09 04:53:40,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20178 to 18784. [2025-01-09 04:53:40,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18784 states, 18783 states have (on average 1.4344886333386573) internal successors, (26944), 18783 states have internal predecessors, (26944), 0 states have call successors, (0), 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-01-09 04:53:40,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18784 states to 18784 states and 26944 transitions. [2025-01-09 04:53:40,440 INFO L78 Accepts]: Start accepts. Automaton has 18784 states and 26944 transitions. Word has length 141 [2025-01-09 04:53:40,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:53:40,441 INFO L471 AbstractCegarLoop]: Abstraction has 18784 states and 26944 transitions. [2025-01-09 04:53:40,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 6 states have internal predecessors, (141), 0 states have call successors, (0), 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-01-09 04:53:40,441 INFO L276 IsEmpty]: Start isEmpty. Operand 18784 states and 26944 transitions. [2025-01-09 04:53:40,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-01-09 04:53:40,442 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:53:40,442 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:53:40,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-01-09 04:53:40,442 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:53:40,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:53:40,443 INFO L85 PathProgramCache]: Analyzing trace with hash 182297884, now seen corresponding path program 1 times [2025-01-09 04:53:40,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:53:40,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842793314] [2025-01-09 04:53:40,443 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:53:40,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:53:40,453 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-01-09 04:53:40,461 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-01-09 04:53:40,462 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:53:40,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:53:40,534 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:53:40,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:53:40,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842793314] [2025-01-09 04:53:40,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842793314] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:53:40,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:53:40,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:53:40,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042601309] [2025-01-09 04:53:40,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:53:40,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 04:53:40,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:53:40,535 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 04:53:40,535 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:53:40,535 INFO L87 Difference]: Start difference. First operand 18784 states and 26944 transitions. Second operand has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 6 states have internal predecessors, (141), 0 states have call successors, (0), 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-01-09 04:53:40,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:53:40,830 INFO L93 Difference]: Finished difference Result 67668 states and 97690 transitions. [2025-01-09 04:53:40,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 04:53:40,831 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 6 states have internal predecessors, (141), 0 states have call successors, (0), 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 141 [2025-01-09 04:53:40,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:53:40,877 INFO L225 Difference]: With dead ends: 67668 [2025-01-09 04:53:40,877 INFO L226 Difference]: Without dead ends: 49026 [2025-01-09 04:53:40,898 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2025-01-09 04:53:40,899 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 1143 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 299 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1143 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:53:40,899 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1143 Valid, 413 Invalid, 313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 299 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 04:53:40,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49026 states. [2025-01-09 04:53:41,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49026 to 39744. [2025-01-09 04:53:41,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39744 states, 39743 states have (on average 1.4337115970107943) internal successors, (56980), 39743 states have internal predecessors, (56980), 0 states have call successors, (0), 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-01-09 04:53:41,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39744 states to 39744 states and 56980 transitions. [2025-01-09 04:53:41,429 INFO L78 Accepts]: Start accepts. Automaton has 39744 states and 56980 transitions. Word has length 141 [2025-01-09 04:53:41,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:53:41,429 INFO L471 AbstractCegarLoop]: Abstraction has 39744 states and 56980 transitions. [2025-01-09 04:53:41,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 6 states have internal predecessors, (141), 0 states have call successors, (0), 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-01-09 04:53:41,430 INFO L276 IsEmpty]: Start isEmpty. Operand 39744 states and 56980 transitions. [2025-01-09 04:53:41,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-01-09 04:53:41,430 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:53:41,431 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:53:41,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-01-09 04:53:41,431 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:53:41,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:53:41,431 INFO L85 PathProgramCache]: Analyzing trace with hash -2146985950, now seen corresponding path program 1 times [2025-01-09 04:53:41,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:53:41,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567319518] [2025-01-09 04:53:41,432 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:53:41,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:53:41,442 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-01-09 04:53:41,450 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-01-09 04:53:41,450 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:53:41,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:53:41,517 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:53:41,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:53:41,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567319518] [2025-01-09 04:53:41,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567319518] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:53:41,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:53:41,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:53:41,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581154104] [2025-01-09 04:53:41,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:53:41,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 04:53:41,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:53:41,519 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 04:53:41,519 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:53:41,519 INFO L87 Difference]: Start difference. First operand 39744 states and 56980 transitions. Second operand has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 6 states have internal predecessors, (141), 0 states have call successors, (0), 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-01-09 04:53:41,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:53:41,932 INFO L93 Difference]: Finished difference Result 149108 states and 215174 transitions. [2025-01-09 04:53:41,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 04:53:41,933 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 6 states have internal predecessors, (141), 0 states have call successors, (0), 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 141 [2025-01-09 04:53:41,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:53:42,392 INFO L225 Difference]: With dead ends: 149108 [2025-01-09 04:53:42,393 INFO L226 Difference]: Without dead ends: 109506 [2025-01-09 04:53:42,414 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2025-01-09 04:53:42,415 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 1228 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1228 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:53:42,415 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1228 Valid, 415 Invalid, 320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 04:53:42,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109506 states. [2025-01-09 04:53:43,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109506 to 83984. [2025-01-09 04:53:43,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83984 states, 83983 states have (on average 1.4324327542478834) internal successors, (120300), 83983 states have internal predecessors, (120300), 0 states have call successors, (0), 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-01-09 04:53:43,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83984 states to 83984 states and 120300 transitions. [2025-01-09 04:53:43,874 INFO L78 Accepts]: Start accepts. Automaton has 83984 states and 120300 transitions. Word has length 141 [2025-01-09 04:53:43,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:53:43,874 INFO L471 AbstractCegarLoop]: Abstraction has 83984 states and 120300 transitions. [2025-01-09 04:53:43,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 6 states have internal predecessors, (141), 0 states have call successors, (0), 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-01-09 04:53:43,874 INFO L276 IsEmpty]: Start isEmpty. Operand 83984 states and 120300 transitions. [2025-01-09 04:53:43,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2025-01-09 04:53:43,885 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:53:43,885 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:53:43,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-01-09 04:53:43,886 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:53:43,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:53:43,886 INFO L85 PathProgramCache]: Analyzing trace with hash 2131140626, now seen corresponding path program 1 times [2025-01-09 04:53:43,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:53:43,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152659366] [2025-01-09 04:53:43,886 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:53:43,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:53:43,898 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-01-09 04:53:43,907 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-01-09 04:53:43,907 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:53:43,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:53:44,105 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-01-09 04:53:44,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:53:44,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152659366] [2025-01-09 04:53:44,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152659366] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:53:44,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:53:44,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:53:44,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547800031] [2025-01-09 04:53:44,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:53:44,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:53:44,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:53:44,106 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:53:44,106 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:53:44,107 INFO L87 Difference]: Start difference. First operand 83984 states and 120300 transitions. Second operand has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 0 states have call successors, (0), 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-01-09 04:53:44,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:53:44,519 INFO L93 Difference]: Finished difference Result 162932 states and 232990 transitions. [2025-01-09 04:53:44,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:53:44,519 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 0 states have call successors, (0), 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 172 [2025-01-09 04:53:44,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:53:44,605 INFO L225 Difference]: With dead ends: 162932 [2025-01-09 04:53:44,605 INFO L226 Difference]: Without dead ends: 79087 [2025-01-09 04:53:44,644 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:53:44,644 INFO L435 NwaCegarLoop]: 276 mSDtfsCounter, 92 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:53:44,644 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 457 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:53:44,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79087 states. [2025-01-09 04:53:45,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79087 to 77639. [2025-01-09 04:53:45,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77639 states, 77638 states have (on average 1.4226023339086529) internal successors, (110448), 77638 states have internal predecessors, (110448), 0 states have call successors, (0), 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-01-09 04:53:46,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77639 states to 77639 states and 110448 transitions. [2025-01-09 04:53:46,006 INFO L78 Accepts]: Start accepts. Automaton has 77639 states and 110448 transitions. Word has length 172 [2025-01-09 04:53:46,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:53:46,006 INFO L471 AbstractCegarLoop]: Abstraction has 77639 states and 110448 transitions. [2025-01-09 04:53:46,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 0 states have call successors, (0), 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-01-09 04:53:46,007 INFO L276 IsEmpty]: Start isEmpty. Operand 77639 states and 110448 transitions. [2025-01-09 04:53:46,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2025-01-09 04:53:46,015 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:53:46,015 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:53:46,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-01-09 04:53:46,016 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:53:46,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:53:46,016 INFO L85 PathProgramCache]: Analyzing trace with hash -1214191698, now seen corresponding path program 1 times [2025-01-09 04:53:46,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:53:46,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515688003] [2025-01-09 04:53:46,016 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:53:46,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:53:46,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-01-09 04:53:46,038 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-01-09 04:53:46,038 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:53:46,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:53:46,124 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-01-09 04:53:46,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:53:46,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515688003] [2025-01-09 04:53:46,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515688003] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:53:46,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:53:46,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:53:46,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047175012] [2025-01-09 04:53:46,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:53:46,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:53:46,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:53:46,125 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:53:46,125 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:53:46,125 INFO L87 Difference]: Start difference. First operand 77639 states and 110448 transitions. Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 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-01-09 04:53:46,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:53:46,603 INFO L93 Difference]: Finished difference Result 150275 states and 213330 transitions. [2025-01-09 04:53:46,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:53:46,603 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 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 173 [2025-01-09 04:53:46,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:53:46,678 INFO L225 Difference]: With dead ends: 150275 [2025-01-09 04:53:46,678 INFO L226 Difference]: Without dead ends: 72769 [2025-01-09 04:53:46,703 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:53:46,703 INFO L435 NwaCegarLoop]: 271 mSDtfsCounter, 85 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 458 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:53:46,704 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 458 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:53:46,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72769 states. [2025-01-09 04:53:47,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72769 to 71375. [2025-01-09 04:53:47,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71375 states, 71374 states have (on average 1.410933953540505) internal successors, (100704), 71374 states have internal predecessors, (100704), 0 states have call successors, (0), 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-01-09 04:53:47,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71375 states to 71375 states and 100704 transitions. [2025-01-09 04:53:47,593 INFO L78 Accepts]: Start accepts. Automaton has 71375 states and 100704 transitions. Word has length 173 [2025-01-09 04:53:47,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:53:47,593 INFO L471 AbstractCegarLoop]: Abstraction has 71375 states and 100704 transitions. [2025-01-09 04:53:47,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 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-01-09 04:53:47,593 INFO L276 IsEmpty]: Start isEmpty. Operand 71375 states and 100704 transitions. [2025-01-09 04:53:47,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2025-01-09 04:53:47,603 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:53:47,603 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1, 1, 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-01-09 04:53:47,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-01-09 04:53:47,603 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:53:47,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:53:47,604 INFO L85 PathProgramCache]: Analyzing trace with hash 522773387, now seen corresponding path program 1 times [2025-01-09 04:53:47,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:53:47,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979960588] [2025-01-09 04:53:47,604 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:53:47,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:53:47,620 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-01-09 04:53:47,635 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-01-09 04:53:47,635 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:53:47,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:53:47,731 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-01-09 04:53:47,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:53:47,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979960588] [2025-01-09 04:53:47,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979960588] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:53:47,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:53:47,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:53:47,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749692802] [2025-01-09 04:53:47,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:53:47,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:53:47,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:53:47,732 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:53:47,732 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:53:47,733 INFO L87 Difference]: Start difference. First operand 71375 states and 100704 transitions. Second operand has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 0 states have call successors, (0), 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-01-09 04:53:48,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:53:48,109 INFO L93 Difference]: Finished difference Result 137747 states and 193842 transitions. [2025-01-09 04:53:48,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:53:48,109 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 0 states have call successors, (0), 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 174 [2025-01-09 04:53:48,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:53:48,174 INFO L225 Difference]: With dead ends: 137747 [2025-01-09 04:53:48,174 INFO L226 Difference]: Without dead ends: 66505 [2025-01-09 04:53:48,217 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:53:48,217 INFO L435 NwaCegarLoop]: 266 mSDtfsCounter, 78 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 459 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:53:48,219 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 459 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:53:48,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66505 states. [2025-01-09 04:53:48,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66505 to 65111. [2025-01-09 04:53:48,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65111 states, 65110 states have (on average 1.3970204269697435) internal successors, (90960), 65110 states have internal predecessors, (90960), 0 states have call successors, (0), 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-01-09 04:53:48,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65111 states to 65111 states and 90960 transitions. [2025-01-09 04:53:48,932 INFO L78 Accepts]: Start accepts. Automaton has 65111 states and 90960 transitions. Word has length 174 [2025-01-09 04:53:48,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:53:48,932 INFO L471 AbstractCegarLoop]: Abstraction has 65111 states and 90960 transitions. [2025-01-09 04:53:48,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 0 states have call successors, (0), 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-01-09 04:53:48,932 INFO L276 IsEmpty]: Start isEmpty. Operand 65111 states and 90960 transitions. [2025-01-09 04:53:48,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-01-09 04:53:48,940 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:53:48,940 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 04:53:48,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-01-09 04:53:48,941 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:53:48,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:53:48,941 INFO L85 PathProgramCache]: Analyzing trace with hash -1986955949, now seen corresponding path program 1 times [2025-01-09 04:53:48,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:53:48,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722277543] [2025-01-09 04:53:48,941 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:53:48,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:53:48,960 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-01-09 04:53:48,970 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-01-09 04:53:48,970 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:53:48,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:53:49,033 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-01-09 04:53:49,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:53:49,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722277543] [2025-01-09 04:53:49,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722277543] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:53:49,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:53:49,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:53:49,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736588140] [2025-01-09 04:53:49,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:53:49,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:53:49,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:53:49,034 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:53:49,034 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:53:49,034 INFO L87 Difference]: Start difference. First operand 65111 states and 90960 transitions. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 0 states have call successors, (0), 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-01-09 04:53:49,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:53:49,245 INFO L93 Difference]: Finished difference Result 125219 states and 174354 transitions. [2025-01-09 04:53:49,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:53:49,245 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 0 states have call successors, (0), 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 175 [2025-01-09 04:53:49,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:53:49,312 INFO L225 Difference]: With dead ends: 125219 [2025-01-09 04:53:49,313 INFO L226 Difference]: Without dead ends: 60241 [2025-01-09 04:53:49,357 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:53:49,358 INFO L435 NwaCegarLoop]: 261 mSDtfsCounter, 71 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 460 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:53:49,363 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 460 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:53:49,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60241 states. [2025-01-09 04:53:50,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60241 to 58847. [2025-01-09 04:53:50,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58847 states, 58846 states have (on average 1.3801447846922477) internal successors, (81216), 58846 states have internal predecessors, (81216), 0 states have call successors, (0), 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-01-09 04:53:50,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58847 states to 58847 states and 81216 transitions. [2025-01-09 04:53:50,288 INFO L78 Accepts]: Start accepts. Automaton has 58847 states and 81216 transitions. Word has length 175 [2025-01-09 04:53:50,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:53:50,292 INFO L471 AbstractCegarLoop]: Abstraction has 58847 states and 81216 transitions. [2025-01-09 04:53:50,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 0 states have call successors, (0), 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-01-09 04:53:50,292 INFO L276 IsEmpty]: Start isEmpty. Operand 58847 states and 81216 transitions. [2025-01-09 04:53:50,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-01-09 04:53:50,299 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:53:50,299 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:53:50,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-01-09 04:53:50,299 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:53:50,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:53:50,303 INFO L85 PathProgramCache]: Analyzing trace with hash -1846313828, now seen corresponding path program 1 times [2025-01-09 04:53:50,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:53:50,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122291858] [2025-01-09 04:53:50,303 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:53:50,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:53:50,318 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-01-09 04:53:50,531 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-01-09 04:53:50,531 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:53:50,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:53:50,673 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-09 04:53:50,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:53:50,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122291858] [2025-01-09 04:53:50,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122291858] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:53:50,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:53:50,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:53:50,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462641323] [2025-01-09 04:53:50,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:53:50,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:53:50,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:53:50,674 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:53:50,675 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:53:50,675 INFO L87 Difference]: Start difference. First operand 58847 states and 81216 transitions. Second operand has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 0 states have call successors, (0), 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-01-09 04:53:51,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:53:51,039 INFO L93 Difference]: Finished difference Result 171171 states and 235010 transitions. [2025-01-09 04:53:51,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:53:51,039 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 0 states have call successors, (0), 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 176 [2025-01-09 04:53:51,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:53:51,168 INFO L225 Difference]: With dead ends: 171171 [2025-01-09 04:53:51,168 INFO L226 Difference]: Without dead ends: 112457 [2025-01-09 04:53:51,220 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:53:51,221 INFO L435 NwaCegarLoop]: 256 mSDtfsCounter, 64 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:53:51,221 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 461 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:53:51,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112457 states. [2025-01-09 04:53:52,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112457 to 105959. [2025-01-09 04:53:52,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105959 states, 105958 states have (on average 1.3652201815813814) internal successors, (144656), 105958 states have internal predecessors, (144656), 0 states have call successors, (0), 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-01-09 04:53:52,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105959 states to 105959 states and 144656 transitions. [2025-01-09 04:53:52,826 INFO L78 Accepts]: Start accepts. Automaton has 105959 states and 144656 transitions. Word has length 176 [2025-01-09 04:53:52,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:53:52,826 INFO L471 AbstractCegarLoop]: Abstraction has 105959 states and 144656 transitions. [2025-01-09 04:53:52,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 0 states have call successors, (0), 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-01-09 04:53:52,827 INFO L276 IsEmpty]: Start isEmpty. Operand 105959 states and 144656 transitions. [2025-01-09 04:53:52,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-01-09 04:53:52,833 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:53:52,833 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:53:52,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2025-01-09 04:53:52,833 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:53:52,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:53:52,833 INFO L85 PathProgramCache]: Analyzing trace with hash -1494574960, now seen corresponding path program 1 times [2025-01-09 04:53:52,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:53:52,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067749066] [2025-01-09 04:53:52,834 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:53:52,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:53:52,846 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-01-09 04:53:52,859 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-01-09 04:53:52,859 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:53:52,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:53:53,044 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 19 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:53:53,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:53:53,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067749066] [2025-01-09 04:53:53,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067749066] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:53:53,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2060256519] [2025-01-09 04:53:53,046 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:53:53,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:53:53,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:53:53,048 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 04:53:53,055 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 04:53:53,179 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-01-09 04:53:53,248 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-01-09 04:53:53,248 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:53:53,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:53:53,252 INFO L256 TraceCheckSpWp]: Trace formula consists of 787 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-01-09 04:53:53,260 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:53:54,157 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 19 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:53:54,157 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 04:53:55,985 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 19 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:53:55,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2060256519] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 04:53:55,986 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 04:53:55,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 21 [2025-01-09 04:53:55,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938223086] [2025-01-09 04:53:55,986 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 04:53:55,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-01-09 04:53:55,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:53:55,987 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-01-09 04:53:55,988 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=372, Unknown=0, NotChecked=0, Total=462 [2025-01-09 04:53:55,988 INFO L87 Difference]: Start difference. First operand 105959 states and 144656 transitions. Second operand has 22 states, 22 states have (on average 20.318181818181817) internal successors, (447), 21 states have internal predecessors, (447), 0 states have call successors, (0), 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-01-09 04:53:57,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:53:57,876 INFO L93 Difference]: Finished difference Result 455539 states and 622997 transitions. [2025-01-09 04:53:57,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-01-09 04:53:57,877 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 20.318181818181817) internal successors, (447), 21 states have internal predecessors, (447), 0 states have call successors, (0), 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 177 [2025-01-09 04:53:57,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:53:58,540 INFO L225 Difference]: With dead ends: 455539 [2025-01-09 04:53:58,540 INFO L226 Difference]: Without dead ends: 349713 [2025-01-09 04:53:58,620 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 380 GetRequests, 341 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 308 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=422, Invalid=1218, Unknown=0, NotChecked=0, Total=1640 [2025-01-09 04:53:58,628 INFO L435 NwaCegarLoop]: 209 mSDtfsCounter, 1454 mSDsluCounter, 1449 mSDsCounter, 0 mSdLazyCounter, 1593 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1454 SdHoareTripleChecker+Valid, 1658 SdHoareTripleChecker+Invalid, 1603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1593 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 04:53:58,628 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1454 Valid, 1658 Invalid, 1603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1593 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 04:53:58,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349713 states. [2025-01-09 04:54:01,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349713 to 250485. [2025-01-09 04:54:02,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250485 states, 250484 states have (on average 1.3619792082528226) internal successors, (341154), 250484 states have internal predecessors, (341154), 0 states have call successors, (0), 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-01-09 04:54:02,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250485 states to 250485 states and 341154 transitions. [2025-01-09 04:54:02,567 INFO L78 Accepts]: Start accepts. Automaton has 250485 states and 341154 transitions. Word has length 177 [2025-01-09 04:54:02,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:54:02,569 INFO L471 AbstractCegarLoop]: Abstraction has 250485 states and 341154 transitions. [2025-01-09 04:54:02,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 20.318181818181817) internal successors, (447), 21 states have internal predecessors, (447), 0 states have call successors, (0), 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-01-09 04:54:02,570 INFO L276 IsEmpty]: Start isEmpty. Operand 250485 states and 341154 transitions. [2025-01-09 04:54:02,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-01-09 04:54:02,583 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:54:02,584 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:54:02,593 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 04:54:02,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:54:02,789 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:54:02,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:54:02,790 INFO L85 PathProgramCache]: Analyzing trace with hash -231623854, now seen corresponding path program 1 times [2025-01-09 04:54:02,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:54:02,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222596083] [2025-01-09 04:54:02,791 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:54:02,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:54:02,806 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-01-09 04:54:02,821 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-01-09 04:54:02,821 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:54:02,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:54:03,342 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 19 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:54:03,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:54:03,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222596083] [2025-01-09 04:54:03,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222596083] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:54:03,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1701362279] [2025-01-09 04:54:03,343 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:54:03,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:54:03,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:54:03,345 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 04:54:03,348 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 04:54:03,460 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-01-09 04:54:03,527 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-01-09 04:54:03,527 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:54:03,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:54:03,531 INFO L256 TraceCheckSpWp]: Trace formula consists of 787 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-01-09 04:54:03,534 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:54:04,209 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 21 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:54:04,210 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 04:54:06,717 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 21 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:54:06,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1701362279] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 04:54:06,717 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 04:54:06,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 29 [2025-01-09 04:54:06,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643117618] [2025-01-09 04:54:06,718 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 04:54:06,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-01-09 04:54:06,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:54:06,723 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-01-09 04:54:06,723 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=768, Unknown=0, NotChecked=0, Total=870 [2025-01-09 04:54:06,723 INFO L87 Difference]: Start difference. First operand 250485 states and 341154 transitions. Second operand has 30 states, 30 states have (on average 16.1) internal successors, (483), 29 states have internal predecessors, (483), 0 states have call successors, (0), 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-01-09 04:54:20,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:54:20,679 INFO L93 Difference]: Finished difference Result 2096668 states and 2856423 transitions. [2025-01-09 04:54:20,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 155 states. [2025-01-09 04:54:20,680 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 16.1) internal successors, (483), 29 states have internal predecessors, (483), 0 states have call successors, (0), 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 177 [2025-01-09 04:54:20,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:54:24,232 INFO L225 Difference]: With dead ends: 2096668 [2025-01-09 04:54:24,232 INFO L226 Difference]: Without dead ends: 1846346 [2025-01-09 04:54:24,488 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 516 GetRequests, 335 SyntacticMatches, 0 SemanticMatches, 181 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11208 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=4171, Invalid=29135, Unknown=0, NotChecked=0, Total=33306 [2025-01-09 04:54:24,495 INFO L435 NwaCegarLoop]: 377 mSDtfsCounter, 7782 mSDsluCounter, 5778 mSDsCounter, 0 mSdLazyCounter, 6741 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7782 SdHoareTripleChecker+Valid, 6155 SdHoareTripleChecker+Invalid, 6822 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 6741 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-01-09 04:54:24,496 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7782 Valid, 6155 Invalid, 6822 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 6741 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2025-01-09 04:54:25,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1846346 states.